Recent advances in vehicle routing exact algorithms

DOI10.1007/s10288-007-0063-3zbMath1160.90312MaRDI QIDQ926561

Paolo Toth, Roberto Baldacci, Daniele Vigo

Publication date: 20 May 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0063-3

zbMATH Keywords

survey; vehicle routing; exact algorithms

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem

Uses Software

• CPLEX
• Cliquer
• VRP
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polyhedral study of the capacitated vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• A result on projection for the vehicle routing problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• On the capacitated vehicle routing problem
• Separating capacity constraints in the CVRP using tabu search
• A fast algorithm for the maximum clique problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• On the symmetric travelling salesman problem I: Inequalities
• Optimal Routing under Capacity and Distance Restrictions
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Implementing vehicle routing algorithms
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Edmonds polytopes and weakly hamiltonian graphs