论文标题
模块化排和途中转移的拨号问题
Dial-a-ride problem with modular platooning and en-route transfers
论文作者
论文摘要
模块化车辆（MV）具有彼此物理连接/断开连接的能力，并以减少能源消耗的方式进行排队。具有此类技术的需求响应式运输车队可以向门到门，或者让车辆相互偏离排，以较低的成本行驶，并允许在分裂之前进行乘客的乘客接送服务。配制了混合整数线性编程（MILP）模型来解决此“模块化拨号问题”（MDARP）。开发了一种基于Steiner-Tree风格的大型邻里搜索的启发式算法，以解决MDARP的实用场景。测试了一组小规模的合成数值实验，以评估MDARP精确解决方案之间使用商业软件和提议的启发式术之间的最佳差距和计算时间。大规模实验是在Anaheim网络上进行的，该网络具有378个候选/拆分节点，以进一步探索电势并确定MV的理想操作场景。结果表明，MV技术可以节省多达52.0％的车辆旅行成本，35.6％的乘客服务时间和29.4％的总成本，而在测试的情况下，对于现有的按需移动服务。结果表明，通过将“飞地对”作为轮毂和辐条服务，MVS最佳受益。
Modular vehicles (MV) possess the ability to physically connect/disconnect with each other and travel in platoon with less energy consumption. A fleet of demand-responsive transit vehicles with such technology can serve passengers door to door or have vehicles deviate to platoon with each other to travel at lower cost and allow for en-route passenger transfers before splitting. A mixed integer linear programming (MILP) model is formulated to solve this "modular dial-a-ride problem" (MDARP). A heuristic algorithm based on Steiner-tree-inspired large neighborhood search is developed to solve the MDARP for practical scenarios. A set of small-scale synthetic numerical experiments are tested to evaluate the optimality gap and computation time between exact solutions of the MDARP using commercial software and the proposed heuristic. Large-scale experiments are conducted on the Anaheim network with 378 candidate join/split nodes to further explore the potentials and identify the ideal operation scenarios of MVs. The results show that MV technology can save up to 52.0% in vehicle travel cost, 35.6% in passenger service time, and 29.4% in total cost against existing on-demand mobility services in the scenarios tested. Results suggest that MVs best benefit from platooning by serving "enclave pairs" as a hub-and-spoke service.
