The process of sectorization aims at dividing a dataset into smaller sectors according to certain criteria, such as equilibrium and compactness. Sectorization problems appear in several different contexts, such as political districting, sales territory design, healthcare districting problems and waste collection, to name a few. Solution methods vary from application to application, either being exact, heuristics or a combination of both. In this paper, we propose two quadratic integer programming models to obtain a sectorization: one with compactness as the main criterion and equilibrium constraints, and the other considering equilibrium as the objective and compactness bounded in the constraints. These two models are also compared to ascertain the relationship between the criteria.
|Name||Lecture Notes in Mechanical Engineering|
|Conference||1st International Conference on Innovation in Engineering, ICIE 2021|
|Period||28/06/21 → 30/06/21|
- Integer programming