TRB Pubsindex
Text Size:

Title:

OPTIMAL BUS SCHEDULING ON A SINGLE ROUTE

Accession Number:

00373400

Record Type:

Component

Availability:

Find a library where document is available


Order URL: http://worldcat.org/isbn/0309035074

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)

Supplemental Notes:

Publication of this paper sponsored by Committee on Passenger Travel Demand Forecasting. Distribution, posting, or copying of this PDF is strictly prohibited without written permission of the Transportation Research Board of the National Academy of Sciences. Unless otherwise indicated, all materials in this PDF are copyrighted by the National Academy of Sciences. Copyright © National Academy of Sciences. All rights reserved

Monograph Accession #:

00380952

Report/Paper Numbers:

HS-035 375

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Sheffi, Yosef
Sugiyama, Morihisa

Editors:

Singer-Bart, Susan

Pagination:

pp 46-52

Publication Date:

1982

Serial:

Transportation Research Record

Issue Number: 895
Publisher: Transportation Research Board
ISSN: 0361-1981

ISBN:

0309035074

Media Type:

Print

Features:

Figures (1) ; References (11)

Old TRIS Terms:

Subject Areas:

Data and Information Technology; Highways; Operations and Traffic Management; Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning

Files:

HSL, TRIS, TRB

Created Date:

Jun 30 1984 12:00AM

More Articles from this Serial Issue: