Generating optimal and near-optimal solutions to facility location problems
Richard L Church and
Carlos A Baez
Environment and Planning B, 2020, vol. 47, issue 6, 1014-1030
Abstract:
There is a decided bent toward finding an optimal solution to a given facility location problem instance, even when there may be multiple optima or competitive near-optimal solutions. Identifying alternate solutions is often ignored in model application, even when such solutions may be preferred if they were known to exist. In this paper we discuss why generating close-to-optimal alternatives should be the preferred approach in solving spatial optimization problems, especially when it involves an application. There exists a classic approach for finding all alternate optima. This approach can be easily expanded to identify all near-optimal solutions to any discrete location model. We demonstrate the use of this technique for two classic problems: the p -median problem and the maximal covering location problem. Unfortunately, we have found that it can be mired in computational issues, even when problems are relatively small. We propose a new approach that overcomes some of these computational issues in finding alternate optima and near-optimal solutions.
Keywords: Facility location; spatial optimization; generating alternative configurations; identifying multi-optima; generating close-to-optimal solutions (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/2399808320930241 (text/html)
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:sae:envirb:v:47:y:2020:i:6:p:1014-1030
DOI: 10.1177/2399808320930241
Access Statistics for this article
More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().