Discrete time dynamic estimation model for passenger origin/destination matrices on transit networks
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Li, Guoyuan & Chen, Anthony, 2022. "Frequency-based path flow estimator for transit origin-destination trip matrices incorporating automatic passenger count and automatic fare collection data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
- Flurin S. Hänseler & Nicholas A. Molyneaux & Michel Bierlaire, 2017. "Estimation of Pedestrian Origin-Destination Demand in Train Stations," Transportation Science, INFORMS, vol. 51(3), pages 981-997, August.
- Hänseler, Flurin S. & Bierlaire, Michel & Scarinci, Riccardo, 2016. "Assessing the usage and level-of-service of pedestrian facilities in train stations: A Swiss case study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 89(C), pages 106-123.
- Sun, Ran & Fan, Yueyue, 2024. "Stochastic OD demand estimation using stochastic programming," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
- Blume, Steffen O.P. & Corman, Francesco & Sansavini, Giovanni, 2022. "Bayesian origin-destination estimation in networked transit systems using nodal in- and outflow counts," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 60-94.
- Wu, Jifeng, 1997. "A real-time origin-destination matrix updating algorithm for on-line applications," Transportation Research Part B: Methodological, Elsevier, vol. 31(5), pages 381-396, October.
- Felipe Zúñiga & Juan Carlos Muñoz & Ricardo Giesen, 2021. "Estimation and prediction of dynamic matrix travel on a public transport corridor using historical data and real-time information," Public Transport, Springer, vol. 13(1), pages 59-80, March.
- Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:22:y:1988:i:4:p:251-260. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.