论文部分内容阅读
在一定顾客满意度下以绕行限制为约束条件,对城市中面向顾客车辆接送服务的基于协作的多行程车辆路径问题进行研究.对于不协作时需要单独接送的孤立顾客点,基本车辆和协作车辆考虑在某个合适的位置进行协作将孤立顾客点上的顾客从协作车辆上换乘到基本车辆上送到目的地,从而提出了一种基于协作的三阶段启发式算法.最后,以航空票务公司机场接送服务为应用案例进行仿真分析,仿真结果表明提出的启发式算法是可行和有效的,可以为实际的车辆安排提供较好的调度方案.
Under the circumstance of certain customer satisfaction, the bypass constraint is used to study the problem of cooperative multi-trip vehicle routing in the city for customer vehicle transfer.For isolated customer points, basic vehicles and collaboration Vehicles consider collaborating in a suitable location to transfer customers from isolated customer points to a basic vehicle from a coordinated vehicle and send them to a destination, so as to propose a three-phase collaboration-based heuristic algorithm.Finally, The airport shuttle service of ticketing company simulates and analyzes the application cases. The simulation results show that the proposed heuristic algorithm is feasible and effective and can provide a better scheduling solution for the actual vehicle arrangement.