DocumentCode
423768
Title
Solving point covering problem by ant algorithm
Author
Hua, Zhen ; Fan, Hui ; Li, Jin-Jiang ; Yuan, Da
Author_Institution
Sch. of Opt. & Electr. Information, Yantai Univ., Shandong, China
Volume
6
fYear
2004
fDate
26-29 Aug. 2004
Firstpage
3501
Abstract
This paper discusses the point covering problem solved by ant algorithm. Point covering problem is hard to solve with great actual value. Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years. A distributed parallel algorithm of point covering is presented with ant algorithm. Experiment results demonstrate that the algorithm is effective.
Keywords
combinatorial mathematics; computational complexity; optimisation; parallel algorithms; search problems; stochastic processes; ant algorithm; distributed parallel algorithm; point covering problem; stochastic searching optimization algorithm; Algorithm design and analysis; Ant colony optimization; Approximation algorithms; Attenuation; Computer networks; Computer science; Computerized monitoring; Parallel algorithms; Stochastic processes; Valves;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN
0-7803-8403-2
Type
conf
DOI
10.1109/ICMLC.2004.1380395
Filename
1380395
Link To Document