考虑乘客偏好的共享车辆动态共乘算法研究

Dynamic Car Sharing Algorithm for Shared Vehicles Considering Passenger Preference

现有的共乘路径算法大多只专注于最少的用时与最低的成本,而缺少对乘客共乘意愿比例以及可接受绕行偏差范围的界定,针对这一现象构建了一种考虑乘客偏好的动态共乘策略模型。对乘客和车辆分别进行查找模块处理和筛选模块分类,删除掉不满足要求的车辆以减少乘客和车辆的动态实时匹配时间,然后利用插入算法获得最优路径匹配。结果表明,所提算法可以快速高效地为乘客匹配到满足要求的最优车辆。相比常规算法,考虑乘客合共乘意愿以及绕行偏差的共乘算法,乘客的平均等待时间降低了7.0%;总社会收益提高了44.7%;动态共乘匹配效率提高了34.2%。另外,改变乘客的时间窗长度也可以显著提高共乘效果。

Most of the existing shared-ride path algorithms only focus on the least time and the lowest cost, and lack the definition of the proportion of passengers’ willingness to share rides and the acceptable detour deviation range. Aiming at this phenomenon, a dynamic sharing policy model considering passenger preference was constructed. The passenger and the vehicle were respectively processed by the search module and the screening module was classified, and the vehicles that did not meet the requirements were deleted to reduce the time of dynamic real-time matching of passengers and vehicles, and then the insertion algorithm was used to obtain the optimal path matching. The results show that the proposed algorithm can quickly and efficiently match passengers to the optimal vehicle that meets the requirements. Compared with the conventional algorithm, a carpooling algorithm considering passengers’ willingness to ride together and detour deviation, the average waiting time of passengers is reduced by 7.0%, the total social benefits are increased by 44.7%, the dynamic carpool matching efficiency is increased by 34.2%. In addition, the length of the time window for passengers is changed can also significantly improve the ride sharing effect.