Verifying Usefulness of Ant Colony Community for Solving Dynamic TSP

  • Andrzej SiemińskiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11432)


The paper describes Ant Colony Communities (ACC) and verifies their usefulness for Dynamic Travelling Salesman Problem (DTSP). DTSP is a version of the classical TSP in which the distance matrix change in time. The ACC consists of a set of separate ant colonies with a server that coordinates their work and sends them cargos of data for processing. The colonies could be distributed over many computers working in a LAN or even over Internet. Such a mode of operation is especially useful for dynamic tasks where solutions must catch up with the changing environment. The ACC is used for the regular ACO and its version designed for dynamic environments: PACO and Immigrant ant colonies. The experiments show that for all types Ant Colonies the introduction of the community boots the performance. The routes are far shorter than in the case of original colonies.


Dynamic TSP Ant Colony Community PACO Immigrant based colonies Parallel implementation of ACO 


  1. 1.
    Antosiewicz, M., Koloch, G., Kamiński, B.: Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: quality, uncertainty and speed. J. Theor. Appl. Comput. Sci. 7(1), 46–55 (2013)Google Scholar
  2. 2.
    Dorigo, M., Stuetzle, T.: Ant colony optimization: overview and recent advances, IRIDIA - Technical Report Series, Technical report No. TR/IRIDIA/2009-013 (2009)Google Scholar
  3. 3.
    Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3–31 (2016)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Dorigo, M.: Optimization, Learning and Natural Algorithms, Ph.D. thesis, Politecnico di Mila-no, Italie (1992)Google Scholar
  5. 5.
    Guntsch, M., Middendorf, M.: Applying population based ACO to dynamic optimization problems. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 111–122. Springer, Heidelberg (2002). Scholar
  6. 6.
    Skinderowicz, R.: Implementing population-based ACO. In: Hwang, D., Jung, Jason J., Nguyen, N.-T. (eds.) ICCCI 2014. LNCS (LNAI), vol. 8733, pp. 603–612. Springer, Cham (2014). Scholar
  7. 7.
    Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors. Appl. Soft Comput. 13(10), 4023–4037 (2013)CrossRefGoogle Scholar
  8. 8.
    Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. J. Parallel Distrib. Comput. 62(9), 1421–1432 (2002)CrossRefGoogle Scholar
  9. 9.
    Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft Comput. 11(8), 5181–5197 (2011)CrossRefGoogle Scholar
  10. 10.
    Siemiński, A.: Parallel implementations of the ant colony optimization metaheuristic. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS (LNAI), vol. 9621, pp. 626–635. Springer, Heidelberg (2016). Scholar
  11. 11.
    Siemiński, A.: Measuring efficiency of ant colony communities. In: Zgrzywa, A., Choroś, K., Siemiński, A. (eds.) Multimedia and Network Information Systems. AISC, vol. 506, pp. 203–213. Springer, Cham (2017). Scholar
  12. 12.
    Andrzej, S., Marek, K.: Comparing efficiency of ACO parallel implementations. J. Intell. Fuzzy Syst. 32(2), 1377–1388 (2017)CrossRefGoogle Scholar
  13. 13.
    Psarafits, H.N.: Dynamic vehicle routing: Status and Prospects. National Technical Annals of Operations Research, University of Athens, Greece (1995)Google Scholar
  14. 14.
    Siemiński, A.: Using ACS for dynamic traveling salesman problem. In: Zgrzywa, A., Choroś, K., Siemiński, A. (eds.) New Research in Multimedia and Internet Systems. AISC, vol. 314, pp. 145–155. Springer, Cham (2015). Scholar
  15. 15.
    Chirico, U.: A Java framework for ant colony systems. In: Ants2004: Forth International Workshop on Ant Colony Optimization and Swarm Intelligence, Brussels (2004)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Information Systems, Faculty of Computer Science and ManagementWrocław University of Science and TechnologyWrocławPoland

Personalised recommendations