By Topic

Optimization Model for the Vehicle Scheduling Problem in Public Transportation Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bingqiang Situ ; Sch. of Civil Eng. & Transp., South China Univ. of Technol., Guangzhou, China ; Wenzhou Jin

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.

Published in:

Management and Service Science, 2009. MASS '09. International Conference on

Date of Conference:

20-22 Sept. 2009