IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-32177-2_5.html
   My bibliography  Save this book chapter

Covering Location Problems

In: Location Science

Author

Listed:
  • Sergio García

    (University of Edinburgh, School of Mathematics)

  • Alfredo Marín

    (Universidad de Murcia, Departamento de Estadística e Investigación Operativa)

Abstract

When deciding where to locate facilities (e.g., emergency points where an ambulance will wait for a call) that provide a service, it happens quite often that a customer (e.g., a person) can receive this service only if she is located less than a certain distance from the nearest facility (e.g., the ambulance can arrive in less than 7 min at this person’s home). The problems that share this property receive the name of covering problems and have many applications. (analysis of markets, archaeology, crew scheduling, emergency services, metallurgy, nature reserve selection, etc.). This chapter surveys the most relevant problems in this field: the Set Covering Problem, the Maximal Covering Location Problem, and related problems, In addition, it is introduced a general model that has as particular cases the main covering location models. The most important theoretical results in this topic as well as exact and heuristic algorithms are reviewed. A Lagrangian approach to solve the general model is detailed, and, although the emphasis is on discrete models, some information on continuous covering is provided at the end of the chapter.

Suggested Citation

  • Sergio García & Alfredo Marín, 2019. "Covering Location Problems," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 2, chapter 0, pages 99-119, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-32177-2_5
    DOI: 10.1007/978-3-030-32177-2_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-32177-2_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.