网格上的覆盖路径问题
The Covering Path Problem on a Grid
摘要:
本文介绍了网格上的覆盖路径问题(CPPG),它找到连接网格中的一个点子集的成本最小化路径,使得每个需要覆盖的点都在预定的距离内。我们利用网格图的几何特性,它捕获了许多运输问题中的道路网络结构,包括我们的校车路线的激励设置。在本文中,CPPG是一个双目标最优化问题,包括一个成本项的路径长度和一个成本项的停止计数有关。我们开发了一个权衡约束,量化的路径长度和停止计数之间的权衡,并提供了一个下界的双目标最优化问题。我们引入简单的建设技术,以提供可行的路径匹配的下界内一个常数的因素。重要的是,该解决方案方法使用基于覆盖半径的值的一般CPPG到离散CPPG或连续CPPG的变换。对于离散和连续的版本,我们提供了快速的常数因子近似,从而解决了一般的CPPG。
英文摘要:
This paper introduces the covering path problem on a grid (CPPG) which finds the cost-minimizing path connecting a subset of points in a grid such that each point that needs to be covered is within a predetermined distance of a point from the chosen subset. We leverage the geometric properties of the grid graph which captures the road network structure in many transportation problems, including our motivating setting of school bus routing. As defined in this paper, the CPPG is a bi-objective optimization problem comprised of one cost term related to path length and one cost term related to stop count. We develop a trade-off constraint which quantifies the trade-off between path length and stop count and provides a lower bound for the bi-objective optimization problem. We introduce simple construction techniques to provide feasible paths that match the lower bound within a constant factor. Importantly, this solution approach uses transformations of the general CPPG to either a discrete CPPG or continuous CPPG based on the value of the coverage radius. For both the discrete and continuous versions, we provide fast constant-factor approximations, thus solving the general CPPG.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。