Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013, Article ID 874349, 11 pages
http://dx.doi.org/10.1155/2013/874349
Research Article

A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem

Faculty of Business Administration, Panyapiwat Institute of Management, 85/1 Moo 2, Chaengwattana Road, Bangtalad, Pakkred, Nonthaburi 11120, Thailand

Received 15 July 2013; Accepted 8 October 2013

Academic Editors: A. Miné, D. Simson, and D. Talia

Copyright © 2013 Tantikorn Pichpibul and Ruengsak Kawtummachai. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Sariklis and S. Powell, “A heuristic method for the open vehicle routing problem,” The Journal of the Operational Research Society, vol. 51, no. 5, pp. 564–573, 2000. View at Google Scholar · View at Scopus
  2. Z. Fu and M. Wright, “Train plan model for British rail freight services through the channel tunnel,” The Journal of the Operational Research Society, vol. 45, no. 4, pp. 384–391, 1994. View at Google Scholar · View at Scopus
  3. L. Y. O. Li and Z. Fu, “The school bus routing problem: a case study,” The Journal of the Operational Research Society, vol. 53, no. 5, pp. 552–558, 2002. View at Publisher · View at Google Scholar · View at Scopus
  4. C. D. Tarantilis and C. T. Kiranoudis, “Distribution of fresh meat,” Journal of Food Engineering, vol. 51, no. 1, pp. 85–91, 2002. View at Publisher · View at Google Scholar · View at Scopus
  5. R. Russell, W.-C. Chiang, and D. Zepeda, “Integrating multi-product production and distribution in newspaper logistics,” Computers & Operations Research, vol. 35, no. 5, pp. 1576–1588, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. W.-C. Chiang, R. Russell, X. Xu, and D. Zepeda, “A simulation/metaheuristic approach to newspaper production and distribution supply chain problems,” International Journal of Production Economics, vol. 121, no. 2, pp. 752–767, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. P. P. Repoussis, D. C. Paraskevopoulos, G. Zobolas, C. D. Tarantilis, and G. Ioannou, “A web-based decision support system for waste lube oils collection and recycling,” European Journal of Operational Research, vol. 195, no. 3, pp. 676–700, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Yu, C. Ding, and K. Zhu, “A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material,” Expert Systems with Applications, vol. 38, no. 8, pp. 10568–10573, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. N. Christofides, “Worst-case analysis of a new heuristic for the travelling salesman problem,” Tech. Rep. 388, Graduate School of Industrial Administration, Canegie Mellon University, 1976. View at Google Scholar
  10. M. Held and R. M. Karp, “The traveling salesman problem and minimum spanning trees,” Operations Research, vol. 18, pp. 1138–1162, 1970. View at Google Scholar
  11. R. E. Miller and J. W. Thatcher, Complexity of Computer Computations, Plenum Press, New York, NY, USA, 1972.
  12. M. Syslo, N. Deo, and J. Kowaklik, Discrete Optimization Algorithms with Pascal Programs, Prentice Hall, Englewood Cliffs, NJ, USA, 1983.
  13. P. Toth and D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, SIAM Publishing, Philadelphia, Pa, USA, 2002.
  14. J. Brandão, “A tabu search algorithm for the open vehicle routing problem,” European Journal of Operational Research, vol. 157, no. 3, pp. 552–564, 2004. View at Publisher · View at Google Scholar · View at Scopus
  15. M. Salari, P. Toth, and A. Tramontani, “An ILP improvement procedure for the Open Vehicle Routing Problem,” Computers & Operations Research, vol. 37, no. 12, pp. 2106–2120, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, pp. 80–91, 1959. View at Google Scholar
  17. C. D. Tarantilis, D. Diakoulaki, and C. T. Kiranoudis, “Combination of geographical information system and efficient routing algorithms for real life distribution operations,” European Journal of Operational Research, vol. 152, no. 2, pp. 437–453, 2004. View at Publisher · View at Google Scholar · View at Scopus
  18. Z. Fu, R. Eglese, and L. Li, “A new tabu search heuristic for the open vehicle routing problem,” The Journal of the Operational Research Society, vol. 56, no. 3, pp. 267–274, 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. X. Li and P. Tian, “An ant colony system for the open vehicle routing problem,” in Ant Colony Optimization and Swarm Intelligence, M. Dorigo, L. M. Gambardella, M. Birattari, A. Martinoli, R. Poli, and T. Stützle, Eds., vol. 4150 of Lecture Notes in Computer Science, pp. 356–363, Springer, Berlin, Germany, 2006. View at Google Scholar · View at Scopus
  20. K. Fleszar, I. H. Osman, and K. S. Hindi, “A variable neighbourhood search algorithm for the open vehicle routing problem,” European Journal of Operational Research, vol. 195, no. 3, pp. 803–809, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. S. A. Mirhassani and N. Abolghasemi, “A particle swarm optimization algorithm for open vehicle routing problem,” Expert Systems with Applications, vol. 38, no. 9, pp. 11547–11551, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, pp. 568–581, 1964. View at Google Scholar
  23. F. A. Tillman, “The multiple terminal delivery problem with probabilistic demands,” Transportation Science, vol. 3, pp. 192–204, 1969. View at Google Scholar
  24. L. Bodin, B. Golden, A. Assad, and M. Ball, “Routing and scheduling of vehicles and crews. The state of the art,” Computers & Operations Research, vol. 10, no. 2, pp. 63–211, 1983. View at Google Scholar · View at Scopus
  25. I. Deif and L. D. Bodin, “Extension of the Clarke-Wright algorithm for solving the vehicle routing problem with backhauling,” in Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Management, A. E. Kidder, Ed., pp. 75–96, Babson Park, Mass, USA, 1984.
  26. T. J. Gaskell, “Bases for vehicle fleet scheduling,” Operational Research Quarterly, vol. 18, pp. 281–295, 1967. View at Google Scholar
  27. P. Yellow, “A computational modification to the savings method of vehicle scheduling,” Operational Research Quarterly, vol. 21, pp. 281–283, 1970. View at Google Scholar
  28. H. Paessens, “The savings algorithm for the vehicle routing problem,” European Journal of Operational Research, vol. 34, no. 3, pp. 336–344, 1988. View at Google Scholar · View at Scopus
  29. İ. K. Altinel and T. Öncan, “A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem,” The Journal of the Operational Research Society, vol. 56, no. 8, pp. 954–961, 2005. View at Publisher · View at Google Scholar · View at Scopus
  30. T. Doyuran and B. Çatay, “A robust enhancement to the Clarke-Wright savings algorithm,” The Journal of the Operational Research Society, vol. 62, no. 1, pp. 223–231, 2011. View at Publisher · View at Google Scholar · View at Scopus
  31. A. A. Juan, J. Faulin, R. Ruiz, B. Barrios, and S. Caballé, “The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem,” Applied Soft Computing Journal, vol. 10, no. 1, pp. 215–224, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. A. A. Juan, J. Faulin, J. Jorba, D. Riera, D. Masip, and B. Barrios, “On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics,” The Journal of the Operational Research Society, vol. 62, no. 6, pp. 1085–1097, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. T. Pichpibul and R. Kawtummachai, “New enhancement for Clarke-Wright savings algorithm to optimize the capacitated vehicle routing problem,” European Journal of Scientific Research, vol. 78, pp. 119–134, 2012. View at Google Scholar
  34. T. Pichpibul and R. Kawtummachai, “An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem,” ScienceAsia, vol. 38, pp. 307–318, 2012. View at Google Scholar
  35. A. Subramanian, L. M. A. Drummond, C. Bentes, L. S. Ochi, and R. Farias, “A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery,” Computers & Operations Research, vol. 37, no. 11, pp. 1899–1911, 2010. View at Publisher · View at Google Scholar · View at Scopus
  36. C. Groër, B. Golden, and E. Wasil, “A library of local search heuristics for the vehicle routing problem,” Mathematical Programming Computation, vol. 2, no. 2, pp. 79–101, 2010. View at Publisher · View at Google Scholar · View at Scopus
  37. G. Laporte, M. Gendreau, J. Potvin, and F. Semet, “Classical and modern heuristics for the vehicle routing problem,” International Transactions in Operational Research, vol. 7, no. 4-5, pp. 285–300, 2000. View at Publisher · View at Google Scholar
  38. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, New York, NY, USA, 1997.
  39. V. C. Hemmelmayr, K. F. Doerner, and R. F. Hartl, “A variable neighborhood search heuristic for periodic routing problems,” European Journal of Operational Research, vol. 195, no. 3, pp. 791–802, 2009. View at Publisher · View at Google Scholar · View at Scopus
  40. B. Çatay, “A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery,” Expert Systems with Applications, vol. 37, no. 10, pp. 6809–6817, 2010. View at Publisher · View at Google Scholar · View at Scopus
  41. P. Augerat, J. Belenguer, E. Benavent, A. Corbern, D. Naddef, and G. Rinaldi, “Computational results with a branch and cut code for the capacitated vehicle routing problem,” Research Report 949-M, Universite Joseph Fourier, Grenoble, France, 1995. View at Google Scholar
  42. N. Christofides and S. Eilon, “An algorithm for the vehicle dispatching problem,” Operational Research Quarterly, vol. 20, pp. 309–318, 1969. View at Google Scholar
  43. M. L. Fisher, “Optimal solution of vehicle routing problems using minimum K-trees,” Operations Research, vol. 42, no. 4, pp. 626–642, 1994. View at Google Scholar · View at Scopus
  44. A. N. Letchford, J. Lysgaard, and R. W. Eglese, “A branch-and-cut algorithm for the capacitated open vehicle routing problem,” The Journal of the Operational Research Society, vol. 58, no. 12, pp. 1642–1651, 2007. View at Publisher · View at Google Scholar · View at Scopus
  45. D. Pisinger and S. Ropke, “A general heuristic for vehicle routing problems,” Computers & Operations Research, vol. 34, no. 8, pp. 2403–2435, 2007. View at Publisher · View at Google Scholar · View at Scopus
  46. F. Li, B. Golden, and E. Wasil, “The open vehicle routing problem: algorithms, large-scale test problems, and computational results,” Computers & Operations Research, vol. 34, no. 10, pp. 2918–2930, 2007. View at Publisher · View at Google Scholar · View at Scopus
  47. D. Vigo, “Heuristic algorithm for the asymmetric capacitated vehicle routing problem,” European Journal of Operational Research, vol. 89, no. 1, pp. 108–126, 1996. View at Publisher · View at Google Scholar · View at Scopus