Back to Search
Start Over
Optimizing Administrative Divisions: A Vertex k-Center Approach for Edge-Weighted Road Graphs.
- Source :
- Baltic Journal of Modern Computing; 2024, Vol. 12 Issue 2, p176-188, 13p
- Publication Year :
- 2024
-
Abstract
- Efficient and equitable access to municipal services hinges on well-designed administrative divisions. It requires ongoing adaptation to changing demographics, infrastructure, and economic factors. This article proposes a novel transparent data-driven method for territorial division based on the Voronoi partition of edge-weighted road graphs and the vertex k-center problem as a special case of the minimax facility location problem. By considering road network structure and strategic placement of administrative centers, this method seeks to minimize travel time disparities and ensure a more balanced distribution of administrative time burden for the population. We show implementations of this approach in the context of Latvia, a country with complex geographical features and diverse population distribution. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 22558942
- Volume :
- 12
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Baltic Journal of Modern Computing
- Publication Type :
- Academic Journal
- Accession number :
- 178288867
- Full Text :
- https://doi.org/10.22364/bjmc.2024.12.2.04