loading...
An Ant Colony System Hybridized with Randomized Algorithm for TSP
Haier International Training Center, Qingdao, China July 30-August 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.545Eighth ACIS International Conference ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Chengming Qi, "An Ant Colony System Hybridized with Randomized Algorithm for TSP," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, vol. 3, pp. 461-465, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2007.545,
author = {Chengming Qi},
title = {An Ant Colony System Hybridized with Randomized Algorithm for TSP},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {3},
year = {2007},
isbn = {0-7695-2909-7},
pages = {461-465},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.545},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - An Ant Colony System Hybridized with Randomized Algorithm for TSP
SN - 0-7695-2909-7
SP461
EP465
A1 - Chengming Qi,
PY - 2007
KW - Ant Colony System; Combinatorial Optimization; Randomized Algorithm; TSP
VL - 3
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
Chengming Qi, Beijing Union University, China
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.
Index Terms:
Ant Colony System; Combinatorial Optimization; Randomized Algorithm; TSP
Citation:
Chengming Qi, "An Ant Colony System Hybridized with Randomized Algorithm for TSP," snpd, vol. 3, pp.461-465, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.