The emerging modular vehicle (MV) technology possesses the ability to physically connect/disconnect with each other and thus travel in platoon for less energy consumption. Moreover, a platoon of MVs can be regarded as a new bus-like platform with expanded on-board carrying capacity and provide larger service throughput according to the demand density. This innovation concept might solve the mismatch problems between the fixed vehicle capacity and the temporal-spatial variations of demand in current transportation system. To obtain the optimal assignments and routes for the operation of MVs, a mixed integer linear programming (MILP) model is formulated to minimize the weighted total cost of vehicle travel cost and passenger service time. The temporal and spatial synchronization of vehicle platoons and passenger en-route transfers are determined and optimized by the MILP model while constructing the paths. Heuristic algorithms based on large neighborhood search are developed to solve the modular dial-a-ride problem (MDARP) for practical scenarios. A set of small-scale synthetic numerical experiments are tested to evaluate the optimality gap and computation time between our proposed MILP model and heuristic algorithms. 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 the innovative 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. Results suggest that MVs best benefit from platooning by serving enclave pairs as a hub-and-spoke service.
翻译:新兴的模块式车辆(MV)技术具有实际连接/分离的能力,因此可以排排地旅行,以降低能源消耗;此外,可以将一排MV车视为一个新的公共汽车式平台,扩大机载载能力,根据需求密度提供更大的服务输送量;这一创新概念可以解决固定车辆能力与当前运输系统需求的时间空间变化之间的不匹配问题;为了获得MV车运作的最佳任务和路线,将设计一个混合整型线性编程模型,以尽量减少车辆旅行费用和客运服务时间的加权总费用;车辆排和客运在路程中传输的乘客在时间和空间上的同步由MILP模型确定和优化,同时根据需求密度提供更大的服务输送量;在大型社区搜索的基础上,为实际情景开发超导力算算法,以解决模块型拨号(MDARP)需求的时间变化;为了评估拟议MILP模式和超导算法之间的最佳差距和计算时间;在35号机动车(MV)车(MV)车(MV)系统(MLP)中,将大型飞行(MV)机(MV)机(MV)机(MV)(MV)(ML)(ML)(ML)(MV)(ML)(ML)(ML)(ML)(ML)(ML)(ML)(ML)(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)(ML)(M)(M)(M)(M)(M)(ML)(M)))(M)(M)(M)(M)(M)))(M)(M)(M)(M)(M))(M))(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)))(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)(M))(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)(M)