Method for Delineating Districts of Varying Shape

Abstract
Numerous problems involve subdividing a region into a number of nonfragmented districts of specified size. A model for delineating such districts which vary in shape as well as size is described. The model is based on an iterative technique originally designed to construct compact districts and extended to the problems of generating wedge-shaped and elongated districts. The purpose in delineating these district shapes is to reflect the general orientation of a street network using only coordinate data describing demand locations rather than the actual distance between these points. This capability is useful for solving a variety of problems such as facility location, vehicle routing, and data clustering.

This publication has 0 references indexed in Scilit: