An effective and simple heuristic for the set covering problem

European Journal of Operational Research

Volumn 176, Issue 3, 2007, Pages 1387-1403

  Lan, Guanghui ^a   DePuy, Gail W ^b   Whitehouse, Gary E ^c  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF LOUISVILLE   (United States)

^c UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

Combinatorial optimization; Meta RaPS; Set covering

Indexed keywords

COMBINATORIAL OPTIMIZATION; META-RAPS; SET COVERING PROBLEMS (SCP);

ALGORITHMS; COMBINATORIAL MATHEMATICS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

HEURISTIC METHODS;

EID: 33750018061     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.09.028     Document Type: Article

References (31)

1. Arcus A.L. COMSOAL: A computer method of sequencing operations for assembly lines. International Journal of Production Research 4 (1966) 259-277
2. Aickelin U. An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society 53 (2002) 1118-1126
3. Balas E. A class of location, distribution and scheduling problems: Modeling and solution methods. Proceedings of the Chinese-US Symposium on System Analysis (1983), J. Wiley and Sons, New Rouk
4. Balas E., and Carrera M. A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research 44 (1996) 875-890
5. Beasley J.E. An algorithm for set covering problem. European Journal of Operational Research 31 (1987) 85-93
6. Beasley J.E. A Lagrangian heuristic for set covering problems. Naval Research Logistics 37 (1990) 151-164
7. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
8. Beasley J.E., and JØrnsten K. Enhancing an algorithm for set covering problems. European Journal of Operational Research 58 (1992) 293-300
9. Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 5 (1999) 730-743
10. Caprara A., Fischetti M., and Toth P. Algorithms for the set covering problem. Annals of Operations Research 98 (2000) 353-371
11. Ceria S., Nobili P., and Sassano A. Set Covering Problem. Annotated Bibliographies in Combinatorial Optimization (1998), John Wiley and Sons, New York pp. 415-428
12. Ceria S., Nobili P., and Sassano A. A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81 (1998) 215-228
13. Chvatal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4 (1979) 233-235
14. Coy S., Golden B., Runger G., and Wasil E. Using experimental design to find effective parameter setting for heuristics. Journal of Heuristics 7 (2001) 77-97
15. DePuy G.W., Moraga R.J., and Whitehouse G. Meta-RaPS: A simple and effective approach for solving the traveling salesman problem. Transportation Research Part E: Logistics and Transportation Review 41 2 (2005) 115-130
16. DePuy, G.W., Whitehouse, G.E., Moraga, R.J., 2002. Using the Meta-RaPS approach to solve combinatorial problems. In: Proceedings of the 2002 Industrial Engineering Research Conference, May 19-21, Orlando, Florida. Computers & Industrial Engineering, submitted for publication.
17. Dongarra, J.J., 2004. Performance of various computers using standard linear equations software. Technical Report No. CS-89-85, Computer Science Department, University of Tennesse.
18. Feo T., and Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8 (1989) 67-71
19. Fisher M., and Kedia P. Optimal solution of set covering/partitioning problems using dual heuristics. management Science 36 (1998) 674-688
20. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
21. Goldberg M.K., and Russell H.C. Toward computing m(4). Ars Combinatoria 3 9 (1995) 139-148
22. Grossman T., and Wool A. Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research 101 (1997) 81-92
23. Haouari M., and Chaouachi J.S. A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem. Journal of the Operational Research Society 53 (2002) 792-799
24. Harborth H., and Nienborg H. Maximum number of edges in a six-cube without four-cycles. Bulletin of the Institute of Combinatorics and Applications 12 (1994) 55-60
25. Jacobs L., and Brusco M. Note: A local-search heuristic for large set-covering problems. Naval Research Logistics 42 (1995) 1129-1140
26. Lan, G., 2004. An effective and simple heuristic based on Meta-RaPS to solve large-scale set covering problems, M.S. Thesis, University of Louisville.
27. Moraga R.J., DePuy G.W., and Whitehouse G.E. Meta-RaPS approach for the 0-1 multidimensional knapsack problem. Computers & Industrial Engineering 48 1 (2005) 83-96
28. Ohlsson M., Peterson C., and Söderberg B. An efficient mean field approach to the set covering problem. European Journal of Operational Research 133 (2001) 583-595
29. Peleg, D., Schechtman, G., Wool, A., 1996. Randomized approximation of bounded multicovering problems, Algorithmica.
30. Vasko F.J., and Wilson G.R. An efficient heuristic for large set covering problems. Naval Research Logistics Quarterly 31 (1984) 163-171
31. Whitehouse, G.E., DePuy, G.W., Moraga, R.J., 2002. Meta-RaPS approach for solving the resource allocation problem. In: Proceedings of the 2002 World Automation Congress, June 9-13, Orlando, Florida.