Skip to main content
SpringerLink
Log in

Pointwise Convergence of Discrete Ant System Algorithm

  • Conference paper
Swarm and Evolutionary Computation (EC 2012, SIDE 2012)

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

  • 1314 Accesses

Abstract

Discrete Ant System (DAS) algorithm, a modification of classical Ant System algorithm formulated by M. Dorigo, is presented. Definition of optimization problem and a detailed description of component rules of DAS method are given. Then a probabilistic algebraic model of DAS heuristic describing its evolution in terms of Markov chains is presented. The final result in the form of a pointwise convergence of Discrete Ant System algorithm is established.

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 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. Dorigo, M.: Optimization, learning and natural algorithms, Ph. D. dissertation (1992)

    Google Scholar 

  2. Dorigo, M., Birattari, M., Stutzle, T.: Ant Colony Optimization. IEEE Computional Intelligence Magazine, XI (2006)

    Google Scholar 

  3. Dorgio, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the TSP problem. IEEE Transaction on Evolutionary Computation 1 (1997)

    Google Scholar 

  4. Dorigo, M., Gambardella, L.M.: Solving symmetric and asymmetric TSPs by ant colonies. In: IEEE International Conference on Evolutionary Computation (1996)

    Google Scholar 

  5. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: optimization by colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics 26 (1996)

    Google Scholar 

  6. Dorigo, M., Stutzle, T.: A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation  6 (2002)

    Google Scholar 

  7. Gutjahr, W.J.: ACO algorithms with guaranteed convergence proof to the optimal solution. Information Processing Letters 82 (2002)

    Google Scholar 

  8. Lasota, A.: Asymptotic properties of Markov semigroups of operators. Applied Mathematics 3(45), 39–51 (2002)

    MathSciNet  Google Scholar 

  9. Kosiński, W., Kotowski, S.: Limit Properties of Evolutionary Algorithms. In: Kosiński, W. (ed.) Advances in Evolutionary Algorithms, IN-TECH 2008, ch. 1, pp. 1–28 (2008); ISBN 978-953-7619-11-4

    Google Scholar 

  10. Rembelski, P.: Theoretical Model of SAS Ant Algorithm. In: Proceedings of the XII International Ph.D. Workshop, OWD 2010, pp. 37–42 (2010)

    Google Scholar 

  11. Rembelski, P.: The Markovian Model of Discrete Ant Algorithm. Applied Mathematics 13(54) (2011)

    Google Scholar 

  12. Rudnicki, R.: On asymptotic stability and sweeping for Markov operators. Bull. Polish Acad. Sci. Math. 43, 245–262 (1995)

    MathSciNet  MATH  Google Scholar 

  13. Socała, J., Kosiński, W., Kotowski, S.: The asymptotic behavior of a simple genetic algorithm. Applied Mathematics 6(47), 70–86 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Polish-Japanese Institute of Information Technology, 02-008, Warsaw, Koszykowa 86, Poland

    Paweł Rembelski & Witold Kosiński

Authors
  1. Paweł Rembelski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Witold Kosiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski , Marcin Korytkowski  & Rafał Scherer ,  & 

  2. AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Computer Science Division, University of California Berkeley, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Computational Intelligence Laboratory, Electrical and Computer Engineering, University of Louisville, 405 Lutz Hallz, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rembelski, P., Kosiński, W. (2012). Pointwise Convergence of Discrete Ant System Algorithm. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Swarm and Evolutionary Computation. EC SIDE 2012 2012. Lecture Notes in Computer Science, vol 7269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29353-5_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29353-5_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29352-8

  • Online ISBN: 978-3-642-29353-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation