Skip to main content
SpringerLink
Log in

A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7997))

Included in the following conference series:

  • 1758 Accesses

Abstract

We consider an extension of the set covering problem (SCP) introducing (i) multicover and (ii) generalized upper bound (GUB) constraints that arise in many real applications of SCP. For this problem, we develop a 2-flip neighborhood local search algorithm with a heuristic size reduction algorithm, in which a new evaluation scheme of variables is introduced taking account of GUB constraints. According to computational comparison with the latest version of a mixed integer programming solver, our algorithm performs quite effectively for various types of instances, especially for very large-scale instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47, 730–743 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353–371 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Umetani, S., Yagiura, M.: Relaxation heuristics for the set covering problem. J. Oper. Res. Soc. Jpn. 50, 350–375 (2007)

    MathSciNet  MATH  Google Scholar 

  4. Yagiura, M., Kishida, M., Ibaraki, T.: A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172, 472–499 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Osaka University, Suita, 565-0871, Japan

    Shunji Umetani

  2. Fujitsu Limited, Kawasaki, 211-8588, Japan

    Masanao Arakawa

  3. Nagoya University, Nagoya, 464-8601, Japan

    Mutsunori Yagiura

Authors
  1. Shunji Umetani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masanao Arakawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mutsunori Yagiura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shunji Umetani .

Editor information

Editors and Affiliations

  1. Università Catania Dipto. Matematica e Informatica, Catania, Italy

    Giuseppe Nicosia

  2. Industrial & Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Umetani, S., Arakawa, M., Yagiura, M. (2013). A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. In: Nicosia, G., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2013. Lecture Notes in Computer Science(), vol 7997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44973-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-44973-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-44972-7

  • Online ISBN: 978-3-642-44973-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation