Abstract

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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.