An exact algorithm for the asymmetrical capacitated vehicle routing problem

Networks

Volumn 16, Issue 1, 1986, Pages 33-46

  Laporte, Gilbert ^a   Mercure, Hélène ^a   Nobert, Yves ^b  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGORITHMS; STREET TRAFFIC CONTROL;

BRANCHING RULES; CAPACITY RESTRICTIONS; EXACT ALGORITHM; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

TRANSPORTATION;

EID: 0022678438     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230160104     Document Type: Article

References (20)

1. A restricted lagrangean approach to the travelling salesman problem
2. Partitioning procedures for solving mixed‐variables programming problems
3. Routing and scheduling of vehicles and crews. The state of the art
4. Some new branching and bounding criteria for the asymmetric travelling salesman problem
5. The vehicle routing problem
6. Exact algorithms for the vehicle routing problem. based on spanning tree and shortest path relaxations
7. State‐space relaxation procedures for the computation of bounds for the travelling salesman problem
8. Scheduling of vehicles from a central depot to a number of delivery points
9. A cutting planes algorithm for the m‐salesmen problem
10. A branch and bound algorithm for the capacitated vehicle routing problem
11. Two exact algorithms for the distance con strained vehicle routing problem
12. Optimal routing under capacity and distance restrictions
13. Some simple applications of the travelling salesman problem
14. An algorithm for the travelling salesman problem
15. Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
16. On the symmetric travelling salesman problem: a computational study