The vehicle routing problem: An overview of exact and approximate algorithms

European Journal of Operational Research

Volumn 59, Issue 3, 1992, Pages 345-358

  Laporte, Gilbert ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

survey; Vehicle Routing Problem

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGORITHMS; TRANSPORTATION - MATHEMATICAL MODELS; TRANSPORTATION - OPERATIONS RESEARCH;

VEHICLE ROUTING PROBLEM;

TRANSPORTATION;

EID: 0026874435     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(92)90192-C     Document Type: Article

References (41)

1. A set-partitioning-based algorithm for the vehicle routing problem
2. On an integer program for a delivery problem
3. Partitioning procedures for solving mixed-variables programming problems
4. Routing and scheduling of vehicles and crews. The state of the art
5. Vehicle routing
6. Vehicle scheduling and routing
7. The vehicle routing problem
8. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
9. State space relaxation procedures for the computation of bounds to routing problems
10. Scheduling of vehicles from a central depot to a number of delivery points
11. A new optimization algorithm for the vehicle routing problem with time windows
12. A classification scheme for vehicle routing and scheduling problems
13. Routing with time windows by column generation
14. A decomposition algorithm for large-scale vehicle routing
15. A generalized assignment heuristic for vehicle routing
16. An integer programming approach to the vehicle scheduling problem
17. Bases for vehicle fleet scheduling
18. New insertion and post-optimization procedures for the traveling salesman problem
19. A heuristic algorithm for the vehicle dispatch problem
20. Implementing vehicle routing algorithms
21. Développements algorithmiques récents et perspectives de recherche en distributique
22. The traveling salesman problem: An overview of exact and approximate algorithms
23. An exact algorithm for the asymmetrical capacitated vehicle routing problem
24. A branch-and-bound algorithm for a class asymmetrical vehicle routing problems
25. Exact algorithms for the vehicle routing problem
26. Optimal routing under capacity and distance restrictions
27. Some simple applications of the travelling salesman problem
28. Computer solutions of the traveling salesman problem
29. Generalized assignment problem
30. Implementation techniques for the vehicle routing problem
31. Route-constrained fleet scheduling
32. The savings algorithm for the vehicle problem, Europeam Journal Operational Research
33. Allocation of transportation units to alternative trips- A column generation scheme with out-of-killer
34. Location under time or distance constraints
35. Computer scheduling of vehicles from one or more depots to a number of delivery points
36. A computational modification to the savings method of vehicle scheduling