The focus of this research is on location problems where potential facility sites are to be located in continuous space and demand is assumed continuously distributed, and includes the continuous p-center and coverage maximization problems. Relevant discrete location models are reviewed for the purpose of comparative analysis, including the vertex p problem and the maximal covering locational problem.
First, this dissertation explores a simple but effective approach for solving large vertex p problems, the results of which are to be used as a benchmark for its continuous space counterpart. By introducing a neighborhood facility set, the p problem can be reformulated such that many redundant variables and constraints are removed but characteristics, including optimality, of the problem are preserved. The problem size of the reformulated model can be substantially smaller than in the original form. This enables the use of general-purpose optimization software to solve large vertex p instances. Application results are provided and discussed.
The dissertation then studies the continuous space p problem. A Voronoi diagram heuristic has been proposed for solving the p problem in continuous space. However, important assumptions underlie this heuristic and may be problematic for practical applications. These simplifying assumptions include uniformly distributed demand, representing a region as a rectangle, analysis of a simple Voronoi polygon in solving associated one-center problems and no restrictions on potential facility locations. In this dissertation, the complexity of solving the continuous space p problem in location planning is explored. Considering the issue of solution space feasibility, this research presents a spatially restricted version of this problem and proposes methods for solving it heuristically. The performance of the heuristic is evaluated by comparison with the discrete p problem. Theoretical and empirical results are provided.
Finally, this dissertation explores approaches for solving the problem of siting service facilities to maximize regional coverage when both facility sites and regional demand are assumed continuous. Traditionally, coverage maximization has been approached using discrete representations of potential facility sites and service demand locations. However, such discretizations of space can lead to significant measurement and coverage errors. Representing candidate facility sites and service demand locations as continuously distributed is more reasonable in many cases. Research on coverage maximization in this context has been limited to siting a single facility in a region. This dissertation addresses multiple facility siting in continuous space. A Voronoi diagram heuristic is proposed to decompose the multiple facility problem into a set of single facility problems. The developed approach is applied to emergency warning siren siting in a region. The results are compared with those obtained from a discrete approach.
|Advisor:||Murray, Alan T.|
|Commitee:||Murray, Alan T., O'Kelly, Morton E., Xiao, Ningchuan|
|School:||The Ohio State University|
|School Location:||United States -- Ohio|
|Source:||DAI-B 78/11(E), Dissertation Abstracts International|
|Subjects:||Geography, Operations research|
|Keywords:||Continuous space location problems, Coverage maximization, P-center problem, Voronoi diagram heuristic|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be