A DP-TABU algorithm is proposed which can effectively solve the multi-line scheduling problem of single Deport (SD-ML-VSP). The multi-line regional coordinated dispatch of the single-line deport of the bus is to solve the problems of idle low-peak vehicles and insufficient peak capacity in single-line scheduling. The capacity of multiple lines at the same station is adjusted to realize resource sharing such as timetables, vehicles, and drivers. Shared capacity such as bus departure intervals and bus schedules. Taking the regional scheduling of multiple lines at the same station as the service object, a vehicle operation planning model based on the objective of optimal public transportation resources (minimum bus and driver costs) is established to optimize the vehicle dispatching mode of multiple lines. We applied this algorithm to the three lines S105, S107, and S159 of Zhengzhou Public Transport Corporation, and the results proved that the algorithm is effective. Through comparison with manual scheduling and simulated annealing algorithm, the advantages of DP-TABU algorithm in performance optimization and robustness are further verified.

提出了一种DP-TABU算法，可以有效解决单个Deport的多线调度问题(SD-ML-VSP)。公交单线驱逐的多线区域协调调度，是为了解决单线调度中低峰车辆闲置、高峰容量不足的问题。调整同站多条线路容量，实现时刻表、车辆、司机等资源共享。共享容量，例如巴士发车间隔和巴士时刻表。以同站多条线路的区域调度为服务对象，建立以公交资源最优（公交和司机成本最低）为目标的车辆运营规划模型，优化多条线路的车辆调度模式。将该算法应用于郑州市公交公司S105、S107、S159 3条线路，结果证明该算法是有效的。通过与人工调度和模拟退火算法的对比，进一步验证了DP-TABU算法在性能优化和鲁棒性方面的优势。