New ideas for applying ant colony optimization to the set covering problem

Computers and Industrial Engineering

Volumn 58, Issue 4, 2010, Pages 774-784

  Ren, Zhi Gang ^a   Feng, Zu Ren ^a   Ke, Liang Jun ^a   Zhang, Zhao Jun ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Ant colony optimization; Local search; Metaheuristic; Set covering problem

Indexed keywords

ANT-COLONY OPTIMIZATION; CANDIDATE SOLUTION; COMPUTATIONAL RESULTS; HEURISTIC INFORMATION; LAGRANGIAN DUAL; LOCAL SEARCH; META HEURISTICS; METAHEURISTIC; NEW APPROACHES; NOVEL METHODS; NP-HARD PROBLEM; SET COVERING PROBLEM;

ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; OPTIMIZATION;

ALGORITHMS;

EID: 77950594284     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.02.011     Document Type: Article

References (36)

1. Balas E., and Carrera M.C. A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research 44 6 (1996) 875-890
2. Beasley J.E. A Lagrangian heuristic for set covering problems. Naval Research Logistics 37 1 (1990) 151-164
3. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 2 (1996) 392-404
4. Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In W. B. Langdon et al. (Eds.), Proceedings of the genetic and evolutionary computation conference (GECCO 2002) (pp. 11-18). San Fransisco: Morgan Kaufmann Publishers.
5. Blum C., and Dorigo M. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics - Part B 34 2 (2004) 1161-1172
6. Brusco M.J., Jacobs L.W., and Thompson G.M. A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Annals of Operations Research 86 (1999) 611-627
7. Burke, R., Gustafson, S., & Kendall, G. (2002). A survey and analysis of diversity measures in genetic programming. In W. B. Langdon et al. (Eds.), Proceedings of the genetic and evolutionary computation conference (GECCO 2002) (pp. 716-723). San Fransisco: Morgan Kaufmann Publishers.
8. Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 5 (1999) 730-743
9. Caprara A., Toth P., and Fischetti M. Algorithms for the set covering problem. Annals of Operations Research 98 (2000) 353-371
10. Caserta M. Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner K.F., et al. (Ed). Metaheuristics: Progress in complex systems optimization (2007), Springer, New York 43-63
11. Ceria S., Nobili P., and Sassano A. A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81 (1998) 215-228
12. Chvatal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4 3 (1979) 233-235
13. Crawford, B., & Castro, C. (2006). Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems. In L. Rutkowski et al. (Eds.), Proceedings of the 8th international conference on artificial intelligence and soft computing (ICAISC 2006) (pp. 1082-1090). Berlin, Heidelberg: Springer-Verlag.
14. Dongarra, J. J. (2007). Performance of various computers using standard linear equations software. Technical report, CS-89-85. Computer Science Department, University of Tennessee.
15. Dorigo M., Birattari M., and Stützle T. Ant colony optimization: Artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine 1 4 (2006) 28-39
16. Dorigo M., and Di Caro G. The ant colony optimization meta-heuristic. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, Maidenhead, UK 11-32
17. Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
18. Dorigo M., Maniezzo V., and Colorni A. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26 1 (1996) 29-41
19. Dorigo M., and Stützle T. Ant colony optimization (2004), MIT Press, Cambridge
20. Finger, M., Stützle, T., & Ramalhinho H. (2002). Exploiting fitness distance correlation of set covering problems. In S. Cagnoni et al. (Eds.), Proceedings of EvoWorkshops 2002 (pp. 61-71). Berlin, Heidelberg: Springer-Verlag.
21. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 1 (1981) 1-18
22. Fisher M.L., and Kedia P. Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36 6 (1990) 674-688
23. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness (1979), Freeman, San Francisco, CA
24. Gutjahr W.J. On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability 8 (2006) 105-133
25. Hadji, R., Rahoual, M., Talbi, E., & Bachelet V. (2000). Ant colonies for the set covering problem. In M. Dorigo et al. (Eds.), Proceedings of ANTS 2000 (pp. 63-66).
26. Housos E., and Elmoth T. Automatic optimization of subproblems in scheduling airlines crews. Interfaces 27 5 (1997) 68-77
27. Lan G., and DePuy G.W. On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Computer & Industrial Engineering 51 3 (2006) 362-374
28. Lessing, L., Dumitrescu, I., & Stützle, T. (2004). A comparison between aco algorithms for the set covering problem. In M. Dorigo et al. (Eds.), Proceedings of ANTS 2004 (pp. 1-12). Berlin, Heidelberg: Springer-Verlag.
29. Osman, I. H. (2004). Metaheuristics: Models, design and analysis. In E. Kozan (Eds.), Proceedings of the 5th Asia-Pacific industrial engineering and management systems conference (pp. 1.2-1.16). Australia: Queensland University of Technology.
30. Osman I.H. A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem. Computers & Operations Research 33 (2006) 2526-2546
31. Solnon C., and Bridge D. An ant colony optimization meta-heuristic for subset selection problems. In: Nedjah N., and Mourelle L. (Eds). System engineering using particle swarm optimization (2006), Nova Science Publisher, New York 7-29
32. Solnon C., and Fenet S. A study of ACO capabilities for solving the maximum clique problem. Journal of Heuristics 12 (2006) 155-180
33. Stützle T., and Hoos H.H. Max-min ant system. Future Generation Computer Systems 16 9 (2000) 889-914
34. Vasko F.J., and Wilson G.R. Using a facility location algorithm to solve large set covering problems. Operations Research Letters 3 2 (1984) 85-90
35. Vasko F.J., and Wolf F.E. Optimal selection of ingot sizes via set covering. Operations Research 35 3 (1987) 346-353
36. Wolsey L.A. Lagrangian duality. In: Wolsey L.A. (Ed). Integer programming (1998), Wiley-Interscience 167-181