Selection of a trip table which reproduces observed link flows
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:
- Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
- Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
- Bera, Sharminda & Rao, K. V. Krishna, 2011. "Estimation of origin-destination matrix from traffic counts: the state of the art," European Transport \ Trasporti Europei, ISTIEE, Institute for the Study of Transport within the European Economic Integration, issue 49, pages 2-23.
- Mojtaba Rostami Nasab & Yousef Shafahi, 2020. "Estimation of origin–destination matrices using link counts and partial path data," Transportation, Springer, vol. 47(6), pages 2923-2950, December.
- Xie, Chi & Kockelman, Kara M. & Waller, S. Travis, 2011. "A maximum entropy-least squares estimator for elastic origin–destination trip matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1465-1482.
- Nguyen, S. & Pallottino, S. & Inaudi, D., 1996. "Postoptimizing equilibrium flows on large scale networks," European Journal of Operational Research, Elsevier, vol. 91(3), pages 507-516, June.
- Yang, Hai & Bell, Michael G. H. & Meng, Qiang, 2000. "Modeling the capacity and level of service of urban transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 255-275, May.
- Yu Nie & H. Zhang, 2010. "A Relaxation Approach for Estimating Origin–Destination Trip Tables," Networks and Spatial Economics, Springer, vol. 10(1), pages 147-172, March.
- Louis Grange & Felipe González & Shlomo Bekhor, 2017. "Path Flow and Trip Matrix Estimation Using Link Flow Density," Networks and Spatial Economics, Springer, vol. 17(1), pages 173-195, March.
- Chi Xie & Jennifer Duthie, 2015. "An Excess-Demand Dynamic Traffic Assignment Approach for Inferring Origin-Destination Trip Matrices," Networks and Spatial Economics, Springer, vol. 15(4), pages 947-979, December.
- T. Abrahamsson, 1998. "Estimation of Origin-Destination Matrices Using Traffic Counts- A Literature Survey," Working Papers ir98021, International Institute for Applied Systems Analysis.
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:16:y:1982:i:2:p:83-88. 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.