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 …

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 …

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 …

Quantum computing is offering a novel perspective for solving combinatorial optimization
problems. To fully explore the possibilities offered by quantum computers, the problems …

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 …

To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of
electric vehicles. The resulting distribution planning problems present new computational …

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 …

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 …

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 …

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 …