Abstract
Although genetic algorithm (GA) has the ability to do quick and stochastic global search, it can’t efficiently use the output information for systems. Ant algorithm (AA), on the other hand, is a parallel-proceed and distributive-forward system with a relatively slow speed for carrying out its solution. Incorporating GA and AA can improve their merits one for another. In this paper, the model and the method from the combination of GA and AA are proposed. The convergence of the method based on the Markov theory is analyzed. The experiment and analysis are conducted on the NP-hard problems for the cases of TSP30 (Travel Salesman Problem 30 cities) and CHN144 (China 144 cities). This work proves that the satisfactory solution sequence is monotonically decreasing and convergent. The results of simulations show that not only this combined algorithm is a step-by-step convergent process, but also its speed and effect of solving are quite satisfactory.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Li, M., Xu, B., Kou, J.: On the combination of genetic algorithms and neural networks. Systems-Engineering Theory & Practice (in Chinese) 19, 65–69 (1999)
Dorigo, M., Bonabeau, E., Theraulaz, G.: Ant algorithms and stigmergy. Future Generation Computer System 16, 851–871 (2000)
Stutzle, T., Hoos, H.H.: Max-min ant system. Future Generation Computer System 16, 889–914 (2000)
Zhang, W., Liang, Y.: Mathematical Foundation of Genetic Algorithms (in Chinese). Xi’an Jiantong University Press, Xi’an (2000)
Gutjahr, W.J.: A graph-based ant system and its convergence. Future Generation Computer System 16, 873–888 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, J., Tang, W., Ning, Y. (2005). Model and Convergence for the Combination of Genetic Algorithm and Ant Algorithm. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_33
Download citation
DOI: https://doi.org/10.1007/11596448_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)