A concise guide to existing and emerging vehicle routing problem variants
Vehicle routing problems have been the focus of extensive research over the past sixty
years, driven by their economic importance and their theoretical interest. The diversity of …
years, driven by their economic importance and their theoretical interest. The diversity of …
Exact branch-price-and-cut algorithms for vehicle routing
Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …
A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem
This study investigates a practical heterogeneous vehicle routing problem that involves
routing a predefined fleet with different vehicle capacities to serve a series of customers to …
routing a predefined fleet with different vehicle capacities to serve a series of customers to …
A generic exact solver for vehicle routing and related problems
Major advances were recently obtained in the exact solution of vehicle routing problems
(VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical …
(VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical …
A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows
Y Yu, S Wang, J Wang, M Huang - Transportation Research Part B …, 2019 - Elsevier
Heterogeneous fleet vehicles can be used to reduce carbon emissions. We propose an
improved branch-and-price (BAP) algorithm to precisely solve the heterogeneous fleet …
improved branch-and-price (BAP) algorithm to precisely solve the heterogeneous fleet …
A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints
Since the multidepot vehicle routing problem with time windows and three-dimensional
loading constraints (MDVRPTW-TDLC) is a multiconstraint and combinatorial optimization …
loading constraints (MDVRPTW-TDLC) is a multiconstraint and combinatorial optimization …
Integrated optimization of transportation, inventory and vehicle routing with simultaneous pickup and delivery in two-echelon green supply chain network
The economic concern, environmental awareness related legislations, and potential
recycling benefits are the main motives that have changed the dimension of supply chain …
recycling benefits are the main motives that have changed the dimension of supply chain …
Certified dominance and symmetry breaking for combinatorial optimisation
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
Certified symmetry and dominance breaking for combinatorial optimisation
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
The vehicle routing problem (VRP) with simultaneous pickup and delivery (VRPSPD) is a
classical combinatorial optimization problem in which one aims at determining least-cost …
classical combinatorial optimization problem in which one aims at determining least-cost …