Automatic Control and Computer Sciences

, Volume 52, Issue 1, pp 67–76 | Cite as

A Hybrid Genetic and Ant Colony Algorithm for Finding the Shortest Path in Dynamic Traffic Networks

  • Shuijian Zhang
  • Ying Zhang


Solving the dynamic shortest path problem has become important in the development of intelligent transportation systems due to the increasing use of this technology in supplying accurate traffic information. This paper focuses on the problem of finding the dynamic shortest path from a single source to a destination in a given traffic network. The goal of our studies is to develop an algorithm to optimize the journey time for the traveler when traffic conditions are in a state of dynamic change. In this paper, the models of the dynamic traffic network and the dynamic shortest path were investigated. A novel dynamic shortest path algorithm based on hybridizing genetic and ant colony algorithms was developed, and some improvements in the algorithm were made according to the nature of the dynamic traffic network. The performance of the hybrid algorithm was demonstrated through an experiment on a real traffic network. The experimental results proved that the algorithm proposed in this paper could effectively find the optimum path in a dynamic traffic network. This algorithm may be useful for vehicle navigation in intelligent transportation systems.


dynamic shortest path ant colony algorithm hybrid algorithm genetic algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dijkstra, E.W., A note on two problems in connection with graphs, Numer. Math., 1959, vol. 1, no. 1, pp. 269–271.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Floyd, R.W., Algorithm 97: Shortest path, Commun. ACM., 1962, vol. 5, no. 6, p.345.CrossRefGoogle Scholar
  3. 3.
    Dreyfus, S., An appraisal of some shortest path algorithms, Oper. Res., 1969, vol. 17, no. 3, pp. 395–412.CrossRefzbMATHGoogle Scholar
  4. 4.
    Ramalingam, G. and Reps, T., An incremental algorithm for a generalization of the shortest-path problem, J. Algorithms, 1996, vol. 21, no. 2, pp. 267–305.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Santos, L., Coutinho, J., and Current, J.R., An improved solution algorithm for the constrained shortest path problem, Transp. Res. A: Methodol., 2007, vol. 41, no. 7, pp. 756–771.CrossRefGoogle Scholar
  6. 6.
    Bellman, E., On a routing problem, Q. Appl. Math., 1958, vol. 16, no. 1, pp. 87–90.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Cooke, L. and Halsey, E., The shortest route through a network with time-dependent internodal transit times, J. Math. Anal. Appl., 1966, vol. 14, no. 3, pp. 492–498.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kim, S., Lewis, M., and White, C., Optimal vehicle routing with real-time traffic information, IEEE Trans. Intell. Transp. Syst., 2005, vol. 6, no. 2, pp. 178–188.CrossRefGoogle Scholar
  9. 9.
    Huang, B., Wu, Q., and Zhan, F.B., A shortest path algorithm with novel heuristics for dynamic transportation networks, Int. J. Geogr. Inf. Sci., 2007, vol. 21, no. 6, pp. 625–644.CrossRefGoogle Scholar
  10. 10.
    Ardakani, M.K. and Tavana, M., A decremental approach with the A* algorithm for speeding up the optimization process in dynamic shortest path problems, Measurement, 2015, vol. 60, pp. 299–307.CrossRefGoogle Scholar
  11. 11.
    Hanshar, F.T. and Ombuki-Berman, B.M., Dynamic vehicle routing using genetic algorithms, Appl. Intell., 2007, vol. 27, no. 1, pp. 89–99.CrossRefzbMATHGoogle Scholar
  12. 12.
    Lissovoi, A. and Witt, C., Runtime analysis of ant colony optimization on dynamic shortest path problems, Theor. Comput. Sci., 2015, vol. 561, pp. 73–85.MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Glabowski, M., Musznicki, B., Nowak, P., and Zwierzykowski, P., Shortest path problem solving based on ant colony optimization metaheuristic, Image Process. Commun., 2012, vol. 17, pp. 7–17.Google Scholar
  14. 14.
    Attiratanasunthron, N. and Fakcharoenphol, J., A running time analysis of ant colony optimization algorithm for shortest paths in directed acyclic graphs, Inf. Process. Lett., 2008, vol. 105, pp. 8–92.MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Angus, D., Solving a unique Shortest Path problem using ant colony optimization, Communicated by Baeck, T., 2005.Google Scholar
  16. 16.
    Seung-Ho Ok, Woo-Jin Seo, Jin-Ho Ahn, Sungho Kang, and Byungin Moon, An ant colony optimization approach for the preference-based shortest path search, J. Chin. Inst. Eng., 2011, vol. 34, no. 2, pp. 181–196.CrossRefGoogle Scholar
  17. 17.
    Faisal, M., Mathkour, H., and Alsulaiman, M., AntStar: Enhancing optimization problems by integrating an Ant System and A* algorithm, Sci. Program., 2016, vol. 2016, pp. 1–12.Google Scholar
  18. 18.
    Holland, J.H., Genetic algorithms, Sci. Am., 1992, vol. 267, no. 1, pp. 66–72.CrossRefGoogle Scholar
  19. 19.
    Li, S.G., Genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem, Transport, 2008, vol. 23, no. 1, pp. 73–77.MathSciNetCrossRefGoogle Scholar
  20. 20.
    Dorigo, M., Birattari, M., and Stutzle, T., Ant colony optimization, IEEE. Comput. Intell. Mag., 2006, vol. 1, no. 4, pp. 28–39.CrossRefGoogle Scholar
  21. 21.
    Fouad, A., Boukhetala, D., Boudjema, F., Zenger, K., and Gao, X.Z., A novel global harmony search method based on ant colony optimisation algorithm, J. Exp. Theor. Artif. Intell., 2016, vol. 28, nos. 1–2, pp. 215–238.CrossRefGoogle Scholar

Copyright information

© Allerton Press, Inc. 2018

Authors and Affiliations

  1. 1.Huzhou Vocational and Technical CollegeHuzhouChina

Personalised recommendations