Model and convergence for the combination of genetic algorithm and ant algorithm

Authors:
Jianli Ding;Wansheng Tang;Yufu Ning
Affiliations:
Institute of Systems Engineering, Tianjin University, Tianjin, China;Institute of Systems Engineering, Tianjin University, Tianjin, China;Institute of Systems Engineering, Tianjin University, Tianjin, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 3
Cited 1

Ant algorithms and stigmergy

Future Generation Computer Systems
A Graph-based Ant system and its convergence

Future Generation Computer Systems
MAX-MIN Ant system

Future Generation Computer Systems

Parallel combination of genetic algorithm and ant algorithm based on dynamic K-means cluster

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II

Quantified Score

Hi-index	0.00

Visualization

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.