Last-mile delivery concepts: a survey from an operational research perspective
In the wake of e-commerce and its successful diffusion in most commercial activities, last-
mile distribution causes more and more trouble in urban areas all around the globe …
mile distribution causes more and more trouble in urban areas all around the globe …
An exact algorithm for the green vehicle routing problem
J Andelmin, E Bartolini - Transportation Science, 2017 - pubsonline.informs.org
We propose an exact algorithm for solving the green vehicle routing problem (G-VRP). The
G-VRP models the optimal routing of an alternative fuel vehicle fleet to serve a set of …
G-VRP models the optimal routing of an alternative fuel vehicle fleet to serve a set of …
Vehicle routing with roaming delivery locations
D Reyes, M Savelsbergh, A Toriello - Transportation Research Part C …, 2017 - Elsevier
We propose the vehicle routing problem with roaming delivery locations (VRPRDL) to model
an innovation in last-mile delivery where a customer's order is delivered to the trunk of his …
an innovation in last-mile delivery where a customer's order is delivered to the trunk of his …
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Quantum computing is offering a novel perspective for solving combinatorial optimization
problems. To fully explore the possibilities offered by quantum computers, the problems …
problems. To fully explore the possibilities offered by quantum computers, the problems …
An exact solution framework for multitrip vehicle-routing problems with time windows
Multitrip vehicle-routing problems (MTVRPs) generalize the well-known VRP by allowing
vehicles to perform multiple trips per day. MTVRPs have received a lot of attention lately …
vehicles to perform multiple trips per day. MTVRPs have received a lot of attention lately …
The electric traveling salesman problem with time windows
To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of
electric vehicles. The resulting distribution planning problems present new computational …
electric vehicles. The resulting distribution planning problems present new computational …
Discrete optimization with decision diagrams
We propose a general branch-and-bound algorithm for discrete optimization in which binary
decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In …
decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In …
[HTML][HTML] A survey on the Traveling Salesman Problem and its variants in a warehousing context
With the advent of e-commerce and its fast-delivery expectations, efficiently routing pickers
in warehouses and distribution centers has received renewed interest. The processes and …
in warehouses and distribution centers has received renewed interest. The processes and …
An exact algorithm for the elementary shortest path problem with resource constraints
The elementary shortest path problem with resource constraints (ESPPRC) is an NP-hard
problem that often arises in the context of column generation for vehicle routing problems …
problem that often arises in the context of column generation for vehicle routing problems …
Integrating driver behavior into last-mile delivery routing: Combining machine learning and optimization in a hybrid decision support framework
The overall quality of last-mile delivery in terms of operational costs and customer
satisfaction is primarily affected by traditional logistics planning and the consideration and …
satisfaction is primarily affected by traditional logistics planning and the consideration and …