Abstract

The demand-responsive public transport system with multi-vehicles has the potential to efficiently meet real-time and high-volume transportation needs through effective scheduling. This paper focuses on studying the real-time vehicle scheduling problem, which involves dispatching and controlling different model vehicles uniformly based on generated vehicle number tasks at a given point in time. By considering the immediacy of real-time itinerary tasks, this paper optimizes the vehicle scheduling problem at a single time point. The objective function is to minimize the total operating cost of the system while satisfying constraints such as passenger capacity and vehicle transfer time. To achieve this, a vehicle scheduling optimization model is constructed, and a solution approach is proposed by integrating bipartite graph optimal matching theory and the Kuhn–Munkres algorithm. The effectiveness of the proposed approach is demonstrated by comparing it with a traditional greedy algorithm using the same calculation example. The results show that the optimization method has higher solution efficiency and can generate a scheduling scheme that effectively reduces operating costs, improves transportation efficiency, and optimizes the operation organization process for demand-responsive buses.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call