Advertisement

Ant Colony to Fast Search of Paths in Huge Networks

  • Jessica Rivero
  • Dolores Cuadra
  • F. Javier Calle
  • Pedro Isasi
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 91)

Abstract

Nowadays, Ant Colony Algorithms (ACO’s) are applied to different domains of application such as automated software testing, computer games or searching of paths. Most of works that use graphs for representing information and ACO algorithm for searching a path are related to small (thousand of nodes and links) and static networks (both position and number of nodes are always fixed). In this paper a new ACO algorithm is presented. The proposal shows a solution to search paths for huge and dynamic networks in a suitable time.

Keywords

Dynamic Network Vehicle Route Problem Tabu List Answer Time Start Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alba, E., Chicano, F.: ACOhg: Dealing with Huge Graph. In: Genetic and Evolutionary Computation Conference, London, UK, July 2007, pp. 10–17 (2007)Google Scholar
  2. 2.
    Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: Workshop on Algorithm Engineering and Experiments (ALENEX 2007) (January 2007)Google Scholar
  4. 4.
    Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J. 16(3), 343–369 (2007)CrossRefGoogle Scholar
  5. 5.
    De Oliveira, S.M. A study of Pheromone Modification Strategies for using ACO on the Dynamic Vehicle Routing Problem. Doctoral Symposium on Engineering Stochastic Local Search Algorithms (SLS-DS), Brussels, September 3-4 (2009)Google Scholar
  6. 6.
    Delling, D., Holzer, M., Müller, K., Schulz, F., Wagner, D.: High-Performance Multi-Level Routing. In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol. 74, pp. 73–92. AMS, Providence (2009)Google Scholar
  7. 7.
    Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: 9th DIMACS Challenge on Shortest Paths (November 2006)Google Scholar
  8. 8.
    Di Caro, G., Ducatelle, F., Gambardella, L.M.: AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in Mobile Ad Hoc Networks. European Transactions on Telecommunications (ETT), Special Issue on Self Organization in Mobile Networking 16(5), 443–455 (2005)Google Scholar
  9. 9.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)CrossRefzbMATHGoogle Scholar
  10. 10.
    Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in large-scale dynamic road networks. Computational Optimization and Applications 45(1), 143–158 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167–256 (2003), ISSN 0036-1445CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Rivero, J.: Fast Search of Paths through Huge Networks. In: Doctoral Symposium on Engineering Stochastic Local Search Algorithms (SLS-DS), Brussels, pp. 3–4 (2009)Google Scholar
  13. 13.
    Sankaranarayanan, J., Samet, H.: Distance oracles for spatial networks. In: Proceedings of the 25th IEEE International Conference on Data Engineering, Shanghai (2009)Google Scholar
  14. 14.
    Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB), Lyon, France (September 2009)Google Scholar
  15. 15.
    Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66–79. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jessica Rivero
    • 1
  • Dolores Cuadra
    • 1
  • F. Javier Calle
    • 1
  • Pedro Isasi
    • 1
  1. 1.Computer Sciences DepartmentCarlos III University of MadridMadridSpain

Personalised recommendations