Skip to main content
SpringerLink
Log in

Verifying Usefulness of Ant Colony Community for Solving Dynamic TSP

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11432))

Included in the following conference series:

  • 1965 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. 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. Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3–31 (2016)

    Article  MathSciNet  Google Scholar 

  4. Dorigo, M.: Optimization, Learning and Natural Algorithms, Ph.D. thesis, Politecnico di Mila-no, Italie (1992)

    Google Scholar 

  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). https://doi.org/10.1007/3-540-45724-0_10

    Chapter  MATH  Google Scholar 

  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). https://doi.org/10.1007/978-3-319-11289-3_61

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  8. Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. J. Parallel Distrib. Comput. 62(9), 1421–1432 (2002)

    Article  Google Scholar 

  9. Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft Comput. 11(8), 5181–5197 (2011)

    Article  Google Scholar 

  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). https://doi.org/10.1007/978-3-662-49381-6_60

    Chapter  Google Scholar 

  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). https://doi.org/10.1007/978-3-319-43982-2_18

    Chapter  Google Scholar 

  12. Andrzej, S., Marek, K.: Comparing efficiency of ACO parallel implementations. J. Intell. Fuzzy Syst. 32(2), 1377–1388 (2017)

    Article  Google Scholar 

  13. Psarafits, H.N.: Dynamic vehicle routing: Status and Prospects. National Technical Annals of Operations Research, University of Athens, Greece (1995)

    Google Scholar 

  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). https://doi.org/10.1007/978-3-319-10383-9_14

    Chapter  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Andrzej Siemiński

Authors
  1. Andrzej Siemiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Siemiński .

Editor information

Editors and Affiliations

  1. Ton Duc Thang University, Ho Chi Minh City, Vietnam

    Ngoc Thanh Nguyen

  2. Bina Nusantara University, Jakarta, Indonesia

    Ford Lumban Gaol

  3. National University of Kaohsiung, Kaohsiung, Taiwan

    Tzung-Pei Hong

  4. Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Siemiński, A. (2019). Verifying Usefulness of Ant Colony Community for Solving Dynamic TSP. In: Nguyen, N., Gaol, F., Hong, TP., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2019. Lecture Notes in Computer Science(), vol 11432. Springer, Cham. https://doi.org/10.1007/978-3-030-14802-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14802-7_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14801-0

  • Online ISBN: 978-3-030-14802-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation