Divide and Conquer: A Location-Allocation Approach to Sectorization

Cristina Lopes (), Ana Maria Rodrigues (), Valeria Romanciuc, José Soeiro Ferreira, Elif Göksu Öztürk and Cristina Oliveira
Additional contact information
Cristina Lopes: CEOS.PP, ISCAP, Polytechnic of Porto, 4465-004 Porto, Portugal
Ana Maria Rodrigues: CEOS.PP, ISCAP, Polytechnic of Porto, 4465-004 Porto, Portugal
Valeria Romanciuc: Millennium BCP, 1050-059 Lisbon, Portugal
José Soeiro Ferreira: INESC TEC, 4200-465 Porto, Portugal
Elif Göksu Öztürk: INESC TEC, 4200-465 Porto, Portugal
Cristina Oliveira: CEOS.PP, ISCAP, Polytechnic of Porto, 4465-004 Porto, Portugal

Mathematics, 2023, vol. 11, issue 11, 1-19

Abstract: Sectorization is concerned with dividing a large territory into smaller areas, also known as sectors. This process usually simplifies a complex problem, leading to easier solution approaches to solving the resulting subproblems. Sectors are built with several criteria in mind, such as equilibrium, compactness, contiguity, and desirability, which vary with the applications. Sectorization appears in different contexts: sales territory design, political districting, healthcare logistics, and vehicle routing problems (agrifood distribution, winter road maintenance, parcel delivery). Environmental problems can also be tackled with a sectorization approach; for example, in municipal waste collection, water distribution networks, and even in finding more sustainable transportation routes. This work focuses on sectorization concerning the location of the area’s centers and allocating basic units to each sector. Integer programming models address the location-allocation problems, and various formulations implementing different criteria are compared. Methods to deal with multiobjective optimization problems, such as the ϵ -constraint, the lexicographic, and the weighted sum methods, are applied and compared. Computational results obtained for a set of benchmarking instances of sectorization problems are also presented.

Keywords: sectorization; multiobjective optimization; integer programming; districting problems; lexicographic method; ?-constraint method; weighted sum method (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/11/2553/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/11/2553/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:11:p:2553-:d:1162343

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().