Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2018, Article ID 1295485, 13 pages
https://doi.org/10.1155/2018/1295485
Research Article

Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China

Correspondence should be addressed to Haitao Xu; nc.ude.udh@oatiahux

Received 20 October 2017; Revised 17 January 2018; Accepted 21 January 2018; Published 15 February 2018

Academic Editor: Gabriella Bretti

Copyright © 2018 Haitao Xu et al. 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. K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: State of the art classification and review,” Computers & Industrial Engineering, vol. 99, pp. 300–313, 2016. View at Publisher · View at Google Scholar · View at Scopus
  2. M. I. Hosny, Investigating Heuristic and Meta-Heuristic Algorithms for Solving Pickup and Delivery Problems, School of Computer Science Informatics, Cardiff University, Cardiff, 2010.
  3. C. Archetti, M. G. Speranza, and D. Vigo, Vehicle Routing Problems with Profits, 2nd edition, 2014.
  4. Y. Xu, L. Wang, and Y. Yang, “Dynamic vehicle routing using an improved variable neighborhood search algorithm,” Journal of Applied Mathematics, vol. 2013, Article ID 672078, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations Research, vol. 21, pp. 498–516, 1973. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. Hinton and T. Glyn, A thesis regarding the vehicle routing problem including a range of novel techniques for its solution, University of Bristol, 2010.
  7. A. M. Campbell and J. H. Wilson, “Forty years of periodic vehicle routing,” Networks, vol. 63, no. 1, pp. 2–15, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. J. W. Ohlmann and B. W. Thomas, “A compressed-annealing heuristic for the traveling salesman problem with time windows,” INFORMS Journal on Computing, vol. 19, no. 1, pp. 80–90, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. Z. Wang and C. Zhou, “A Three-Stage Saving-Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times,” Discrete Dynamics in Nature and Society, vol. 2016, Article ID 7841297, 2016. View at Publisher · View at Google Scholar · View at Scopus
  10. M. A. Cruz-Chávez and A. Martínez-Oropeza, “Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows,” Mathematical Problems in Engineering, vol. 2016, Article ID 3851520, 2016. View at Publisher · View at Google Scholar · View at Scopus
  11. C. Prodhon and C. Prins, “Metaheuristics for vehicle routing problems,” in Metaheuristics, pp. 407–437, Springer, Cham, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. J. Caceres-Cruz, P. Arias, D. Guimarans, D. Riera, and A. A. Juan, “Rich vehicle routing problem: Survey,” ACM Computing Surveys, vol. 47, no. 2, article no. 32, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. B. Yu, Z. Yang, and B. Yao, “An improved ant colony optimization for vehicle routing problem,” European Journal of Operational Research, vol. 196, no. 1, pp. 171–176, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. C. H. Chen and C. J. Ting, “An improved ant colony system algorithm for the vehicle routing problem,” Applied Mathematics & Computation, vol. 23, pp. 115–126, 2006. View at Google Scholar
  15. F. T. Hanshar and B. M. Ombuki-Berman, “Dynamic vehicle routing using genetic algorithms,” Applied Intelligence, vol. 27, no. 1, pp. 89–99, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Cheng and D. Yu, “Genetic algorithm for vehicle routing problem,” in Proceedings of the 4th International Conference on Transportation Engineering, ICTE 2013, pp. 2876–2881, China, October 2013. View at Publisher · View at Google Scholar · View at Scopus
  17. A. M. F. M. AbdAllah, D. L. Essam, and R. A. Sarker, “On solving periodic re-optimization dynamic vehicle routing problems,” Applied Soft Computing, vol. 55, pp. 1–12, 2017. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Okulewicz and J. Mańdziuk, “Application of particle swarm optimization algorithm to dynamic vehicle routing problem,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 7895, no. 2, pp. 547–558, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. B. Chandra Mohan and R. Baskaran, “Review: A survey: Ant Colony Optimization based recent research and implementation on several engineering domain,” Expert Systems with Applications, vol. 39, pp. 4618–4627, 2012. View at Google Scholar
  20. M. Dorigo and C. Blum, “Ant colony optimization theory: a survey,” Theoretical Computer Science, vol. 344, no. 2-3, pp. 243–278, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. E. Bonabeau, M. Dorigo, and G. Theraulaz, “Inspiration for optimization from social insect behaviour,” Nature, vol. 406, no. 6791, pp. 39–42, 2000. View at Publisher · View at Google Scholar · View at Scopus
  22. S. Yang and R. Tinós, “A hybrid immigrants scheme for genetic algorithms in dynamic environments,” International Journal of Automation and Computing, vol. 4, no. 3, pp. 243–254, 2007. View at Publisher · View at Google Scholar · View at Scopus
  23. X. Yu, K. Tang, and X. Yao, “An immigrants scheme based on environmental information for genetic algorithms in changing environments,” in Proceedings of the 2008 IEEE Congress on Evolutionary Computation, CEC 2008, pp. 1141–1147, China, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Li and S. Yang, “A general framework of multipopulation methods with clustering in undetectable dynamic environments,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 4, pp. 556–577, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Gao, Y. Wang, J. Cheng, Y. Inazumi, and Z. Tang, “Ant colony optimization with clustering for solving the dynamic location routing problem,” Applied Mathematics and Computation, vol. 285, pp. 149–173, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. S. Kashef and H. Nezamabadi-pour, “An advanced ACO algorithm for feature subset selection,” Neurocomputing, vol. 147, no. 1, pp. 271–279, 2015. View at Publisher · View at Google Scholar · View at Scopus
  27. Z. Ren, Z. Feng, L. Ke, and H. Chang, “A fast and efficient ant colony optimization approach for the set covering problem,” in Proceedings of the 2008 IEEE Congress on Evolutionary Computation, CEC 2008, pp. 1839–1844, China, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Nayyar and R. Singh, “Ant Colony Optimization (ACO) based Routing Protocols for Wireless Sensor Networks (WSN): A Survey,” International Journal of Advanced Computer Science & Applications, 2017. View at Google Scholar
  29. V. Pillac, M. Gendreau, C. Gu\'eret, and A. L. Medaglia, “A review of dynamic vehicle routing problems,” European Journal of Operational Research, vol. 225, no. 1, pp. 1–11, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. A. Goel and V. Gruhn, “A general vehicle routing problem,” European Journal of Operational Research, vol. 191, no. 3, pp. 650–660, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. A. Attanasio, J.-F. Cordeau, G. Ghiani, and G. Laporte, “Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem,” Parallel Computing, vol. 30, no. 3, pp. 377–387, 2004. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Mes, M. van der Heijden, and A. van Harten, “Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems,” European Journal of Operational Research, vol. 181, no. 1, pp. 59–75, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. A. Beaudry, G. Laporte, T. Melo, and S. Nickel, “Dynamic transportation of patients in hospitals,” OR Spectrum, vol. 32, no. 1, pp. 77–107, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Barceló, H. Grzybowska, and S. Pardo, “Vehicle Routing and scheduling models, simulation and City Logistics,” Operations Research/ Computer Science Interfaces Series, vol. 38, pp. 163–195, 2007. View at Publisher · View at Google Scholar · View at Scopus
  35. R. Montemanni, L. M. Gambardella, A. E. Rizzoli, and A. V. Donati, “A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System,” in Proceedings of the Second International Workshop on Freight Transportation Logistics, pp. 27–30, 2003.
  36. M. R. Garey and D. S. Johnson, “A Guide to the Theory of NP-Completeness,” in Computer Animation Conference, 1979. View at MathSciNet
  37. S. Ichoua, M. Gendreau, and J.-Y. Potvin, “Planned route optimization for real-time vehicle routing,” Operations Research/ Computer Science Interfaces Series, vol. 38, pp. 1–18, 2007. View at Publisher · View at Google Scholar · View at Scopus
  38. A. Larsen, The Dynamic Vehicle Routing Problem, Technical Univeristy of Denmark, 2001.
  39. B. Yu and Z. Z. Yang, “An ant colony optimization model: the period vehicle routing problem with time windows,” Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 2, pp. 166–181, 2011. View at Publisher · View at Google Scholar · View at Scopus
  40. M. C. Su and C. H. Chou, “A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry,” Pattern Analysis Machine Intelligence IEEE Transactions on, vol. 23, pp. 674–680, 2001. View at Publisher · View at Google Scholar
  41. M. R. Khouadjia, B. Sarasola, E. Alba, L. Jourdan, and E.-G. Talbi, “A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests,” Applied Soft Computing, vol. 12, no. 4, pp. 1426–1439, 2012. View at Publisher · View at Google Scholar · View at Scopus
  42. B. Ombuki, B. J. Ross, and F. Hanshar, “Multi-objective genetic algorithms for vehicle routing problem with time windows,” Applied Intelligence, vol. 24, no. 1, pp. 17–30, 2006. View at Publisher · View at Google Scholar · View at Scopus
  43. M. A. Figliozzi, “The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 3, pp. 616–636, 2012. View at Publisher · View at Google Scholar · View at Scopus
  44. G. A. Croes, “A method for solving traveling-salesman problems,” Operations Research, vol. 6, pp. 791–812, 1958. View at Publisher · View at Google Scholar · View at MathSciNet
  45. T. Vidal, M. Battarra, A. Subramanian, and G. ErdogAn, “Hybrid metaheuristics for the Clustered Vehicle Routing Problem,” Computers & Operations Research, vol. 58, pp. 87–99, 2015. View at Google Scholar
  46. Z. Yang, B. Yu, and C. Cheng, “A parallel ant colony algorithm for bus network optimization,” Computer-Aided Civil and Infrastructure Engineering, vol. 22, no. 1, pp. 44–55, 2007. View at Publisher · View at Google Scholar · View at Scopus