A hybrid heuristic for the set covering problem

Operational Research

Volumn 12, Issue 3, 2012, Pages 345-365

  Sundar, Shyam ^a   Singh, Alok ^a  

^a UNIVERSITY OF HYDERABAD   (India)

Author keywords

Artificial bee colony algorithm; Combinatorial optimization; Heuristic; Set covering problem; Swarm intelligence

Indexed keywords

EID: 84867090039     PISSN: 11092858     EISSN: 18661505     Source Type: Journal    
DOI: 10.1007/s12351-010-0086-y     Document Type: Article

References (34)

1. Aickelin U (2002) An indirect genetic algorithm for set covering problems. J Oper Res Soc 53: 1118-1126.
2. Balas E, Carrera M (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44: 875-890.
3. Basturk B, Karaboga D (2006) An artificial bee colony (ABC) algorithm for numeric function optimization. In: Proceeding of the IEEE swarm intelligence symposium, Indianapolis, 12-14 May.
4. Beasley JE (1987) An algorithm for set covering problem. Eur J Oper Res 31: 85-93.
5. Beasley JE (1990) A Lagrangian heuristic for set covering problems. Naval Res Logist 37: 151-164.
6. Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94: 392-404.
7. Beasley JE, JØrnsten K (1992) Enhancing an algorithm for set covering problems. Eur J Oper Res 58: 293-300.
8. Boros E, Hammer PL, Ibaraki T, Kogan A (1997) Logical analysis of numerical data. Math Program 79(1-3): 163-190.
9. Brusco MJ, Jacobs LW, Thompson GM (1999) A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Ann Oper Res 86: 611-627.
10. Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47(5): 730-743.
11. Caprara A, Toth P, Fischetti M (2000) Algorithms for the set covering problem. Ann Oper Res 98: 353-371.
12. Caserata M (2007) Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner KF et al (eds) Metaheuristics: progress in complex systems optimization. Springer, Berlin, pp 43-63.
13. Ceria S, Nobili P, Sassano A (1998a) A Lagrangian-based heuristic for large-scale set covering problems. Math Program 81(2): 215-228.
14. Ceria S, Nobili P, Sassano A (1998b) Set covering problem. Annotated bibliographies in combinatorial optimization. Wiley, New York, pp 415-428.
15. Fisher ML, Kedia P (1990) Optimal solution of set covering/partitioning problems using dual heuristics. Manag Sci 36: 674-688.
16. Fisher ML, Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling. Naval Res Logist 36: 27-42.
17. Foster BA, Ryan DM (1976) An integer programming approach to the vehicle scheduling problem. Oper Res Q 27: 367-384.
18. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco.
19. Haouari M, Chaouachi JS (2002) A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem. J Oper Res Soc 53: 792-799.
20. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey.
21. Karaboga D, Akay B (2009) A survey: algorithms simulating bee swarm intelligence. Artif Intell Rev 31: 61-85.
22. Karaboga D, Basturk B (2007a) A powerful and efficient algorithm for numeric function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39: 459-471.
23. Karaboga D, Basturk B (2007b) Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. Lecture notes in Artificial Intelligence, vol 4529. Springer, Berlin, pp 789-798.
24. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8: 687-697.
25. Lan G, Depuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176: 1387-1403.
26. Lessing L, Dumitrescu I, Stützle T (2004) A comparison between ACO algorithms for the set covering problem. In: Proceedings of ANTS 2004, Lecture Notes in Computer Science, vol 3172, pp 1-12.
27. Ren Z, Feng Z, Ke L, Chang H (2008) A fast and efficient ant colony optimization approach for the set covering problem. In: Proceedings of the 2008 IEEE congress on evolutionary computation (CEC 2008). IEEE Press, pp 1839-1844.
28. Ren ZG, Feng ZR, Ke LJ, Zhang ZJ (2010) New ideas for applying ant colony optimization to the set covering problem. Comput Ind Eng 58: 774-784.
29. Singh A (2009) An artificial bee colony (ABC) algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2): 625-631.
30. Smith BM (1988) Impacs-a bus crew scheduling system using integer programming. Math Program 42(1-3): 181-187.
31. Toregas C, Swain R, Revelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19: 1363-1373.
32. Utemani S, Yagiura M (2007) Relaxation heuristics for the set covering problem. J Oper Res Soc Jpn 50: 350-375.
33. Vasko FJ, Wolf FE, Stott KL (1989) A set covering approach to metallurgical grade assignment. Eur J Oper Res 38: 27-34.
34. Yagiura M, Kishida M, Ibaraki T (2006) A 3-flip neighborhood local search for the set covering problem. Eur J Oper Res 172: 472-499.