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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dorigo, M.: Optimization, learning and natural algorithms, Ph. D. dissertation (1992)
Dorigo, M., Birattari, M., Stutzle, T.: Ant Colony Optimization. IEEE Computional Intelligence Magazine, XI (2006)
Dorgio, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the TSP problem. IEEE Transaction on Evolutionary Computation 1 (1997)
Dorigo, M., Gambardella, L.M.: Solving symmetric and asymmetric TSPs by ant colonies. In: IEEE International Conference on Evolutionary Computation (1996)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: optimization by colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics 26 (1996)
Dorigo, M., Stutzle, T.: A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation 6 (2002)
Gutjahr, W.J.: ACO algorithms with guaranteed convergence proof to the optimal solution. Information Processing Letters 82 (2002)
Lasota, A.: Asymptotic properties of Markov semigroups of operators. Applied Mathematics 3(45), 39–51 (2002)
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
Rembelski, P.: Theoretical Model of SAS Ant Algorithm. In: Proceedings of the XII International Ph.D. Workshop, OWD 2010, pp. 37–42 (2010)
Rembelski, P.: The Markovian Model of Discrete Ant Algorithm. Applied Mathematics 13(54) (2011)
Rudnicki, R.: On asymptotic stability and sweeping for Markov operators. Bull. Polish Acad. Sci. Math. 43, 245–262 (1995)
Socała, J., Kosiński, W., Kotowski, S.: The asymptotic behavior of a simple genetic algorithm. Applied Mathematics 6(47), 70–86 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)