Variants of Location-Allocation Problems for Public Service Planning

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter presents some variants of the location-allocation problems (LAPs) with additional criteria for service planning such as partial coverage of service demand, contiguous service areas, and equal service areas. The variants arise in applications such as the selection of facility sites for the “15-minute city”, the delineation of public service areas, and the provision of some emergency services in the COVID-19 pandemic. The criteria are formulated as linear inequalities and thus can be added to the classical LAP models. It is challenging to solve those variants, since LAPs are known to be nondeterministic polynomial time hard (NP-hard), and the new criteria may impose further obstacles to the analytical solution. At the end of the chapter, I discuss possible methods to solve the variants.

Cite

CITATION STYLE

APA

Kong, Y. (2022). Variants of Location-Allocation Problems for Public Service Planning. In New Thinking in GIScience (pp. 309–318). Springer Nature. https://doi.org/10.1007/978-981-19-3816-0_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free