Abstract
The Voronoi diagram heuristic has been proposed for solving the p-centre 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-centre problems and no restrictions on potential facility locations. In this paper, we explore the complexity of solving the continuous space p-centre problem in location planning. Considering the issue of solution space feasibility, we present a spatially restricted version of this problem and propose methods for solving it heuristically. Theoretical and empirical results are provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
