File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0191-2615(97)00011-8
- Scopus: eid_2-s2.0-0031594057
- WOS: WOS:A1998YK09600003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Estimation of time-dependent origin-destination matrices for transit networks
Title | Estimation of time-dependent origin-destination matrices for transit networks |
---|---|
Authors | |
Keywords | Dynamic transit assignment Entropy maximisation O-D matrix estimation Schedule-based transit network Sparse algorithm |
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. 32 n. 1, p. 35-48 How to Cite? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/70546 |
ISSN | 2023 Impact Factor: 5.8 2023 SCImago Journal Rankings: 2.660 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, SC | en_HK |
dc.contributor.author | Tong, CO | en_HK |
dc.date.accessioned | 2010-09-06T06:23:57Z | - |
dc.date.available | 2010-09-06T06:23:57Z | - |
dc.date.issued | 1998 | en_HK |
dc.identifier.citation | Transportation Research Part B: Methodological, 1998, v. 32 n. 1, p. 35-48 | en_HK |
dc.identifier.issn | 0191-2615 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/70546 | - |
dc.description.abstract | In 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.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 transit assignment | en_HK |
dc.subject | Entropy maximisation | en_HK |
dc.subject | O-D matrix estimation | en_HK |
dc.subject | Schedule-based transit network | en_HK |
dc.subject | Sparse algorithm | en_HK |
dc.title | Estimation of time-dependent origin-destination matrices for transit networks | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+networks | en_HK |
dc.identifier.email | Wong, SC:hhecwsc@hku.hk | en_HK |
dc.identifier.email | Tong, CO:cotong@hku.hk | en_HK |
dc.identifier.authority | Wong, SC=rp00191 | en_HK |
dc.identifier.authority | Tong, CO=rp00178 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/S0191-2615(97)00011-8 | - |
dc.identifier.scopus | eid_2-s2.0-0031594057 | en_HK |
dc.identifier.hkuros | 29668 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0031594057&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 32 | en_HK |
dc.identifier.issue | 1 | en_HK |
dc.identifier.spage | 35 | en_HK |
dc.identifier.epage | 48 | en_HK |
dc.identifier.isi | WOS:A1998YK09600003 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Wong, SC=24323361400 | en_HK |
dc.identifier.scopusauthorid | Tong, CO=7202715087 | en_HK |
dc.identifier.issnl | 0191-2615 | - |