微交通规划中的同步中途换乘的取送问题
The pickup and delivery problem with synchronized en-route transfers for microtransit planning
摘要:
微型运输和其他灵活的运输车队服务可以通过合并转移来降低成本。然而,如果用户必须下车并在车站等待另一个皮卡,那么转移对他们来说是昂贵的。提出了一种混合整数线性规划模型(MILP),用于求解车辆同步中途换乘(PDPSET)条件下的取送问题。转移位置由模型确定,可以位于网络中的任何候选节点,而不是预先定义的静态设施。车辆之间的转移操作在严格的时间窗口内严格同步。提出了一种启发式算法来解决这个问题的一个可接受的解决方案,在一个更短的计算时间比商业软件。两组合成数值实验进行了测试:小规模的实例的基础上,一个5x5的网格网络,和不同的网络大小的大规模的实例高达250x250网格测试的可扩展性。结果表明,在微交通中增加同步途中转移可以进一步降低总成本平均10%,最大节省可以达到19.6%,在我们的小规模测试实例。启发式平均有一个最优差距小于1.5%,而有一小部分的运行时间,并可以扩展到250 × 250网格的运行时间在1分钟内。两个大规模的例子表明,超过50%的车辆路线可以进一步改善同步途中转移和车辆行驶距离的最大节省,可以达到20.37%的实例与100辆车和300个请求在200x200网络。
英文摘要:
Microtransit and other flexible transit fleet services can reduce costs by incorporating transfers. However, transfers are costly to users if they must get off a vehicle and wait at a stop for another pickup. A mixed integer linear programming model (MILP) is proposed to solve pickup and delivery problems with vehicle-synchronized en-route transfers (PDPSET). The transfer location is determined by the model and can be located at any candidate node in the network rather than a static facility defined in advance. The transfer operation is strictly synchronized between vehicles within a hard time window. A heuristic algorithm is proposed to solve the problem with an acceptable solution in a much shorter computation time than commercial software. Two sets of synthetic numerical experiments are tested: small-scale instances based on a 5x5 grid network, and large-scale instances of varying network sizes up to 250x250 grids to test scalability. The results show that adding synchronized en-route transfers in microtransit can further reduce the total cost by 10% on average and maximum savings can reach up to 19.6% in our small-scale test instances. The heuristic on average has an optimality gap less than 1.5% while having a fraction of the run time and can scale up to 250x250 grids with run times within 1 minute. Two large-scale examples demonstrate that over 50% of vehicle routes can be further improved by synchronized en-route transfers and the maximum savings in vehicle travel distance that can reach up to 20.37% for the instance with 100 vehicles and 300 requests on a 200x200 network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。