A comparison between ACO algorithms for the set covering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 1-12

  Lessing, Lucas ^a   Dumitrescu, Irina ^b   Stützle, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b HEC MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; SWARM INTELLIGENCE; ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

ACO ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; COMPUTATIONAL STUDIES; HEURISTIC INFORMATION; LOCAL SEARCH; SET COVERING PROBLEM;

ANT COLONY OPTIMIZATION;

EID: 77049127356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_1     Document Type: Conference Paper

References (19)

1. E. Balas and M. C. Carrera. A dynamic subgradient-based branch and bound procedure for set covering. Operations Research, 44(6):875-890, 1996.
2. J. E. Beasley and P. C. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94(2):392-404, 1996.
3. M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997.
4. M. Dorigo and T. Stützle. The ant colony optimization metaheuristic: Algorithms, applications and advances. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 251-285. Kluwer, 2002.
5. M. Dorigo and T. Sẗutzle. Ant Colony Optimization. MIT Press, USA, 2004.
6. A. V. Eremeev. A genetic algorithm with a non-binary representation for the set covering problem. In P. Kall and H.-J. Lüthi, editors, Operations Research Proceedings 1998, pages 175-181. Springer Verlag, 1999.
7. M. L. Fisher. The Lagrangean relaxation method for solving integer programming problems. Management Science, 27(1):1-17, 1981.
8. R. Hadji, M. Rahoual, E. Talbi, and V. Bachelet. Ant colonies for the set covering problem. In M. Dorigo et al., editors, Proceedings of ANTS2000, pages 63-66, 2000.
9. E. Housos and T. Elmoth. Automatic optimization of subproblems in scheduling airlines crews. Interfaces, 27(5):68-77, 1997.
10. G. Leguizamón and Z. Michalewicz. Ant Systems for subset problems. Unpublished manuscript, 2000.
11. L. Lessing. Ant colony optimization for the set covering problem. Master's thesis, Fachgebiet Intellektik, Fachbereich Informatik, TU Darmstadt, Germany, 2004.
12. H. R. Lourenço, R. Portugal, and J. P. Paixão. Multiobjective metaheuristics for the bus-driver scheduling problem. Transportation Science, 35(3):331-343, 2001.
13. H. R. Lourenço and D. Serra. Adaptive search heuristics for the generalized assignment problem. Mathware & Soft Computing, 9(2-3):209-234, 2002.
14. V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11(4):358-369, 1999.
15. E. Marchiori and A. Steenbeek. An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In S. Cagnoni et al., editors, Proc. of EvoWorkshops 2000, volume 1803 of LNCS, pages 367-381. Springer Verlag, 2000.
16. T. Stützle and H. H. Hoos. MAX-MIN Ant System. Future Generation Computer Systems, 16(8):889-914, 2000.
17. T. Stützle and H.H. Hoos. MAX-MIN Ant System and local search for combinatorial optimization problems. In S. Voss et al., editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 137-154. Kluwer, 1999.
18. F. J. Vasko and F. E. Wolf. Optimal selection of ingot sizes via set covering. Operations Research, 35:115-121, 1987.
19. M. Yagiura, M. Kishida, and T. Ibaraki. A 3-flip neighborhood local search for the set covering problem. Technical Report #2004-001, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan, 2004.