File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0191-2615(98)00030-7
- Scopus: eid_2-s2.0-0033078951
- WOS: WOS:000077582400002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A stochastic transit assignment model using a dynamic schedule-based network
Title | A stochastic transit assignment model using a dynamic schedule-based network |
---|---|
Authors | |
Keywords | Dynamic Schedule-based Stochastic Transit assignment |
Issue Date | 1998 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb |
Citation | Transportation Research, Part B: Methodological, 1998, v. 33 n. 2, p. 107-121 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/71326 |
ISSN | 2023 Impact Factor: 5.8 2023 SCImago Journal Rankings: 2.660 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tong, CO | en_HK |
dc.contributor.author | Wong, SC | en_HK |
dc.date.accessioned | 2010-09-06T06:30:59Z | - |
dc.date.available | 2010-09-06T06:30:59Z | - |
dc.date.issued | 1998 | en_HK |
dc.identifier.citation | Transportation Research, Part B: Methodological, 1998, v. 33 n. 2, p. 107-121 | en_HK |
dc.identifier.issn | 0191-2615 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71326 | - |
dc.description.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. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb | en_HK |
dc.relation.ispartof | Transportation Research, Part B: Methodological | en_HK |
dc.subject | Dynamic | en_HK |
dc.subject | Schedule-based | en_HK |
dc.subject | Stochastic | en_HK |
dc.subject | Transit assignment | en_HK |
dc.title | A stochastic transit assignment model using a dynamic schedule-based network | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0191-2615&volume=33B&spage=107 &epage= 121&date=1999&atitle=A+stochastic+transit+assignment+model+using+a+dynamic+schedule-based+network | en_HK |
dc.identifier.email | Tong, CO:cotong@hku.hk | en_HK |
dc.identifier.email | Wong, SC:hhecwsc@hku.hk | en_HK |
dc.identifier.authority | Tong, CO=rp00178 | en_HK |
dc.identifier.authority | Wong, SC=rp00191 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/S0191-2615(98)00030-7 | - |
dc.identifier.scopus | eid_2-s2.0-0033078951 | en_HK |
dc.identifier.hkuros | 39929 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0033078951&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 33 | en_HK |
dc.identifier.issue | 2 | en_HK |
dc.identifier.spage | 107 | en_HK |
dc.identifier.epage | 121 | en_HK |
dc.identifier.isi | WOS:000077582400002 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Tong, CO=7202715087 | en_HK |
dc.identifier.scopusauthorid | Wong, SC=24323361400 | en_HK |
dc.identifier.issnl | 0191-2615 | - |