A greedy look-ahead heuristic for the vehicle routing problem with time windows

Journal of the Operational Research Society

Volumn 52, Issue 5, 2001, Pages 523-537

  Loannou, G ^a   Kritikos, M ^a   Prastacos, G ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Heuristics; Logistics; Vehicle routing

Indexed keywords

GEOGRAPHIC INFORMATION SYSTEMS; HEURISTIC METHODS; LOGISTICS; MATHEMATICAL MODELS; SALES;

TIME WINDOWS; VEHICLE ROUTING;

INDUSTRIAL MANAGEMENT;

EID: 0035342728     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601113     Document Type: Article

References (28)

1. Atkinson JB (1994). A greedy look-ahead heuristic for combinatorial optimisation: an application to vehicle scheduling with time windows. J Opl Res Soc 45: 673-684.
2. Desrosiers J, Dumas Y, Solomon MM and Soumis F (1995). Time constrained routing and scheduling. In: Ball M, Magnanti TL, Monma CL and Nemhouser GL (eds). Network Routing, Handbook in Operations Research and Management Science 8. Elsevier: Amsterdam, pp 35 -139.
3. Golden B and Assad aA (1988). Vehicle Routing: Methods and Studies. Elsevier Science Publishers: Amsterdam.
4. Ahn BH and Shin JY (1991). Vehicle-routeing with time windows and time-varying congestion. J Opl Res Soc 42: 393-400.
5. Gendreau M, Laport G and Potvin J (1997). Vehicle routing: modern heuristics. In: Aarts E and Lenstra JK (eds). Local Search in Combinatorial Optimisation, John Wiley & Sons: New York, pp 311-336.
6. Bodin L, Golden B, Assad AA and Ball M (1983). Routing and scheduling of vehicles and crews: the state of the art. Comput Opers Res 10: 62-212.
7. Desroshers J, Lenstra JK, Savelsbergh MWP and Soumis F (1988). Vehicle routing with time windows: optimization and approximation. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies, Elsevier Science Publishers: Amsterdam, pp 65-84.
8. Lenstra KJ and Rinnooy Kan AHG (1981). Complexity of vehicle routeing and scheduling problems. Networks 11: 221-227.
9. Laporte G (1992). The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Opl Res 59: 345-358.
10. Atkinson JB (1990). Avehicle-scheduling system for delivering school meals. J Opl Res Soc 41: 703-711.
11. Atkinson JB (1998). A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. J Opl Res Soc 49: 700-708.
12. Kohl N and Madsen OBG (1997). An optimisation algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Opns Res 45: 395-406.
13. Fisher M, Jornsten KL and Madsen OBG (1997). Vehicle routing with time windows: two optimisation algorithms. OpnsRes 45: 488-492.
14. Desrochers M, Desrosiers J and Solomon MM (1992). A new optimization algorithm for the vehicle routing problem with time windows. Opns Res 40: 342-354.
15. Kolen AWJ, Rinnooy Kan AHG and Trienekens HWJM (1987). Vehicle routing with time windows. Opns Res 35: 266-273.
16. Chiang W-C and Russell R (1997). A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J Comp 9: 417-430.
17. Desrosiers J, Lenstra JK and Savelsbergh MWP (1990). A classification scheme for vehicle routing and scheduling problems. Eur J Opl Res 46: 322-332.
18. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time windows constraints. Opns Res 35: 254-265.
19. 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.
20. Savelsbergh, MWP (1986). Local search for routing problems with time windows. Ann Opns Res 4: 285-305.
21. Potvin JY and Rousseau J-M (1995). An exchange heuristic for routing problems with time windows. J Opl Res Soc 46: 1433-1446.
22. Kontoravdis G and Bard J (1995). A GRASP for the vehicle routing problem with time windows. INFORMS J Comp 7: 10-23.
23. Potvin JY, Kervahut T, Garcia BL and Rousseau JM (1996). The vehicle routing problem with time windows part I: tabu search. INFORMS J Comp 8: 158-164.
24. Taillard E et al (1997). A tabu search heuristic for the vehicle routing problem with soft time windows, Trans Sci 31: 170-186.
25. Potvin JY and Bengio S (1996). The vehicle routing problem with time windows Part II: genetic search. INFORMS J Comp 8: 165-172.
26. Baker E and Schaffer JR (1986). Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints. Am J Math Mngt Sci 6: 261-300.
27. Homberger J. Extended Solomon’s VRPTW instances. http://www.fernuni0hagen.de/WINF/touren/inhalte/probinst.htm
28. Ioannou G, Kritikos M and Prastacos GP (1999). Vehicle routing applications in the food and beverage industry of Greece. Technical Report (in Greek), Graduate Program in Decision Sciences, Athens University of Economics and Business, Athens, Greece.