DocumentCode :
2514487
Title :
Minimum vertex cover problem based on Ant Colony Algorithm
Author :
Jingrong Chen ; Ruihua Xu
Author_Institution :
Sch. of Transp. Eng., Tongji Univ., Shanghai, China
fYear :
2011
fDate :
22-22 Oct. 2011
Firstpage :
125
Lastpage :
129
Abstract :
By applying Ant-Cycle model of Ant Colony Algorithm, and modifying the state transition probability, an approximation algorithm is obtained for the minimum vertex cover problem. The time complex of the algorithm is O(n2) , where n is the number of vertices in a network. In the end, an example is given to illustrate the process of the algorithm.
Keywords :
ant colony optimisation; approximation theory; ant colony algorithm; ant cycle model; approximation algorithm; minimum vertex cover problem; state transition probability; time complex; Ant Colony Algorithm; approximation algorithm; minimum vertex cover problem; state transition probability; time complex;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Advanced Forum on Transportation of China (AFTC 2011), 7th
Conference_Location :
Beijing
Electronic_ISBN :
978-1-84919-571-3
Type :
conf
DOI :
10.1049/cp.2011.1389
Filename :
6232056
Link To Document :
بازگشت