集中通勤接送服务的车辆路径与调度模型及算法

Model and Algorithm for Vehicle Routing and Scheduling of Centralized Commute

基于最优化理论与方法,对集中通勤接送服务的车辆路径与调度问题进行了研究,以节约运营成本、提高服务质量。由于该优化问题与传统的车辆路径规划有所不同,具有多目标抵达地、多车协作和多行程车次的特征事实,现有的模型与算法不能直接应用于该问题的求解。首次建立了集中通勤接送服务模式下以最小化运营成本为目标的车辆路径与调度问题的0-1整数规划模型,并开发了一种基于特征点的启发式算法求解该模型。在实证研究中,实验结果表明本文所设计的模型和算法是可行的、有效的。

Based on the optimization theory and method,the vehicle routing and scheduling problem of centralized commuter service is studied so as to save the operation cost and improve the service quality.Since this problem has the characteristics of multi-target arrival,multi vehicle cooperation and multiple trips,it is different from the traditional VRP.The existing models and algorithms cannot be applied to solve the problem directly.The 0-1 mixed integer programming models aiming at minimizing operation costs in the centralized commute service is established,and a heuristic algorithm based on Eigen point is given to solve the model.In the empirical research,the numerical results show that the model and algorithm proposed is effective and feasible.