Solving point covering problem by ant algorithm
Zhen Hua; Hui Fan; Jin-Jiang Li; Da Yuan
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Volume 6, Issue , 26-29 Aug. 2004 Page(s): 3501 - 3504 vol.6
Digital Object Identifier  
Summary: 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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.