Two-way Vehicle Scheduling Approach in Public Transit Based on Tabu Search and Dynamic Programming Algorithm

Abstract

We provide an approach for solving two-way public transportation scheduling, which mainly uses tabu search algorithm and dynamic programming algorithm for vehicle scheduling. Establish a model with the goal of minimizing the number of vehicles and the number of drivers and fully consider the restrictions of drivers' rest time (dwell time), the maximum task volume of vehicles, whether they are dead heading, whether they are synchronization, etc. On the basis of significant savings in operating costs, improve the driver's work efficiency and ensure the driver's rest time (dwell time), thereby providing a guarantee for safe and efficient vehicle operation. We also applied the method to the lines of zheng zhou bus communication corporation, and the results showed that our plan was effective and efficient.