IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v40y2006i10p903-916.html
   My bibliography  Save this article

Evaluating the assumption of independent turning probabilities

Author

Listed:
  • Bar-Gera, Hillel
  • Mirchandani, Pitu B.
  • Wu, Fan

Abstract

Several urban traffic models make the convenient assumption that turning probabilities are independent, meaning that the probability of turning right (or left or going straight through) at the downstream intersection is the same for all travelers on that roadway, regardless of their origin or destination. In reality most travelers make turns according to planned routes from origins to destinations. The research reported here identifies and quantifies the deviations that result from this assumption of independent turning probabilities. An analysis of this type requires a set of reasonably realistic "original" route flows, which were obtained by a static user-equilibrium traffic assignment and an entropy maximization condition for most likely route flows. These flows are compared with those route flows resulting from the Assumption of Independent Turning Probabilities (ITP). A small subnetwork of 3Â km by 5Â km in Tucson, Arizona, was chosen as a case study. An overall "typical ratio" of 2.2 between original route flows and ITP route flows was obtained. Aggregating route flows to origin-destination flows led to an overall "typical ratio" of 1.7. Such deviations are particularly high for routes that go back-and-forth, reaching a ratio of more than 3 in certain time periods. Substantial deviations for origins and destinations that are on the same border of the subnetwork are also observed in the analyses. In addition, under the ITP assumption, morning rush hour traffic peaking is the same in all directions, while in the original flows some directions do not exhibit a peak in the morning rush hour period. Overall, the conclusion of the paper is that the assumption of independent turning probabilities leads to substantial deviations both at the route level and at the origin-destination level, even for such a small network of the case study. These deviations are particularly detrimental when a network is being modeled and studied for route-based measures of effectiveness such as the number and types of routes passing a point - for monitoring specified vehicles and/or managing detouring strategies.

Suggested Citation

  • Bar-Gera, Hillel & Mirchandani, Pitu B. & Wu, Fan, 2006. "Evaluating the assumption of independent turning probabilities," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 903-916, December.
    • Handle: RePEc:eee:transb:v:40:y:2006:i:10:p:903-916
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(06)00016-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chang, Tang-Hsien & Sun, Guey-Yin, 2004. "Modeling and optimization of an oversaturated signalized network," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 687-707, September.
    2. Yang, Hai & Zhou, Jing, 1998. "Optimal traffic counting locations for origin-destination matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 109-126, February.
    3. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    4. Oded Berman & Dmitry Krass & Chen Wei Xu, 1995. "Locating Discretionary Service Facilities Based on Probabilistic Customer Flows," Transportation Science, INFORMS, vol. 29(3), pages 276-290, August.
    5. Bell, Michael G. H., 1991. "The real time estimation of origin-destination flows in the presence of platoon dispersion," Transportation Research Part B: Methodological, Elsevier, vol. 25(2-3), pages 115-125.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thomas, Tom & Tutert, Bas, 2015. "Route choice behavior in a radial structured urban network: Do people choose the orbital or the route through the city center?," Journal of Transport Geography, Elsevier, vol. 48(C), pages 85-95.
    2. Jaap Vreeswijk & Tom Thomas & Eric Berkum & Bart Arem, 2014. "Perception bias in route choice," Transportation, Springer, vol. 41(6), pages 1305-1321, November.
    3. Papinski, Dominik & Scott, Darren M., 2011. "A GIS-based toolkit for route choice analysis," Journal of Transport Geography, Elsevier, vol. 19(3), pages 434-442.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Castillo, Enrique & Menéndez, José María & Jiménez, Pilar, 2008. "Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 455-481, June.
    2. Lucio Bianco & Giuseppe Confessore & Monica Gentili, 2006. "Combinatorial aspects of the sensor location problem," Annals of Operations Research, Springer, vol. 144(1), pages 201-234, April.
    3. Lucio Bianco & Giuseppe Confessore & Pierfrancesco Reverberi, 2001. "A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates," Transportation Science, INFORMS, vol. 35(1), pages 50-60, February.
    4. Huo, Jinbiao & Liu, Chengqi & Chen, Jingxu & Meng, Qiang & Wang, Jian & Liu, Zhiyuan, 2023. "Simulation-based dynamic origin–destination matrix estimation on freeways: A Bayesian optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    5. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    6. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    7. Jaller, Miguel & Pahwa, Anmol & Zhang, Michael, 2021. "Cargo Routing and Disadvantaged Communities," Institute of Transportation Studies, Working Paper Series qt9qg2318x, Institute of Transportation Studies, UC Davis.
    8. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    9. Bogyrbayeva, Aigerim & Kwon, Changhyun, 2021. "Pessimistic evasive flow capturing problems," European Journal of Operational Research, Elsevier, vol. 293(1), pages 133-148.
    10. 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.
    11. Junwoo Song & Simon Hu & Ke Han & Chaozhe Jiang, 2020. "Nonlinear Decision Rule Approach for Real-Time Traffic Signal Control for Congestion and Emission Mitigation," Networks and Spatial Economics, Springer, vol. 20(3), pages 675-702, September.
    12. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    13. Maria Mitradjieva & Per Olov Lindberg, 2013. "The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment ," Transportation Science, INFORMS, vol. 47(2), pages 280-293, May.
    14. Casello, Jeffrey M., 2007. "Transit competitiveness in polycentric metropolitan regions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(1), pages 19-40, January.
    15. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    16. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    17. Hu, Shou-Ren & Peeta, Srinivas & Chu, Chun-Hsiao, 2009. "Identification of vehicle sensor locations for link-based network traffic applications," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 873-894, September.
    18. Shao, Hu & Lam, William H.K. & Sumalee, Agachai & Chen, Anthony & Hazelton, Martin L., 2014. "Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 52-75.
    19. Bagloee, Saeed Asadi & Sarvi, Majid & Wolshon, Brian & Dixit, Vinayak, 2017. "Identifying critical disruption scenarios and a global robustness index tailored to real life road networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 98(C), pages 60-81.
    20. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.

    More about this item

    Statistics

    Access and download statistics

    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:40:y:2006:i:10:p:903-916. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.