File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Estimation of time-dependent origin-destination matrices for transit networks

TitleEstimation of time-dependent origin-destination matrices for transit networks
Authors
KeywordsDynamic transit assignment
Entropy maximisation
O-D matrix estimation
Schedule-based transit network
Sparse algorithm
Issue Date1998
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb
Citation
Transportation Research Part B: Methodological, 1998, v. 32 n. 1, p. 35-48 How to Cite?
AbstractIn this paper, the estimation of time-dependent origin-destination (O-D) matrices for transit network based on observed passenger counts is given. The dynamic assignment framework is based on a schedule-based transit network model, which can help determine the time-dependent least cost paths between all O-D pairs, and for each of them the clock arrival times at the end nodes of all observed links (if any) in the transit network. An entropy-based approach is then employed to estimate the time-dependent O-D matrices based on the observed passenger counts at those observed links in the network. An efficient sparse algorithm is also proposed to solve the resulting mathematical programming problem. The estimation methodology is tested in a transit network from the Mass Transit Railway (MTR) system in Hong Kong which is one of the busiest railway systems in the world. Both cases with and without prior information of the O-D matrices are considered for this network. The predicted matrices are then compared with the true matrices obtained from a sophisticated electronic fare collection system of MTR. Good agreement between predicted and observed matrices are found. © 1998 Elsevier Science Ltd.
Persistent Identifierhttp://hdl.handle.net/10722/70546
ISSN
2015 Impact Factor: 3.769
2015 SCImago Journal Rankings: 3.905
References

 

DC FieldValueLanguage
dc.contributor.authorWong, SCen_HK
dc.contributor.authorTong, COen_HK
dc.date.accessioned2010-09-06T06:23:57Z-
dc.date.available2010-09-06T06:23:57Z-
dc.date.issued1998en_HK
dc.identifier.citationTransportation Research Part B: Methodological, 1998, v. 32 n. 1, p. 35-48en_HK
dc.identifier.issn0191-2615en_HK
dc.identifier.urihttp://hdl.handle.net/10722/70546-
dc.description.abstractIn this paper, the estimation of time-dependent origin-destination (O-D) matrices for transit network based on observed passenger counts is given. The dynamic assignment framework is based on a schedule-based transit network model, which can help determine the time-dependent least cost paths between all O-D pairs, and for each of them the clock arrival times at the end nodes of all observed links (if any) in the transit network. An entropy-based approach is then employed to estimate the time-dependent O-D matrices based on the observed passenger counts at those observed links in the network. An efficient sparse algorithm is also proposed to solve the resulting mathematical programming problem. The estimation methodology is tested in a transit network from the Mass Transit Railway (MTR) system in Hong Kong which is one of the busiest railway systems in the world. Both cases with and without prior information of the O-D matrices are considered for this network. The predicted matrices are then compared with the true matrices obtained from a sophisticated electronic fare collection system of MTR. Good agreement between predicted and observed matrices are found. © 1998 Elsevier Science Ltd.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.subjectDynamic transit assignmenten_HK
dc.subjectEntropy maximisationen_HK
dc.subjectO-D matrix estimationen_HK
dc.subjectSchedule-based transit networken_HK
dc.subjectSparse algorithmen_HK
dc.titleEstimation of time-dependent origin-destination matrices for transit networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0191-2615&volume=32&spage=35&epage=48&date=1998&atitle=Estimation+of+time-dependent+origin-destination+matrices+for+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(97)00011-8-
dc.identifier.scopuseid_2-s2.0-0031594057en_HK
dc.identifier.hkuros29668en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0031594057&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume32en_HK
dc.identifier.issue1en_HK
dc.identifier.spage35en_HK
dc.identifier.epage48en_HK
dc.publisher.placeUnited Kingdomen_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