Skip to Main Content
The vehicle scheduling problem (VSP) consists in assigning a set of scheduled trips to a set of vehicles in the public transportation, where the relation of every trip is not only cooperation but also competition. This paper analyzes two sorts of optimization models for vehicle scheduling problem in public transportation. The problems of minimizing vehicles' time headway for cooperation network and maximizing the value for competition network are formulated in this presented paper. Also, the departure interval model is presented. The above models are solved by the heuristic algorithms in the presented paper respectively, and the numerical results show that the solutions are more efficient.