通过最大限度地提高出行兼容性的校车路线
School bus routing by maximizing trip compatibility
摘要：
校车规划问题通常分为路线规划和调度问题，这两个问题的并行求解比较复杂。然而，这两个步骤之间的分离可能会导致更差的解决方案，总成本高于一起解决它们。在求解路径选择问题中的最小行程数时，忽略行程相容性的重要性可能会增加调度问题中实际需要的公交车数量。本文提出了一种新的多学校同质车队路径问题，最大限度地提高行程兼容性，同时最小化总行程时间。这将行程相容性的调度问题中的路由问题。由于这个问题本质上只是一个路由问题，所以找到一个好的解决方案并不麻烦。为了将该模型的性能与传统的路由问题进行比较，我们生成了八个中等大小的数据集。通过将路径选择问题产生的出行量引入到公交车调度（阻塞）问题中，结果表明，该模型比传统路径选择模型使用的公交车数量减少了13%。
英文摘要：
School bus planning is usually divided into routing and scheduling due to the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than that from solving them together. When finding the minimal number of trips in the routing problem, neglecting the importance of trip compatibility may increase the number of buses actually needed in the scheduling problem. This paper proposes a new formulation for the multi-school homogeneous fleet routing problem that maximizes trip compatibility while minimizing total travel time. This incorporates the trip compatibility for the scheduling problem in the routing problem. Since the problem is inherently just a routing problem, finding a good solution is not cumbersome. To compare the performance of the model with traditional routing problems, we generate eight mid-size data sets. Through importing the generated trips of the routing problems into the bus scheduling (blocking) problem, it is shown that the proposed model uses up to 13% fewer buses than the common traditional routing models.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
