Abstract: This paper develops a method for scheduling bus runs on a single route so as to minimize the total waiting time for patrons. The demand for bus travel is assumed to be time-dependent with a given origin-destination pattern. The problem is formulated as a mathematical program subject to bus capacity and possible other (e.g., service standards) constraints. A dynamic programming procedure is suggested for the solution of this program. Finally, some issues associated with optimization of the schedule under stochastic demand are explored as well. (Author)
Publication Year: 1982
Publication Date: 1982-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 11
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot