Abstract:
By use of the properties of ant colony algorithm and particle swarm optimization, a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopt...Show MoreMetadata
Abstract:
By use of the properties of ant colony algorithm and particle swarm optimization, a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopts statistics method to get several initial better solutions and in accordance with them, gives information pheromone to distribute. Second, it makes use of the ant colony algorithm to get several solutions through information pheromone accumulation and renewal. Finally, by using across and mutation operation of particle swarm optimization, the effective solutions are obtained. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, all the 16 hybrid algorithms are proved effective. Especially the hybrid algorithm with across strategy B and mutation strategy B is a simple and effective better algorithm than others.
Published in: 2006 Chinese Control Conference
Date of Conference: 07-11 August 2006
Date Added to IEEE Xplore: 15 January 2007
ISBN Information:
ISSN Information:
References is not available for this document.
Select All
1.
Colorni A, Dorigo M, Maniezzo V An investigation of some properties of an ant algorithm[A]. Proc. Of the Parallel Problem Solving from Nature Conference (PPSN'92)[C]. Brussels, Belgium: Elsevier Publishing, 1992: 509-520.
2.
Chinese source
3.
Chinese source
4.
Gunes M, Sorges U, Bouazizi I. ARA the ant colony based routing algorithm for MANETs[A]. Proceedings International Conference on Parallel Processing Workshops[C]. Uuncouver, BC, Canada, 2002:79-85.
5.
Lumer E, Faieta B. Diversity and adaptation in populations of clustering ants [A]. Proc of the 3 Conf On Simulation of Adaptive Behavior[C]. MIT Press, 1994:499-508.
6.
Parpinelli R S, Lopes H S, Freitas. Data mining with an Ant Colony optimization algorithm[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(4):321-332.
7.
Eberhart R. C. , Kennedy J., A new optimizer using particles swarm theory[C]. Proc. Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995:39-43.
8.
Shi Y. H. , Eberhart R. C. A modified particle swarm optimizer[c]. IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May 4-9, 1998 69-73
9.
Chinese source
10.
Chinese source
11.
Chinese source
12.
Chinese source
