File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A schedule-based time-dependent trip assignment model for transit networks

TitleA schedule-based time-dependent trip assignment model for transit networks
Authors
Issue Date1999
PublisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www.advanced-transport.com
Citation
Journal Of Advanced Transportation, 1999, v. 33 n. 3, p. 371-388 How to Cite?
AbstractA schedule-based time-dependent trip assignment model for transit networks is presented. First the transit network model is formulated using the schedule-based approach, in which the vehicles are assumed to arrive punctually in accordance with a scheduled time-table. Based on a previously developed time-dependent shortest path algorithm, an all-or-nothing network loading procedure is employed to assign the passenger trips onto the network. Both the passenger demand and scheduled time-table are time-varying. This provides a versatile tool for the evaluation of the performance of transit networks subject to peak period loading. A case study using the Mass Transit Railway System in Hong Kong is given to illustrate the potential applications of the model.
Persistent Identifierhttp://hdl.handle.net/10722/150132
ISSN
2015 Impact Factor: 1.292
2015 SCImago Journal Rankings: 0.911
References

 

DC FieldValueLanguage
dc.contributor.authorTong, COen_US
dc.contributor.authorWong, SCen_US
dc.date.accessioned2012-06-26T06:01:45Z-
dc.date.available2012-06-26T06:01:45Z-
dc.date.issued1999en_US
dc.identifier.citationJournal Of Advanced Transportation, 1999, v. 33 n. 3, p. 371-388en_US
dc.identifier.issn0197-6729en_US
dc.identifier.urihttp://hdl.handle.net/10722/150132-
dc.description.abstractA schedule-based time-dependent trip assignment model for transit networks is presented. First the transit network model is formulated using the schedule-based approach, in which the vehicles are assumed to arrive punctually in accordance with a scheduled time-table. Based on a previously developed time-dependent shortest path algorithm, an all-or-nothing network loading procedure is employed to assign the passenger trips onto the network. Both the passenger demand and scheduled time-table are time-varying. This provides a versatile tool for the evaluation of the performance of transit networks subject to peak period loading. A case study using the Mass Transit Railway System in Hong Kong is given to illustrate the potential applications of the model.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www.advanced-transport.comen_US
dc.relation.ispartofJournal of Advanced Transportationen_US
dc.titleA schedule-based time-dependent trip assignment model for transit networksen_US
dc.typeArticleen_US
dc.identifier.emailTong, CO:cotong@hku.hken_US
dc.identifier.emailWong, SC:hhecwsc@hku.hken_US
dc.identifier.authorityTong, CO=rp00178en_US
dc.identifier.authorityWong, SC=rp00191en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1002/atr.5670330307-
dc.identifier.scopuseid_2-s2.0-0033185026en_US
dc.identifier.hkuros47808-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033185026&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume33en_US
dc.identifier.issue3en_US
dc.identifier.spage371en_US
dc.identifier.epage388en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridTong, CO=7202715087en_US
dc.identifier.scopusauthoridWong, SC=24323361400en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats