The fleet size and mix vehicle routing problem with time windows

Journal of the Operational Research Society

Volumn 50, Issue 7, 1999, Pages 721-732

  Liu, F H ^a   Shen, S Y ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Heterogeneous fleet; Heuristics; Time windows; Vehicle routing

Indexed keywords

CONSTRAINT THEORY; COSTS; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY;

HETEROGENEOUS FLEET; TIME WINDOWS; VEHICLE ROUTING;

SCHEDULING;

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

References (24)

1. Semet F and Taillard E (1993). Solving real-life vehicle routing problems efficiently using tabu search. Ann Opns Res 41: 469-488.
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. Brandao 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.
4. Ferland JA and Michelon P (1988). The vehicle scheduling problem with multiple vehicle types. J Opl Res Soc 39: 577-583.
5. Golden B, Assad A, Levy L and Gheysens E (1984). The fleet size and mix vehicle routing problem. Comps & Opns Res 11: 49-66.
6. Desrochers M and Verhoog TW (1991). A new heuristic for the fleet size and mix vehicle routing problem. Comps & Opns Res 18: 263-274.
7. Gheysens E, Golden B and Assad A (1986). A new heuristic for determining fleet size and composition. Math Prog Studies 26: 233-236.
8. Salhi S and Rand GK (1993). Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Opl Res 66: 313-330.
9. Han AFW and Chang BCM (1995). New heuristics for fleet size and mix vehicle routing problem. Presented at the INFORMS Fall’95 Conference. New Orleans, US, 1995. (Available from author).
10. Salhi S and Sari M (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. Eur J Opl Res 103: 95-112.
11. Solomon MM (1987). Algorithms for the vehicle routing and scheduling with time window constraints. Opns Res 15: 254-265.
12. 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.
13. Kontoravdis G and Bard JF (1995). A GRASP for the vehicle routing problem with time windows. ORSA J Comp 7: 10-23.
14. Russell RA (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transport Sci 29: 156-166.
15. Liu FH and Shen SY (1999). A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur J Opl Res, (to appear).
16. Thompson PM and Psaraftis HN (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Opns Res 41: 935-946.
17. Garcia BL, Potvin JY and Rousseau JM (1994). A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comps & Opns Res 21: 1025-1033.
18. Potvin JY and Rousseau JM (1995). An exchange heuristic for routing problems with time windows. J Opl Res Soc 46: 1433-1446.
19. Rochat Yand Taillard E (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
20. Taillard E et al (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31: 170-186.
21. Savelsbergh MWP (1985). Local search in routing problems with time windows. Ann Opns Res 4: 285-305.
22. Koskosidis YA, Powell WB and Solomon MM (1992). An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transport Sci 26: 69-85.
23. Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number ofdelivery points. Opns Res 12: 568-581.
24. Liu FH and Shen SY (1999). A method for the vehicle routing problem with time windows and multiple vehicle types. Proceedings of the National Science Council of Republic of China-Part A: Physical Science and Engineering 12: (to appear).