A literature review on the vehicle routing problem with multiple depots
JR Montoya-Torres, JL Franco, SN Isaza… - Computers & Industrial …, 2015 - Elsevier
In this paper, we present a state-of-the-art survey on the vehicle routing problem with
multiple depots (MDVRP). Our review considered papers published between 1988 and …
multiple depots (MDVRP). Our review considered papers published between 1988 and …
Survey of green vehicle routing problem: past and future trends
Green Logistics has emerged as the new agenda item in supply chain management. The
traditional objective of distribution management has been upgraded to minimizing system …
traditional objective of distribution management has been upgraded to minimizing system …
The electric vehicle-routing problem with time windows and recharging stations
M Schneider, A Stenger, D Goeke - Transportation science, 2014 - pubsonline.informs.org
Driven by new laws and regulations concerning the emission of greenhouse gases, carriers
are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of …
are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of …
Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food
Increasing environmental, legislative, and social concerns are forcing companies to take a
fresh view of the impact of supply chain operations on environment and society when …
fresh view of the impact of supply chain operations on environment and society when …
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a
large class of time-constrained vehicle routing problems, introducing several new features to …
large class of time-constrained vehicle routing problems, introducing several new features to …
[图书][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
A taxonomy for task allocation problems with temporal and ordering constraints
Previous work on assigning tasks to robots has proposed extensive categorizations of
allocation of tasks with and without constraints. The main contribution of this paper is a …
allocation of tasks with and without constraints. The main contribution of this paper is a …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi …
Sustainability has been considered as a growing concern in supply chain network design
(SCND) and in the order allocation problem (OAP). Accordingly, there still exists a gap in the …
(SCND) and in the order allocation problem (OAP). Accordingly, there still exists a gap in the …
The dial-a-ride problem with electric vehicles and battery swapping stations
Abstract The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and
schedules for customers with special needs and/or disabilities. The DARP with Electric …
schedules for customers with special needs and/or disabilities. The DARP with Electric …