A Study on the Optimal Partitioning Model with Distributed Facilities

Abstract

Many problems in two-dimentional location analysis can be formulated as optimally dividing a given region into several subregions. This paper deals with two partitioning problems; one of them is to minimize the sum of Euclidean distances under the condition that the capacities of each facility are restricted, and the other one is to minimize the maximum distances between existing facilities and fixed demand locations assigned to them. These optimal partitioning models are applied to the school boundary problem.