A STOCHASTIC TRANSIT ASSIGNMENT MODEL USING A DYNAMIC SCHEDULE-BASED NETWORK

Document Type

Journal Article

Publication Date

1999

Subject Area

operations - scheduling, ridership - commuting, ridership - demand, mode - rail

Keywords

Travel models (Travel demand), Travel demand, Timetables, Stochastic processes, Scheduling, Random processes, Railways, Railroads, Passenger demand, Headways, Algorithms

Abstract

Using the schedule-based approach, in which scheduled time-tables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost which consists of four components: in-vehicle time; waiting time; walking time; and a time penalty for each line change. With the exception of in-vehicle time, each of the other cost components is weighted by a sensitivity coefficient which varies among travelers and is defined by a density function. This time-dependent and stochastic minimum path is generated by a specially developed branch and bound algorithm. The assignment procedure is conducted over a period in which both passenger demand and train headways are varying. Due to the stochastic nature of the assignment problem, a Monte Carlo approach is employed to solve the problem. A case study using the Mass Transit Railway System in Hong Kong is given to demonstrate the model and its potential applications.

Comments

http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V99-3V92K47-2&_user=542840&_coverDate=04%2F30%2F1998&_rdoc=2&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235893%231998%23999669997%2339140%23FLA%23display%23Volume)&_cdi=5893&_sort=d&_docanchor=&_ct=4&_acct=C000027659&_version=1&_urlVersion=0&_userid=542840&md5=d623a238e0afc547b0d7fc6cc03dd862

Link to Full Text

Share

COinS