Welcome to IEEE Xplore 2.0: Solving point covering problem by ant algorithm

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Solving point covering problem by ant algorithm
Zhen Hua Hui Fan Jin-Jiang Li Da Yuan
Sch. of Opt. & Electr. Information, Yantai Univ., Shandong, China;

This paper appears in: Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Publication Date: 26-29 Aug. 2004
Volume: 6, On page(s): 3501- 3504 vol.6
ISSN:
ISBN: 0-7803-8403-2
INSPEC Accession Number: 8254312
Current Version Published: 2005-01-24

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.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.