A savings based method for real-life vehicle routing problems

Journal of the Operational Research Society

Volumn 53, Issue 1, 2002, Pages 57-68

  Poot, A ^a,b   Kant, G ^a   Wagelmans, A P M ^b  

^a ORTEC The Netherlands   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Distribution; Road transport; Vehicle routing

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; GROUND VEHICLES; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TRANSPORTATION ROUTES;

SAVINGS BASED ALGORITHM; VEHICLE ROUTING PROBLEMS; WORKLOAD;

ALGORITHMS;

EID: 85047695991     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave/jors/2601252     Document Type: Article

References (15)

1. Dantzig GB and Ramser JH (1959). The truck dispatching problem. Mngt Sci 6: 80-91.
2. Fisher M (1995). Vehicle routing. In: Ball M, Magnanti T, Monma C and Nemhauser G (eds). Handbooks in Operations Research and Management Science 8: Network Routing. Elsevier Science: Amsterdam, pp 1-33.
3. Tan KC, Lee LH and Zue KQ (1999). Heuristic methods for vehicle routing problems with time windows. Technical report, Department of Electrical Engineering, National University of Singapore.
4. Semet F (1995). A two-phase algorithm for the partial accessi- bility constrained vehicle routing problem. Ann Opns Res 61: 45-65.
5. Chao I-M, Golden B and Wasil E (1999). A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR 37: 319-336.
6. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119.
7. Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
8. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns Res 35: 254-265.
9. Eibl P (1996). Computerised Vehicle Routing and Scheduling in Road Transport. Ashgate: Aldershot.
10. Potvin JY and Rousseau JM (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Opl Res 66: 331-340.
11. Golden B, Assad A, Levy L and Gheysens F (1984). The fleet size mix vehicle routing problem. Comput Opl Res 11: 49-66.
12. Altinkemer K and Gavish B (1991). Parallel savings based heuristics for the delivery problem. Opns Res 39: 456-469.
13. Desrochers M and Verhoog TW (1991). A new heuristic for the fleet size and mix vehicle routing problem. Comput Opl Res 18: 263-274.
14. Poot A (1997). De toepassing van savings in de praktijk. MSc thesis (in Dutch), Erasmus University, Rotterdam.
15. Savelsbergh MWP (1992). The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4: 146-154.