Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment

Production Planning and Control

Volumn 17, Issue 5, 2006, Pages 480-493

  Chiu, Huan Neng ^a   Lee, Yi Shyang ^b   Chang, Jen Huei ^c  

^a ASIA UNIVERSITY   (Taiwan)

^b DAHAN INSTITUTE OF TECHNOLOGY   (Taiwan)

^c TUNG NAN INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Diverse and greedy strategy; Meta heuristic method; Multi depot vehicle routing problem with time windows; Two phase heuristic method

Indexed keywords

HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; LOGIC PROGRAMMING; PROBLEM SOLVING; TIME MEASUREMENT; VEHICLES;

DIVERSE AND GREEDY STRATEGY; META-HEURISTIC METHOD; MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; TWO-PHASE HEURISTIC METHOD;

TRAFFIC CONTROL;

EID: 33746844942     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/09537280600765292     Document Type: Article

References (26)

1. Berger, J., Barkaoui, M. and Braysy, O., A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR, 2003, 41, 179-194.
2. Beasley, J., Route first-cluster second methods for vehicle routing. Omega, 1983, 11, 403-408.
3. Blackburn, J.D., Time-Based Competition, 1991 (Business One Irwin: Burr Ridge, IL).
4. Bramel, J. and Simchi-Levi, D., A location based heuristic for general routing problems. Oper. Res, 1995, 43, 649-660.
5. Caseau, Y. and Laburthe, F., Heuristics for large constrained vehicle routing problems. J. Heur, 1999, 5, 281-303.
6. Christofides, N., Mingozi, A. and Toth, P., The vehicle routing problem. In Combinatorial Optimization, edited by N. Christofides, A. Mingozi, P. Toth, and C. Sandi, pp. 318-338, 1978 (Wiley: New York).
7. Ciang, W.C. and Russell, R.A., Simulated annealing meta-heuristics for the vehicle routing problem with time windows. Ann. Oper. Res, 1996, 63, 3-27.
8. Ciang, W.C. and Russell, R.A., A reactive tabu search meta-heuristics for the vehicle routing problem with time windows. INFORMS J. Comput, 1997, 9, 417-430.
9. Cordeau, J., Gendreau, M. and Laporte, G., A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 1997, 30, 105-119.
10. Cordeau, J., Laporte, G. and Mercier, A., A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc, 2001a, 52, 928-936.
11. Cordeau, J., Desaulniers, G., Desrosiers, J., Solomon, M.M. and Soumis, F., The VRP with time windows. In The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, edited by P. Toth and D. Vigo, pp. 157-194, 2001b (SIAM: Philadelphia).
12. Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F., Time constrained routing and scheduling. In Handbooks in Operations Research and Management Science. 8: Network Routing, edited by M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, pp. 35-139, 1995 (Elsevier Science Publishers: Amsterdam).
13. Fisher, M.L. and Jaikumar, R., A generalized assignment heuristic for vehicle routing. Networks, 1981, 11, 109-124.
14. Gumbardella, L.M., Taillard, É. and Agazzi, G., MACS-VRPTW: a multiple ant colony system for vehicle routing problem with time windows. In Technical Report IDSIA-06-99, 1999 (Lugano: Switzerland).
15. Giosa, I.D., Tansini, I.L. and Viera, I.O., New assignment algorithms for multi-depot vehicle routing problem. J. Oper, Res. Soc, 2002, 53, 977-984.
16. Gillett, B.E. and Miller, L.R., A heuristic algorithm for the vehicle routing dispatch problem. Oper, Res, 1974, 22, 340-349.
17. Golden, B.L. and Assad, A.A., Perspectives on vehicle routing: exciting new developments. Oper. Res, 1986, 34, 803-809.
18. Hwang, H.S., An improved model for vehicle routing problem with time constraint based on genetic algorithm. Comput. Indust. Engng, 2002, 42, 361-369.
19. Ioannou, G., Kritikos, M. and Prastacos, G., A greedy lookahead heuristic for vehicle routing problem with time windows. J. Oper. Res. Soc, 2001, 52, 523-537.
20. Osman, I.H., Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Ann. Oper. Res, 1993, 42, 421-451.
21. Potvin, J.Y. and Rousseau, J.M., A parallel route building algorithm for the vehicle routing problem with time windows. Eur. J. Oper. Res, 1993, 66, 331-340.
22. Potvin, J.Y. and Rousseau, J.M., An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc, 1995, 46, 1433-1446.
23. Potvin, J.Y. and Bengio, S., The vehicle routing problem with time windows part II: genetic search. INFORMS J. Comput, 1996, 8, 165-172.
24. Russell, R.A., Hybrid heuristic for the vehicle routing problem with time windows. Transport. Sci, 1995, 29, 156-166.
25. Solomon, M.M., Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res, 1987, 35, 254-265.
26. Taillard, É., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J.Y., A tabu search heuristic for the vehicle routing problem with soft time windows. Transport. Sci, 1997, 31, 170-186.