An Ant Colony System Hybridized with Randomized Algorithm for TSP

Authors:
Chengming Qi
Affiliations:
Beijing Union University, China
Venue:
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Year:
2007

Citing 0
Cited 2

Some practical solutions to the uncertainties of the ant colony optimisation

International Journal of Computer Applications in Technology
Application with a hybrid ant colony optimisation in motif detecting problem

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant algorithms are a recently developed, population-based approach which has been successfully applied to several NP-hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the Ant Colony System (ACS),we present an Ant Colony System Hybridized with Randomized Algorithm( RAACS). In RAACS, only partial cities are randomly chosen to compute the state transition probability. Experimental results for solving the Traveling Salesman Problems( TSP) with both ACS and RAACS demonstrate that averagely speaking, the proposed method is better in both the quality of solutions and the speed of convergence compared with the ACS.