Metaheuristic for solving routing problem in logistics management

International Journal of Operational Research

Volumn 6, Issue 2, 2009, Pages 223-246

  Rajmohan, M ^a   Shahabudeen, P ^a  

^a ANNA UNIVERSITY   (India)

Author keywords

Ant colony optimisation; Heuristic; Logistics; Time windows; Vehicle routing problem

Indexed keywords

EID: 67649441087     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2009.026536     Document Type: Article

References (43)

1. Alvarenga, G.B., Mateus, G.R. and Tomi, G.D. (2007) 'A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows', Computers and Operations Research, Vol. 34, No. 6, pp.1561-1584.
2. Azi, N., Gendreau, M. and Potvin, J.Y. (2007) 'An exact algorithm for a single-vehicle routing problem with time windows and multiple routes', European Journal of Operational Research, Vol. 178, No. 3, pp.755-766.
3. Bard, J.F., Kontoravdis, G. and Yu, G. (2002) 'A branch-and-cut procedure for the vehicle routing problem with time windows', Transportation Science, Vol. 36, No. 2, pp.250-269.
4. Belavendram, N. (1995) Quality by Design: Taguchi Technique for Industrial Experimentation, Prentice-Hall, London.
5. Bell, J.E. and McMullen, P.R. (2004) 'Ant colony optimization techniques for the vehicle routing problem', Advanced Engineering Informatics Vol. 18, No. 1, pp.41-48.
6. Bent, R. and Van Hentenryck, P. (2004) 'A two-stage hybrid local search for the vehicle routing problem with time windows', Transportation Science, Vol. 38, No. 4, pp.515-530.
7. Berger, J., Barkaoui, H. and Braysy, O. (2003) 'A route-directed hybrid genetic approach for the vehicle routing problem with time windows', INFOR, Vol. 41, No. 2, pp.179-194.
8. Bouthillier, A.L. and Crainic, T.G. (2005) 'A cooperative parallel meta-heuristic for the vehicle routing problem with time windows', Computers and Operations Research, Vol. 32, No. 7, pp.1685-1708.
9. Braysy, O. (2002) 'Fast local searches for the vehicle routing problem with time windows', INFOR, Vol. 40, No. 4, pp.319-330.
10. Braysy, O. and Gendreau, M. (2005a) 'Vehicle routing problem with time windows, part I: Route construction and local search algorithms', Transportation Science, Vol. 39, No. 1, pp.104-118.
11. Braysy, O. and Gendreau, M. (2005b) 'Vehicle routing problem with time windows, part II: Metaheuristics', Transportation Science, Vol. 39, No. 1, pp.119-139.
12. Bullnheimer, B., Hartl, R.F. and Strauss, C. (1998) 'Applying the ant system to the vehicle routing problem', in Voss, S., Martello, S., Osman, I.H. and Roucairol, C. (Eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, pp.109-120.
13. Bullnheimer, B., Hartl, R.F. and Strauss, C. (1999) 'An improved ant system algorithm for the vehicle routing problem', Annals of Operations Research, Vol. 89, No. 6, pp.319-328.
14. Chiu, H.N., Lee, Y.S. and Chang, J.H. (2006) 'Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment', Production Planning and Control Vol. 17, pp.480-493.
15. Chopra, S. and Meindl, P. (2007) Supply Chain Management - Strategy, Planning, and Operation, 3rd ed., Pearson Prentice-Hall, New Jersey.
16. Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M. and Soumis, F. (2002) 'VRP with time windows', in Toth, P.P. and Vigo, D.D. (Eds.): The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp.157-193.
17. Cordeau, J.F., Laporte, G. and Mercier, A. (2001) 'A unified tabu search heuristic for vehicle routing problems with time windows', Journal of the Operational Research Society, Vol. 52, No. 8, pp.928-936.
18. Cordeau, J.F., Laporte, G. and Mercier, A. (2004) 'An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows', Journal of the Operational Research Society, Vol. 55, No. 5, pp.542-546.
19. Cordone, R. and Wolfler Calvo, R. (2001) 'A heuristic for the vehicle routing problem with time windows', Journal of Heuristics, Vol. 7, No. 2, pp.107-129.
20. Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F. (1995) 'Time constrained routing and scheduling', in Ball, M.O., Magnanti, T.L., Monma, C.L. and Nemhauser, G.L. (Eds.): Network Routing, Handbooks in Operations Research and Management Science, North Holland, Amsterdam, Vol. 8, pp.35-139.
21. Dondo, R. and Cerda, J. (2007) 'A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows', European Journal of Operational Research, Vol. 176, No. 3, pp.1478-1507.
22. Favaretto, D., Moretti, E. and Pellegrini, P. (2007) 'Ant colony system for a VRP with multiple time windows and multiple visits', Journal of Interdisciplinary Mathematics, Vol. 10, No. 2, pp.263-284.
23. Gehring, H. and Homberger, J. (2002) 'Parallelization of a two-phase metaheuristic forrouting problems with time windows', Journal of Heuristics, Vol. 8, No. 3, pp.251-276.
24. Giosa, D., Tansini, L. and Viera, O. (2002) 'New assignment algorithms for the multi-depot vehicle routing problem', Journal of the Operational Research Society, Vol. 53, No. 9, pp.977-984.
25. Ioannou, G., Kritikos, M. and Prastacos, G. (2001) 'A greedy look-ahead heuristic for the vehicle routing problem with time windows', Journal of the Operational Research Society, Vol. 52, No. 5, pp.523-537.
26. Kallehauge, B., Boland, N. and Madsen, O.B.G. (2007) 'Path inequalities for the vehicle routing problem with time windows', Networks, Vol. 49, No. 4, pp.273-293.
27. Kallehauge, B., Larsen, J. and Madsen, O.B.G. (2006) 'Lagrangean duality applied to the vehicle routing with time windows', Computers and Operations Research, Vol. 33, No. 5, pp.1464-1487.
28. Lau, H.C., Sim, M. and Teo, K.M. (2003) 'Vehicle routing problem with time windows and a limited number of vehicles', European Journal of Operational Research, Vol. 148, No. 3, pp.559-569.
29. Li, H. and Lim, A. (2003) 'Local search with annealing-like restarts to solve the VRPTW', European Journal of Operational Research, Vol. 150, No. 1, pp.115-127.
30. Lysgaard, J. (2006) 'Reachability cuts for the vehicle routing problem with time windows', European Journal of Operational Research, Vol. 175, No. 1, pp.210-223.
31. Mautor, T. and Naudin, E. (2007) 'Arcs-states models for the vehicle routing problem with time windows and related problems', Computers and Operations Research, Vol. 34, No. 4, pp.1061-1084.
32. Mester, D. and Braysy, O. (2005) 'Active guided evolution strategies for large scale vehicle routing problem with time windows', Computers and Operations Research, Vol. 32, No. 6, pp.1593-1614.
33. Ombuki, B, Ross, B.J. and Franklin, F. (2006) 'Multi-objective genetic algorithms for vehicle routing problem with time windows', Applied Intelligence, Vol. 24, No. 1, pp.17-30.
34. Polacek, M., Hartl, R.E. and Doerner, K. (2004) 'A variable neighborhood search for the multi depot vehicle routing problem with time windows', Journal of Heuristics, Vol. 10, No. 6, pp.613-627.
35. Reimann, M., Doerner, K. and Richard, F.H. (2003) 'Analysing a unified ant system for the VRP and some of its Variants', Lecture Notes in Computer Science, Vol. 2611, pp.300-310.
36. Resende, M. and Ribeiro, C. (2003) 'Greedy randomized adoptive search procedure', Hand Book of Metaheuristics, Kluwar Academic publishers, Boston, pp.219-249.
37. Ross, P.J. (1996) Taguchi Techniques for Quality Engineering, McGraw-Hill, New York.
38. Sople, V.V. (2004) Logistics Management - The Supply Chain Imperative Pearson Education, Singapore.
39. Struyf, A., Hubert, M. and Rousseeuw, P.J. (1997) 'Integrating robust clustering techniques in S-PLUS', Computational Statistics and Data Analysis, Vol. 26, No. 1, pp.17-37.
40. Tan, K.C., Lee, L. and Ou, K. (2001) 'Hybrid genetic algorithms in solving vehicle routing problems with time window constraints', Asia-Pacific Journal of Operational Research, Vol. 18, No. 1, pp.121-130.
41. Tan, K.C., Lee, L.H., Zhu, Q.L. and Ou, K. (2001) 'Heuristic methods for vehicle routing problem with time windows', Arificial Intelligence in Engineering, Vol. 15, No. 3, pp.281-295.
42. Tansini, L. and Viera, O. (2006) 'New measures of proximity for the assignment algorithms in the MDVRPTW', Journal of the Operational Research Society, Vol. 57, No. 3, pp.241-249.
43. Thompson, P.M. and Psaraftis, H.N. (1993) 'Cyclic transfer algorithms for multi-vehicle routing and scheduling problems', Operations Research, Vol. 41, No. 5, pp.935-946.