Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
From MaRDI portal
Publication:1651704
DOI10.1016/j.ejor.2018.04.009zbMath1403.90157OpenAlexW2796733585MaRDI QIDQ1651704
Ruslan Sadykov, Eduardo Uchoa, Artur Alves Pessoa
Publication date: 12 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.009
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
MineReduce: an approach based on data mining for problem size reduction ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ A generic exact solver for vehicle routing and related problems ⋮ Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem ⋮ An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics ⋮ Solving bin packing problems using VRPSolver models ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the capacitated vehicle routing problem
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- A column generation approach to the heterogeneous fleet vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Industrial aspects and literature survey: fleet composition and routing
- The fleet size and mix vehicle routing problem
- Limited memory rank-1 cuts for vehicle routing problems
- New benchmark instances for the capacitated vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A unified exact method for solving different classes of vehicle routing problems
- Improved branch-cut-and-price for capacitated vehicle routing
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Routing a Heterogeneous Fleet of Vehicles
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A heuristic column generation method for the heterogeneous fleet VRP
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem
