Skip to main content

Multi-caste Ant Colony Algorithm for the Dynamic Traveling Salesperson Problem

  • Conference paper
Book cover Adaptive and Natural Computing Algorithms (ICANNGA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7824))

Included in the following conference series:

Abstract

In this paper we apply a multi-caste ant colony system to the dynamic traveling salesperson problem. Each caste inside the colony contains its own set of parameters, leading to the coexistence of different exploration behaviors. Two multi-caste variants are proposed and analyzed. Results obtained with different dynamic scenarios reveal that the adoption of a multi-caste architecture enhances the robustness of the algorithm. A detailed analysis of the outcomes suggests guidelines to select the best multi-caste variant, given the magnitude and severity of changes occurring in the dynamic environment.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Botee, H., Bonabeau, E.: Evolving ant colony optimization. Advances in Complex Systems (1998)

    Google Scholar 

  2. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers (2002)

    Google Scholar 

  3. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  4. Dorigo, M., Stützle, T.: Ant Colony Optimization. A Bradford Book, MIT Press, Cambridge, Massachussetts (2004)

    Google Scholar 

  5. Eyckelhof, C.J., Snoek, M.: Ant systems for a dynamic TSP: Ants caught in a traffic jam. In: ANTS 2002: Third International Workshop (2002)

    Google Scholar 

  6. Guntsch, M., Middendorf, M.: Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 213–222. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Guntsch, M., Middendorf, M.: Applying Population Based ACO to Dynamic Optimization Problems. In: ANTS 2002: Third International Workshop, pp. 111–122 (2002)

    Google Scholar 

  8. Guntsch, M., Middendorf, M., Schmeck, H.: An ant colony optimization approach to dynamic TSP. In: GECCO 2001 Proceedings of the Genetic and Evolutionary Computation Conference, pp. 860–867. Morgan Kaufmann Publishers (2001)

    Google Scholar 

  9. Liu, J.L.: Rank-based ant colony optimization applied to dynamic traveling salesman problems. Engineering Optimization 37(8), 831–847 (2005)

    Article  MathSciNet  Google Scholar 

  10. Mavrovouniotis, M., Yang, S.: Ant Colony Optimization with Immigrants Schemes in Dynamic Environments. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 371–380. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Mavrovouniotis, M., Yang, S.: A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Computing 15(7), 1405–1425 (2011)

    Article  Google Scholar 

  12. Mavrovouniotis, M., Yang, S.: An Immigrants Scheme Based on Environmental Information for Ant Colony Optimization for the Dynamic Travelling Salesman Problem. In: Hao, J.-K., Legrand, P., Collet, P., Monmarché, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol. 7401, pp. 1–12. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Mavrovouniotis, M., Yang, S.: Memory-Based Immigrants for Ant Colony Optimization in Changing Environments. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ekárt, A., Esparcia-Alcázar, A.I., Merelo, J.J., Neri, F., Preuss, M., Richter, H., Togelius, J., Yannakakis, G.N. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 324–333. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Melo, L., Pereira, F., Costa, E.: Multi-caste Ant Colony Optimization Algorithms. In: Antunes, L., Pinto, H.S., Prada, R., Trigo, P. (eds.) Proceedings of the 15th Portuguese Conference on Artificial Intelligence, Lisbon, pp. 978–989 (2011), http://epia2011.appia.pt/LinkClick.aspx?fileticket=s--Tr74EzUI%3d&tabid=562

  15. Reinhelt, G.: {TSPLIB}: a library of sample instances for the TSP (and related problems) from various sources and of various types, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

  16. Sammoud, O., Solnon, C., Ghedira, K.: A New ACO Approach for Solving Dynamic Problems. In: 9th International Conference on Artificial Evolution (2009), http://liris.cnrs.fr/publis/?id=4330

  17. Stützle, T., Lopez-Ibanez, M., Pellegrini, P., Maur, M., de Oca, M.M., Birattari, M., Dorigo, M.: Parameter Adaptation in Ant Colony Optimization. Technical report number tr/iridia/2010-002, IRIDIA, Bruxelles, Belgium (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Melo, L., Pereira, F., Costa, E. (2013). Multi-caste Ant Colony Algorithm for the Dynamic Traveling Salesperson Problem. In: Tomassini, M., Antonioni, A., Daolio, F., Buesser, P. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2013. Lecture Notes in Computer Science, vol 7824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37213-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37213-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37212-4

  • Online ISBN: 978-3-642-37213-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics