A fast and efficient ant colony optimization approach for the set covering problem

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 1839-1844

  Ren, Zhigang ^a   Feng, Zuren ^a   Ke, Liangjun ^a   Chang, Hong ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BOOLEAN FUNCTIONS; COLUMNS (STRUCTURAL); KETONES; SOLUTIONS;

ANT COLONY OPTIMIZATIONS; CANDIDATE SOLUTIONS; COMPUTATIONAL RESULTS; CONSTRUCTION METHODS; EXISTING METHODS; HIGH QUALITIES; LOCAL SEARCH PROCEDURES; PARTIAL SOLUTIONS; QUALITY OF SOLUTIONS; SET COVERING PROBLEMS;

OPTIMIZATION;

EID: 55749084687     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4631038     Document Type: Conference Paper

References (14)

1. S. Ceria, P. Nobili, and A. Sassano, "Set covering problem," in Annotated Bibliographies in Combinatorial Optimization. M. Dell'Amico, F. Maffioli and S. Martello John, Ed. Wiley & Sons, 1997, pp. 415-428.
2. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco CA, 1979.
3. J.E. Beasley, "A lagrangian heuristic for set-covering problems," Naval Research Logistics, vol. 37, pp. 151-164, 1990.
4. M. Yagiura, M. Kishida, T. Ibaraki, "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, vol. 172, pp. 472-499, July 2006.
5. J.E. Beasley, P.C. Chu, "A genetic algorithm for the set covering problem," European Journal of Operational Research, vol. 96, pp. 392-404, 1996.
6. G. Leguizamon, Z. Michalewicz, "A newversion of ant system for subset problems," in Proceedings of the 1999 Congress on Evolutionary Computation (CEC 99), Washington, DC, USA, pp. 1459-1464, 1999.
7. R. Hadji, M. Rahoual, E. Talbi, and V. Bachelet, "Ant colonies for the set covering problem," In Proceedings of ANTS2000, Brussels, Belgium, pp. 63-66, 2000.
8. L. Lessing, I. Dumitrescu, and T. Stützle. "A comparison between ACO algorithms for the set covering problem," Lecture Notes in Computer Science, vol. 3172, pp. 1-12, 2004.
9. B. Crawford, C. Castro, "Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems," Lecture Notes in Computer Science, vol. 4029, pp. 1082-1090, 2006.
10. M. Dorigo, L.M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, vol. 1, pp. 53-66, 1997.
11. M. Dorigo, V. Maniezzo, and A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 26, pp. 29-41, 1996.
12. T. Stützle, H. H. Hoos, "Max-Min ant system," Future Generation Computer Systems, vol. 16, pp. 889-914, 2000.
13. Haibin Duan, Guanjun Ma, and Senqi Liu, "Experimental study of the adjustable parameters in basic ant colony optimization algorithm," in Proceedings of the 2007 Congress on Evolutionary Computation (CEC 07), Singapore, pp. 149-156, 2007.
14. J. E. Beasley, "OR-Library: Distributing test problem by electronic mail," Journal of Operational Research Society, vol. 41, pp. 1069-1072, 1990.