Abstract
This paper presents an algorithm for the Set Covering Problem whose centerpiece is a new primal-to-dual scheme aimed at linking any primal solution to the dual feasible vector that best reflects the quality of the primal solution. This new mechanism is used to intertwine a tabu search based primal intensive scheme with a Lagrangian based dual intensive scheme to design a dynamic primal-dual algorithm that progressively reduces the gap between upper and lower bound. The algorithm has been tested on benchmark problems from the literature: the gap between upper and lower bound in 6 instances of problems whose optimal solution is not known has been further reduced, 4 of them via improvements in the lower bound, and 4 by producing a solution that is better than the best solution provided by other procedures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balas, E. and Carrera, M. C. (1996). A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering Problem. Operations Research, 44(6):875–890.
Balas, E. and Ho, A. (1980). Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: a Computational Study. Mathematical Programming Study, 112:37–60.
Beasley, J. E. (1990). A Lagrangian Heuristic for Set Covering Problems. Naval Research Logistics, 37:151–164.
Borneman, J., Chrobak, M., Della Vedova, G., Figueroa, A., and Jiang, T. (2001). Probe Selection Algorithms with Applications in the Analysis of Microbial Community. Bioinformatics - Discovery Notes, 1:(1)1–9.
Boros, E., Hammer, P. L., Ibaraki, T., Kogan, A., Mayoraz, E., and Muchnik, I. (1996). An Implementation of Logical Analysis of Data. Technical report, Rutgers University, New Brunswick, NJ - 08903-5062.
Bricker, D. and Techapicjetvanich, K. (1993). Investigation of Lagrangian Heuristics for Set Covering Problems. Technical Report Iowa City, IA, 52242, University of Iowa.
Caprara, A., Fischetti, M., and Toth, P. (1999). A Heuristic Method for the Set Covering Problem. Operations Research, 47:(5)730–743.
Caserta, M., Quiñonez Rico, E., and Márquez Uribe, A. (2006). A Cross Entropy Algorithm for the Knapsack Problem with Setups. Computers and Operations Research.
Caserta, M. and Ryoo, H. S. (2001). Efficient Tabu Search-Based Procedure for Optimal Redundancy Allocation in Complex System Reliability. In Proc. 5th Intl Conference on Optimization: Techniques and Applications, pages 592–599.
Ceria, S., Nobili, P., and Sassan, A. (1998). A Lagrangian-based Heuristic for Large-scale Set Covering Problems. Mathematical Programming Ser B, 81:215–228.
Chu, P. C. and Beasley, J. E. (1998). A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics, 4:(1)63–86.
Dom, M., Guo, J., Niedermeier, R., and Wernicke, S. (2006). Minimum Membership Set Covering and the Consecutive Ones Property. In Arge, L. and Freivalds, R., editors, SWAT 2006 - 10th Scandinavian Workshop on Algorithm Theory, volume 4059 of Springer LNCS, page 337.
Downey, R. G. and Fellows, M. R. (1999). Parameterized Complexity. Monographs in Computer Science. Springer.
Fisher, M. L. and Kedia, P. (1990). Optimal Solutions of Set Covering/Partitioning Problems using Dual Heuristics. Management Science, 36:674–688.
Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman.
Glover, F. and Kochenberger, G. A. (1996). Critical Event Tabu Search for Multidimensional Knapsack Problems, chapter In Meta-Heuristics: Theory and Applications – I.H. Osman and J.P. Kelly, pages 407–427. Kluwer Academic Publishers.
Held, M. and Karp, R. M. (1971). The Traveling Salesman Problem and Minimum Spanning Tree: Part II. Mathematical Programming, 1:6–25.
Lougee-Heimer, R. (2003). The Common Optimization INterface for Operations Research. IBM Journal of Research and Developmentg, 47:57–66.
Niedermeier, R. (2006). Invitation to Fixed-Parameter Algorithms. Oxforf University Press.
Vaasko, F. J and Wilson, G. R. (1984). An Efficient Heuristic for Large Set Covering Problems. Naval Research Logistics, 31:163–171.
Wedelin, D. (1995). An Algorithm for Large Scale 0-1 Integer Programming with Applications to Airline Crew Scheduling. Annals of Operational Research, 57:283–301.
Weihe, K. (1998). Covering Trains by Stations or the Power of Data Reduction. In Battiti, R. and Bertosi, A. A., editors, OnLine Proceedings of the 1st Workshop on Algorithms and Experiments (ALEX’98) - Trento, Italy, pages 1–8.
Yagiura, M., Kishida, M., and Ibaraki, T. (2006). A 3-Flip Neighborhood Local Search for the Set Covering Problem. European Journal of Operational Research, 172:472–499.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Caserta, M. (2007). Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71921-4_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-71921-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71919-1
Online ISBN: 978-0-387-71921-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)