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.

翻译：高效且公平地获取市政服务依赖于精心设计的行政区划。这需要根据人口结构、基础设施和经济因素的不断变化进行持续调整。本文提出了一种新颖的、透明的数据驱动方法，用于基于边加权道路图的Voronoi划分和顶点$k$-中心问题（作为极小极大设施选址问题的一种特例）进行领土划分。通过考虑道路网络结构和行政中心的战略布局，该方法旨在最小化出行时间差异，并确保人口行政时间负担的更均衡分布。我们展示了该方法在拉脱维亚这一具有复杂地理特征和多样化人口分布的国家背景下的应用实例。