COG: A composite genetic algorithm with local search methods to solve a mixed vehicle routing problem with backhauls

International Journal of Services and Operations Management

Volumn 5, Issue 5, 2009, Pages 617-636

  Anbuudayasankar, S P ^a   Ganesh, K ^b   Lee, Tzong Ru ^c   Mohandas, K ^a  

^a AMRITA SCHOOL OF ENGINEERING   (India)

^b TATA CONSULTANCY SERVICES   (India)

^c NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithm; Local search methods; Mixed vehicle routing problem with backhauls; MVRPB; Public healthcare system

Indexed keywords

EID: 66149160397     PISSN: 17442370     EISSN: 17442389     Source Type: Journal    
DOI: 10.1504/IJSOM.2009.025117     Document Type: Article

References (46)

1. Aarts, E.H.L. and Lenstra, J.K. (1997) Local Search in Combinatorial Optimization, New York: John Wiley & Sons.
2. Anbuudayasankar, S.P., Ganesh, K. and Mohandas, K. (2008) 'CORE: A heuristic to solve vehicle routing problem with mixed delivery and pick-up', ICFAI Journal of Supply Chain Management, Vol. 5, No. 3, pp.7-18.
3. Aringhieri, R., Bruglieri, M., Malucelli, F. and Nonato, M. (2004) 'An asymmetric vehicle routing problem arising in the collection and disposal of special waste', Electronic Notes in Discrete Mathematics Vol. 17, No. 20, pp.41-47.
4. Casco, D., Golden, B.L. and Wasil, E. (1988) 'Vehicle routing with backhauls: Models, algorithms, and case studies', in B.L. Golden and A.A. Assad (Eds.) Vehicle Routing: Methods and Studies, Amsterdam, pp.127-147.
5. Chiang, W.C. and Russell, R.A. (1997) 'A reactive tabu search metaheuristic for the vehicle routing problem with time windows', INFORMS Journal on Computing, Vol. 9, No. 4, pp.417-430.
6. Clarke, G. and Wright, J. (1964) 'Scheduling of vehicles from a central depot to a number of delivery points', Operations Research, Vol. 12, pp.568-581.
7. Cohen, M.A., Pierskalla, W.P., Sassetti, R.J. and Consolo, J. (1979) 'An overview of a hierarchy of planning models for regional blood bank management', Administrative report, Transfusion, September-October, Vol. 19, No. 5, pp.526-534.
8. Crispim, J. and Brandao, J. (2005) 'Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls', Journal of the Operational Research Society, Vol. 56, pp.1296-1302.
9. Deif, I. and Bodin, L. (1984) 'Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling', in A. Kidder (Ed.) Proceedings of the Babson Conference on Software Uses in Transportation and Logistic Management, Babson Park, pp.75-96.
10. Dethloff, J. (2002) 'Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls', Journal of the Operational Research Society, Vol. 53, No. 1, pp.115-118.
11. Duhamel, C., Potvin, J.Y. and Rousseau, J.M. (1997) 'A tabu search heuristic for the vehicle routing problem with backhauls and time windows', Transportation Science, Vol. 31, pp.49-59.
12. Ganesh, K. and Narendran, T.T. (2007a) 'CLASH: A heuristic to solve vehicle routing problems with delivery, pick-up and time windows', Int. J. Services and Operations Management, Vol. 3, No. 4, pp.460-477.
13. Ganesh, K. and Narendran, T.T. (2007b) 'CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up', European Journal of Operational Research, Vol. 178, No. 3, pp.699-717.
14. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Boston, MA: Addison-Wesley Longman Publishing Co., Inc.
15. Goetschalckx, M. and Jacobs-Blecha, C. (1989) 'The vehicle routing problem with backhauls', European Journal of Operational Research, Vol. 42, pp.39-51.
16. Gribkovskaia, I., Laporte, G. and Shyshou, A. (2008) 'The single vehicle routing problem with deliveries and selective pickups', Computers and Operations Research, Vol. 35, No. 9, pp.2908-2924.
17. Halse, K. (1992) 'Modeling and solving complex vehicle routing problems', PhD thesis, Institute of Mathematical Statistics and Operations Research (IMSOR), Technical University of Denmark.
18. Holland, J.H. (1975) 'Adaptation in natural and artificial systems', Ann Arbor: University of Michigan Press.
19. Laporte, G. and Osman, I.H. (1995) 'Routing problems: A bibliography', Annals of Operations Research, Vol. 61, pp.227-262.
20. Michalewicz, Z. (1996) Genetic Algorithm + Data Structures = Evolution, 3rd ed., Springer Verlag.
21. Mosheiov, G. (1994) 'The traveling salesman problem with pick-up and delivery', European Journal of Operational Research, Vol. 79, pp.299-310.
22. Mosheiov, G. (1995) 'The pick-up and delivery location problem on networks', Networks, Vol. 26, pp.243-251.
23. Mosheiov, G. (1998) 'Vehicle routing with pick-up and delivery: tour-partitioning heuristics', Computers & Industrial Engineering, Vol. 34, No. 3, pp.669-684.
24. Nagy, G. and Salhi, S. (2003) 'Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries', Working Paper No. 42, Canterbury Business School.
25. Nanry, W.P. and Barnes, J.W. (2000) 'Solving the pickup and delivery problem with time windows using reactive tabu search', Transportation Research Part B: Methodological, Vol. 34, No. 2, pp.107-121.
26. Perry, D. (1996) 'Analysis of a sampling control scheme for a perishable inventory system', Operations Research, November-December, Vol. 47, No. 6, pp.966-973.
27. Pierskalla, W.P. (1974) 'Regionalization of blood bank services', Project supported by the National Center for Health Services Research, OAHS, DHHS.
28. Pierskalla, W.P. and Roach, C. (1972) 'Optimal issuing policies for perishable inventories', Management Science, Vol. 18, No. 11, pp.603-614.
29. Potvin, J-Y. and Rousseau, J-M. (1995) 'An exchange heuristic for routing problems with time windows', Journal of the Operational Research Society, Vol. 46, pp.1433-1446.
30. Rayward-Smith, V.J. (1994) 'A unified approach to tabu search, simulated annealing and genetic algorithms', in V.J. Rayward-Smith (Ed.) The Proceedings of the UNICOM Seminar on Adaptive Computing and Information Processing, Vol. 1, pp.55-78.
31. Romeo, F. and Sangiovanni-Vincentelli, A. (1991) 'A theoretical framework for simulated annealing', Algorithmica, Vol. 6, No. 1, pp.302-345.
32. Ropke, S. (2003) 'A local search heuristic for the pickup and delivery problem with time windows', Technical paper, DIKU, University of Copenhagen.
33. Ropke, S. and Pisinger, D. (2004) 'A unified heuristic for a large class of vehicle routing problems with backhauls', Technical Report No. 2004/ 14, University of Copenhagen, Denmark, ISSN: 0107-8283.
34. Ropke, S. and Pisinger, D. (2006) 'A unified heuristic for a large class of vehicle routing problems with backhauls', European Journal of Operational Research, Vol. 171, No. 3, pp.750-775.
35. Salhi, S. and Nagy, G. (1999) 'A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling', Journal of the Operational Research Society, Vol. 50, pp.1034-1042.
36. Tavakkoli-Moghaddam, R., Saremi, A.R. and Ziaee, M.S. (2006) 'A memetic algorithm for a vehicle routing problem with backhauls', Applied Mathematics and Computation, Vol. 181, No. 2, pp.1049-1060.
37. Toth, P. and Vigo, D. (1997) 'An exact algorithm for the vehicle routing problem with backhauls', Transportation Science, Vol. 31, pp.372-285.
38. Toth, P. and Vigo, D. (2002a) 'An overview of vehicle routing problems', in P. Toth and D. Vigo (Eds.) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp.1-26.
39. Toth, P. and Vigo, D. (2002b) 'VRP with backhauls', in P. Toth and D. Vigo (Eds.) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp.195-221.
40. Tutuncu, G.Y., Carreto, C.A.C. and Baker, B.M. (2009) 'A visual interactive approach to classical and mixed vehicle routing problems with backhauls', Omega, Vol. 37, No. 1, pp.138-154.
41. Wade, A. and Salhi, S. (2003) 'An ant system algorithm for the mixed vehicle routing problem with backhauls', in Metaheuristics: Computer Decision-Making, Kluwer Academic Publishers, pp.699-719.
42. Wade, A.C. and Salhi, S. (2002) 'An investigation into a new class of vehicle routing problem with backhauls', Omega, Vol. 30, pp.479-487.
43. Wassan, N.A., Nagy, G. and Ahmadi, S. (2008) 'A heuristic method for the vehicle routing problem with mixed deliveries and pickups', Journal of Scheduling, Vol. 11, No. 2, pp.149-161.
44. Yang, S. (2002a) 'Adaptive crossover in genetic algorithms using statistics mechanism', in R. Standish, M. Bedau and H. Abbass (Eds.) Proceedings of the 8th Int. Conf. on Artificial Life (ALife VIII), MIT Press, pp.182-185.
45. Yang, S. (2002b) 'Adaptive non-uniform crossover based on statistics for genetic algorithms', in W.B. Langdon et al. (Eds.) Proc. of the Genetic and Evolutionary Computation Conference, GECCO 2002, pp.650-657.
46. Zalzala, A.M.S. and Fleming, P.J. (1997) 'Genetic algorithms in engineering systems', in IEE Control Engineering Series 55, London: Institution of Electrical Engineers.