Browse by author
Lookup NU author(s): Dr Gu Pang
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In districting problems the aim is to partition a region (or network) into smaller subareas (or sub-networks) so as to optimise one or more objective functions and subject to side constraints. In general, the aim in districting is to enable efficient operations within the district boundaries, which is usually easier as compared with organising operations in a large un-partitioned region (divide and conquer principle). Common side constraints in district design include work load balance, contiguity, compactness and the ability to support efficient operations. Over the past five decades, several districting applications and techniques have been reported in the literature. The purpose of this presentation is to provide an overview of the different districting applications with their distinct features reported in the literature, as well as the techniques and algorithms that have been proposed to solve these problems. We conclude our talk by identifying potential areas for future research.
Author(s): Pang G; Muyldermans L
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: OR53: OR Annual Conference
Year of Conference: 2011
