优化行政区划:基于边加权道路图的顶点 $k$-中心方法
Optimizing Administrative Divisions: A Vertex $k$-Center Approach for Edge-Weighted Road Graphs
AI总结:
本文提出一种基于边加权道路图Voronoi划分和顶点$k$-中心问题的数据驱动方法,以优化行政区划,最小化出行时间差异并均衡行政负担,并在拉脱维亚验证。
摘要:
高效且公平地获取市政服务依赖于设计良好的行政区划。这需要不断适应人口结构、基础设施和经济因素的变化。本文提出了一种新颖的、透明的、数据驱动的领土划分方法,该方法基于边加权道路图的Voronoi划分,并将顶点 $k$-中心问题作为极小极大设施选址问题的一个特例。通过考虑道路网络结构和行政中心的战略布局,该方法旨在最小化出行时间差异,并确保人口行政时间负担的更加均衡分配。我们展示了该方法在拉脱维亚的实施情况,该国具有复杂的地理特征和多样化的人口分布。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。