IMA Journal of Management Mathematics Advance Access originally published online on April 20, 2006
IMA Journal of Management Mathematics 2006 17(4):413-425; doi:10.1093/imaman/dpl009
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Solving the continuous space p-centre problem: planning application issues
1 Center for Urban and Regional Analysis and Department of Geography, The Ohio State University, 1036 Derby Hall, 154 North Oval Mall, Columbus, OH 43202, USA, 2 Department of Geography, The Ohio State University, 1036 Derby Hall, 154 North Oval Mall, Columbus, OH 43202, USA
** Email: wei.97{at}osu.edu
*** Email: murray.308{at}osu.edu
**** Email: xiao.37{at}osu.edu
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.
Keywords: location modeling; Voronoi diagram; heuristics
Received May 2005. accepted on 19 December 2005.