A new subtour elimination constraint for the vehicle routing problem

DOI10.1016/0377-2217(94)00332-7zbMath0924.90057MaRDI QIDQ1278251

Louis Caccetta, N. R. Achuthan, Stephen P. Hill

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00332-7

zbMATH Keywords

integer programming; combinatorial optimization; vehicle routing

Mathematics Subject Classification ID

90C10: Integer programming

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization

Related Items

On the vehicle routing problem, Branch and cut methods for network optimization, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Integer linear programming formulation for a vehicle routing problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Optimal Routing under Capacity and Distance Restrictions
• An exact algorithm for the asymmetrical capacitated vehicle routing problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
• A set‐partitioning‐based exact algorithm for the vehicle routing problem