File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A dynamic schedule-based model for congested transit networks

TitleA dynamic schedule-based model for congested transit networks
Authors
KeywordsCapacity restraint
Dynamic assignment
Schedule-based
Transit network
Issue Date2004
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb
Citation
Transportation Research Part B: Methodological, 2004, v. 38 n. 4, p. 343-368 How to Cite?
AbstractIn this paper we propose a model and algorithm for solving the equilibrium assignment problem in a congested, dynamic and schedule-based transit network. We assume that the time varying origin-destination trip demand is given. All travelers have full predictive information (that have been gained through past experience) about present and future network conditions and select paths that minimize a generalized cost function that encompasses four components: (a) in-vehicle time; (b) waiting time; (c) walking time; and (d) a line change penalty. All transit vehicles have a fixed capacity and operate precisely as specified in pre-set timetables. Passengers queue at platforms according to the single channel first-in-first-out discipline. By using time-increment simulation, the passenger demand is loaded onto the network and the available capacity of each vehicle is updated dynamically. After each simulation run, the passenger arrival and departure profiles at all stations are recorded and these are used to predict dynamic queuing delays. From such delays, minimum paths are updated and used for the next simulation run. The user equilibrium assignment problem is solved iteratively by the method of successive averages. © 2003 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/70663
ISSN
2015 Impact Factor: 3.769
2015 SCImago Journal Rankings: 3.905
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorPoon, MHen_HK
dc.contributor.authorWong, SCen_HK
dc.contributor.authorTong, COen_HK
dc.date.accessioned2010-09-06T06:24:59Z-
dc.date.available2010-09-06T06:24:59Z-
dc.date.issued2004en_HK
dc.identifier.citationTransportation Research Part B: Methodological, 2004, v. 38 n. 4, p. 343-368en_HK
dc.identifier.issn0191-2615en_HK
dc.identifier.urihttp://hdl.handle.net/10722/70663-
dc.description.abstractIn this paper we propose a model and algorithm for solving the equilibrium assignment problem in a congested, dynamic and schedule-based transit network. We assume that the time varying origin-destination trip demand is given. All travelers have full predictive information (that have been gained through past experience) about present and future network conditions and select paths that minimize a generalized cost function that encompasses four components: (a) in-vehicle time; (b) waiting time; (c) walking time; and (d) a line change penalty. All transit vehicles have a fixed capacity and operate precisely as specified in pre-set timetables. Passengers queue at platforms according to the single channel first-in-first-out discipline. By using time-increment simulation, the passenger demand is loaded onto the network and the available capacity of each vehicle is updated dynamically. After each simulation run, the passenger arrival and departure profiles at all stations are recorded and these are used to predict dynamic queuing delays. From such delays, minimum paths are updated and used for the next simulation run. The user equilibrium assignment problem is solved iteratively by the method of successive averages. © 2003 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trben_HK
dc.relation.ispartofTransportation Research Part B: Methodologicalen_HK
dc.subjectCapacity restrainten_HK
dc.subjectDynamic assignmenten_HK
dc.subjectSchedule-baseden_HK
dc.subjectTransit networken_HK
dc.titleA dynamic schedule-based model for congested transit networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0191-2615&volume=38&spage=343&epage=368&date=2004&atitle=A+dynamic+schedule-based+model+for+congested+transit+networksen_HK
dc.identifier.emailWong, SC:hhecwsc@hku.hken_HK
dc.identifier.emailTong, CO:cotong@hku.hken_HK
dc.identifier.authorityWong, SC=rp00191en_HK
dc.identifier.authorityTong, CO=rp00178en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0191-2615(03)00026-2en_HK
dc.identifier.scopuseid_2-s2.0-1542677582en_HK
dc.identifier.hkuros85675en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1542677582&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume38en_HK
dc.identifier.issue4en_HK
dc.identifier.spage343en_HK
dc.identifier.epage368en_HK
dc.identifier.isiWOS:000220153900004-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridPoon, MH=7103089888en_HK
dc.identifier.scopusauthoridWong, SC=24323361400en_HK
dc.identifier.scopusauthoridTong, CO=7202715087en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats