arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.13468math.OCphysics.soc-ph
收藏

基于共享网络的大规模单校路由问题分解方法

Shareability Network Based Decomposition Approach for Solving Large-scale Single School Routing Problems

Xiaotong Guo, Samitha Samaranayake

摘要:

我们认为,单学校路由问题(SSRP),学生从一个单一的学校拿起一队校车,受一组约束。通常对校车施加的限制是巴士容量,学生到接送点的最大步行距离以及每个学生的最大通勤时间。这是具有共同目的地的车辆路径问题(VRP)的一个特例。我们提出了一种分解方法来解决这个问题的基础上现有的概念的共享网络,这已被用于最近的上下文中的动态拼车问题。此外,我们提出了一个简化的公式来解决SSRP之间的联系,SSRP和加权集合覆盖问题(WSCP)。为了将此方法扩展到大规模问题实例,我们提出了i)基于可共享网络的分解方法的节点压缩方法,以及ii)在实践中表现良好的基于启发式的边缘修剪技术。我们表明,压缩的问题导致一个线性规划(ILP)的降维,可以有效地解决使用现成的ILP求解器。在合成的波士顿公立学校(BPS)实例上进行了数值实验,以评估我们的方法的性能。同时,我们提出的SSRP公式允许一个自然扩张引入替代交通模式的学生,这有效地减少了每个学校所需的巴士数量,导致平均15%的成本降低。此外,两个国家的最先进的大规模SSRP解决技术相比,我们提出的方法在基准网络和我们的方法优于这两种技术在一个单一的学校设置。

英文摘要:

We consider the Single School Routing Problem (SSRP) where students from a single school are picked up by a fleet of school buses, subject to a set of constraints. The constraints that are typically imposed for school buses are bus capacity, a maximum student walking distance to a pickup point, and a maximum commute time for each student. This is a special case of the Vehicle Routing Problem (VRP) with a common destination. We propose a decomposition approach for solving this problem based on the existing notion of a shareability network, which has been used recently in the context of dynamic ridepooling problems. Moreover, we come up with a simplified formulation for solving the SSRP by introducing the connection between the SSRP and the weighted set covering problem (WSCP). To scale this method to large-scale problem instances, we propose i) a node compression method for the shareability network based decomposition approach, and ii) heuristic-based edge pruning techniques that perform well in practice. We show that the compressed problem leads to an Integer Linear Program (ILP) of reduced dimensionality that can be solved efficiently using off-the-shelf ILP solvers. Numerical experiments on the synthetic Boston Public School (BPS) instances are conducted to evaluate the performance of our approach. Meanwhile, our proposed SSRP formulation allows a natural extension for introducing alternate transportation modes to students, which effectively reduces the number of buses needed for each school and leads to a 15\% cost reduction on average. Moreover, two state-of-art large-scale SSRP solving techniques are compared with our proposed approaches on benchmark networks and our methods outperform both techniques under a single school setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑