Discrete Location Problems with Uncertainty

Nader Azizi (), Sergio García () and Chandra Ade Irawan ()
Additional contact information
Nader Azizi: University of Edinburgh
Sergio García: University of Edinburgh
Chandra Ade Irawan: University of Nottingham Ningbo China

Chapter Chapter 2 in The Palgrave Handbook of Operations Research, 2022, pp 43-71 from Springer

Abstract: Abstract Discrete facility location problems consist in finding the best set of facilities over a finite set of potential sites so that a certain service is provided: goods delivered from a warehouse, emergency vehicles that provide first aid or take sick people to hospitals, shops that are near the potential customers, etc. Although when these problems were introduced in the literature, exact and precise information on the data was assumed, it is nowadays clear that this is rarely true. Therefore, models that account for uncertainty are required. In this chapter we will survey three of the most important families of problems in discrete facility location: the single-source capacitated facility location problem, covering problems, and hub location problems. The main contributions and solution methods in the area are reviewed for these problems, including formulations for some of the models and solution methods.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-96935-6_2

Ordering information: This item can be ordered from
http://www.springer.com/9783030969356

DOI: 10.1007/978-3-030-96935-6_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().