A synthesis of assignment and heuristic solutions for vehicle routing with time windows

Journal of the Operational Research Society

Volumn 55, Issue 1, 2004, Pages 2-11

  Ioannou, G ^a   Kritikos, M N ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Heuristics; Time windows; Vehicle routing

Indexed keywords

COMPUTATIONAL METHODS; CUSTOMER SATISFACTION; HEURISTIC METHODS; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING; TRAFFIC CONTROL; TRANSPORTATION;

HEURISTICS; SCHEDULING ACCURACY; TIME WINDOWS; VEHICLE ROUTING;

VEHICLES;

EID: 2442528732     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601659     Document Type: Article

References (18)

1. Bodin L, Golden B, Assad AA and Ball M (1983). Routing and scheduling of vehicles and crews: the state of the art. Computers and Opns Res 10: 62-212.
2. Desrochers M, 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.
3. Lenstra KJ and Rinnooy Kan AHG (1981). Complexity of vehicle routing and scheduling problems. Networks 11: 221-227.
4. Gendreau M, Laporte G and Potvin J (1997). Vehicle routing: modern heuristics. In: Aarts E and Lenstra JK (eds). Local Search in Combinatorial Optimization. John Wiley & Son Ltd, New York.
5. Laporte G (1992). The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Opl Res 59: 345-358.
6. 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. Volume 8. Elsevier, Amsterdam, pp 35-139.
7. Kohl N and Madsen OBG (1997). An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Opns Res 45: 395-406.
8. 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.
9. Kolen AWJ, Rinnooy Kan AHG and Trienekens HWJM (1987). Vehicle routing with time windows. Opns Res 35: 266-273.
10. Papadimitriou CH and Steiglitz K (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall: Englewood Cliffs, NJ.
11. Winston WL. (1994). Operations Research: Applications and Algorithms. Duxbury Press: Belmont, CA, pp 372-380.
12. Calvo RW (2000). A new heuristic for the traveling salesman problem with time windows. Trans Sci 34: 113-124.
13. Desaulniers G and Villeneuve D (2000). The shortest path problem with time windows and linear waiting costs. Trans Sci 34: 312-319.
14. Fisher ML and Jaikumar R (1981). A generalized assignment heuristic for vehicle routing. Networks 11: 109-124.
15. Herrmann JW, Ioannou G, Minis I and Proth JM (1999). Minimization of acquisition and operational costs in horizontal material handling system design. IIE Trans 31: 679-693.
16. Ioannou G, Kritikos M and Prastacos G (2001). A greedy look-ahead heuristic for the vehicle routeing problem with time windows. J Opl Res Soc 52: 523-537.
17. Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time windows constraints. Opns Res 35: 254-265.
18. Hornberger J. Extended Solomon's VRPTW instances, http://www. fernuni0hagen.de/WINF/touren/inhalte/probinst.htm.