New heuristics for the fleet size and mix vehicle routing problem with time windows

Journal of the Operational Research Society

Volumn 53, Issue 11, 2002, Pages 1232-1238

  Dullaert, W ^a   Janssens, G K ^b   Sirensen, K ^a   Vernimmen, B ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

Heterogeneous fleet; Heuristics; Time windows; Vehicle routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; DECISION MAKING; GROUND VEHICLES; OPTIMIZATION; SCHEDULING;

FLEET SIZE AND MIX VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; HETEROGENEOUS FLEET;

HEURISTIC PROGRAMMING;

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

References (24)

1. Semet F (1995). A two-phase algorithm for the partial accessibility constrained vehicle routing. Ann Opns Res 61: 45-65.
2. Rochat Y and Semet F (1994) A tabu search approach for delivering pet food and flour in Switzerland. J Opl Res Soc 45: 1233-1246.
3. Haouari M (2001). On the effectiveness of column generation for time constrained routing problems. Found Comput Decis Sci 26: 215-224.
4. Liu F-H and Shen S-Y (1999). The fleet size and mix vehicle routing problem with time windows. J Opl Res Soc 50: 721-732.
5. Solomon M (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns Res 35: 254-265.
6. Golden B, Assad A, Levy L and Gheysens F (1984). The fleet size and mix vehicle routing problem. Comput Opns Res 11: 49-66.
7. Potvin J and Rousseau J (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Opl Res 66: 331-340.
8. Gheysens F, Golden B and Assad A (1984). A comparison of techniques for solving the fleet size and mix vehicle routing problem. OR Spektrum 6: 207-216.
9. Clarke G and Wright W (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
10. Desrochers M and Verhoog T (1991). A new heuristic for the fleet size and mix vehicle routing problem. Comput Opns Res 18, 263-274.
11. Desrochers M and Verhoog T (1989). A matching based savings algorithm for the vehicle routing problem. Technical Report GERAD-89-04. GERAD, École des Hautes Études Commerciales, Montréal.
12. Lin S and Kernighan B (1973). An effective heuristic algorithm for the travelling salesman problem. Opns Res 21: 498-516.
13. Or I (1976). Travelling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University.
14. Gheysens E, Golden B and Assad A (1986). A new heuristic for determining fleet size and composition. Math Program Stud 26: 233-236.
15. Fisher M and Jaikumar R (1981). A generalized assignment heuristic for vehicle routing. Networks 11: 109-124.
16. Salhi S and Rand G (1993). Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Opl Res 66: 313-360.
17. Semet F and Taillard E (1993). Solving real-life vehicle routing problems efficiently using tabu search. Ann Opns Res 41: 469-488.
18. Brandão J and Mercer A (1997). A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Opl Res 100: 180-191.
19. Garcia B, Potvin, J-Y and Rousseau J-M (1994). A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput Opns Res 21: 1025-1033.
20. Thompson P and Psaraftis H (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Opns Res 41: 935-946.
21. Potvin J-Y and Rousseau J-M (1995). An exchange heuristic for routing problems with time windows. J Opl Res Soc 50: 1433-1446.
22. Louis SJ, Yin X and Yuan ZY (1999). Multiple vehicle routing with time windows using genetic algorithms. Technical Report 171. Department of Computer Science, University of Nevada.
23. Van Breedam A (2001). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Opns Res 28: 289-315.
24. Blauwens G, De Baere P and Van de Voorde E (2002). Handbook of Transport Economics. De Boeck: Antwerp.