IDEAS home Printed from https://ideas.repec.org/p/cdl/itsdav/qt9ng3z8vn.html
   My bibliography  Save this paper

Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment

Author

Listed:
  • Chai, Huajun

Abstract

This dissertation aims to study effective and efficient ways for both travelers and transportation authorities to consider the actions of the other side when they make their corresponding travel or management decisions, such that certain common goals, such as mitigating congestion, reducing cost in travel expenses and improving the overall reliability of the transportation system can be achieved. A novel dynamic traffic routing (DTR) with an adaptive signal control framework is developed to utilize the fast developing wireless communication technologies that makes V2X (Vehicle To Everything) possible. The hyper-path based dynamic traffic routing method takes stochasticity of link travel time into consideration, which ensures robust and reliable routing decisions. In addition, online travel time updating is incorporated into the DTR model. The online updating presented in this dissertation uses both historical information (a priori knowledge) and new information, thanks to the V2X system, to form a posteriori knowledge about the link travel time. Various distributed traffic signal control methods are proposed and tested concurrently with the DTR model to cope with the different levels of the traffic demand. Simulation models are built to test and compare the models developed in this dissertation against the traffic routing methods and traffic signal control models in the literature. In the extensive simulation tests, the author discovers that enabling vehicle re-routing in the network can reduce the average travel time as well as reduce the average queue length at the intersections.

Suggested Citation

  • Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.
    • Handle: RePEc:cdl:itsdav:qt9ng3z8vn
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/9ng3z8vn.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Guo, Liya & Huang, Shan & Sadek, Adel W., 2013. "A novel agent-based transportation model of a university campus with application to quantifying the environmental cost of parking search," Transportation Research Part A: Policy and Practice, Elsevier, vol. 50(C), pages 86-104.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. Perl, Jossef & Daskin, Mark S., 1985. "A warehouse location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 19(5), pages 381-396, October.
    4. Boyles, Stephen D. & Tang, Shoupeng & Unnikrishnan, Avinash, 2015. "Parking search equilibrium on a network," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 390-409.
    5. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    6. Carlos F. Daganzo, 1998. "Queue Spillovers in Transportation Networks with a Route Choice," Transportation Science, INFORMS, vol. 32(1), pages 3-11, February.
    7. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    8. Bernhard Fleischmann & Stefan Gnutzmann & Elke Sandvoß, 2004. "Dynamic Vehicle Routing Based on Online Traffic Information," Transportation Science, INFORMS, vol. 38(4), pages 420-433, November.
    9. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    10. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    11. Small, Kenneth A., 1992. "Using the Revenues from Congestion Pricing," University of California Transportation Center, Working Papers qt32p9m3mm, University of California Transportation Center.
    12. Haddad, Jack & Ramezani, Mohsen & Geroliminis, Nikolas, 2013. "Cooperative traffic control of a mixed network with two urban regions and a freeway," Transportation Research Part B: Methodological, Elsevier, vol. 54(C), pages 17-36.
    13. Zhang, Ding & Nagurney, Anna, 1996. "On the local and global stability of a travel route choice adjustment process," Transportation Research Part B: Methodological, Elsevier, vol. 30(4), pages 245-262, August.
    14. Athanasios K. Ziliaskopoulos, 2000. "A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 34(1), pages 37-49, February.
    15. Marius M. Solomon & Jacques Desrosiers, 1988. "Survey Paper---Time Window Constrained Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 22(1), pages 1-13, February.
    16. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    17. Bin Ran & David E. Boyce & Larry J. LeBlanc, 1993. "A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models," Operations Research, INFORMS, vol. 41(1), pages 192-202, February.
    18. Wu, Xing, 2015. "Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 275-290.
    19. Robert B. Noland & John W. Polak, 2002. "Travel time variability: A review of theoretical and empirical issues," Transport Reviews, Taylor & Francis Journals, vol. 22(1), pages 39-54, January.
    20. Hani Mahmassani & Robert Herman, 1984. "Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials," Transportation Science, INFORMS, vol. 18(4), pages 362-384, November.
    21. Scharfstein, David S & Stein, Jeremy C, 1990. "Herd Behavior and Investment," American Economic Review, American Economic Association, vol. 80(3), pages 465-479, June.
    22. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    23. Yang, Hai & Yagar, Sam, 1995. "Traffic assignment and signal control in saturated road networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 125-139, March.
    24. Ban, Xuegang (Jeff) & Pang, Jong-Shi & Liu, Henry X. & Ma, Rui, 2012. "Continuous-time point-queue models in dynamic network loading," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 360-380.
    25. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    26. Jia Hao Wu & Michael Florian & Patrice Marcotte, 1994. "Transit Equilibrium Assignment: A Model and Solution Algorithms," Transportation Science, INFORMS, vol. 28(3), pages 193-203, August.
    27. A. de Palma & Y. Nesterov, 1997. "Optimization formulations and static equilibrium in congested transportation networks," THEMA Working Papers 97-17, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    28. Verhoef, Erik & Nijkamp, Peter & Rietveld, Piet, 1996. "Second-Best Congestion Pricing: The Case of an Untolled Alternative," Journal of Urban Economics, Elsevier, vol. 40(3), pages 279-302, November.
    29. Avinash Unnikrishnan & Steven Waller, 2009. "User Equilibrium with Recourse," Networks and Spatial Economics, Springer, vol. 9(4), pages 575-593, December.
    30. Lozano, Angélica & Storchi, Giovanni, 2002. "Shortest viable hyperpath in multimodal networks," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 853-874, December.
    31. Xing, Tao & Zhou, Xuesong, 2011. "Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1660-1679.
    32. Thompson, Russell G. & Richardson, Anthony J., 1998. "A Parking Search Model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(3), pages 159-170, April.
    33. Terry L. Friesz & Javier Luque & Roger L. Tobin & Byung-Wook Wie, 1989. "Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem," Operations Research, INFORMS, vol. 37(6), pages 893-901, December.
    34. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
    35. He, Fang & Yin, Yafeng & Chen, Zhibin & Zhou, Jing, 2015. "Pricing of parking games with atomic players," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 1-12.
    36. Zhang, Xiaoning & Yang, Hai, 2004. "The optimal cordon-based network congestion pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 517-537, July.
    37. Eric Bonabeau & Florian Henaux & Sylvain Gu'erin & Dominique Snyers & Pascale Kuntz & Guy Theraulaz, 1998. "Routing in Telecommunications Networks with ``Smart'' Ant-Like Agents," Working Papers 98-01-003, Santa Fe Institute.
    38. David E. Boyce & Hani S. Mahmassani & Anna Nagurney, 2005. "A retrospective on Beckmann, McGuire and Winsten's Studies in the Economics of Transportation," Papers in Regional Science, Wiley Blackwell, vol. 84(1), pages 85-103, March.
    39. Wen-yi Zhang & Wei Guan & Ji-hui Ma & Jun-fang Tian, 2015. "A Nonlinear Pairwise Swapping Dynamics to Model the Selfish Rerouting Evolutionary Game," Networks and Spatial Economics, Springer, vol. 15(4), pages 1075-1092, December.
    40. Fu, Liping, 2001. "An adaptive routing algorithm for in-vehicle route guidance systems with real-time information," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 749-765, September.
    41. Yu, Hao & Ma, Rui & Zhang, H. Michael, 2018. "Optimal traffic signal control under dynamic user equilibrium and link constraints in a general network," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 302-325.
    42. Daganzo, Carlos F., 2007. "Urban gridlock: Macroscopic modeling and mitigation approaches," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 49-62, January.
    43. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
    44. Small, Kenneth A., 2001. "Using the Revenues from Congestion Pricing," University of California Transportation Center, Working Papers qt7170x9b0, University of California Transportation Center.
    45. B J Waterson & N B Hounsell & K Chatterjee, 2001. "Quantifying the potential savings in travel time resulting from parking guidance systems — a simulation case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1067-1077, October.
    46. Horowitz, Joel L., 1984. "The stability of stochastic equilibrium in a two-link transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 18(1), pages 13-28, February.
    47. Michael J. Smith, 1984. "The Stability of a Dynamic Model of Traffic Assignment---An Application of a Method of Lyapunov," Transportation Science, INFORMS, vol. 18(3), pages 245-252, August.
    48. Abhijit V. Banerjee, 1992. "A Simple Model of Herd Behavior," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 107(3), pages 797-817.
    49. Y. W. Xu & J. H. Wu & M. Florian & P. Marcotte & D. L. Zhu, 1999. "Advances in the Continuous Dynamic Network Loading Problem," Transportation Science, INFORMS, vol. 33(4), pages 341-353, November.
    50. Li, Qianfei & (Will) Chen, Peng & (Marco) Nie, Yu, 2015. "Finding optimal hyperpaths in large transit networks with realistic headway distributions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 98-108.
    51. Sang Nguyen & Stefano Pallottino & Michel Gendreau, 1998. "Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks," Transportation Science, INFORMS, vol. 32(1), pages 54-64, February.
    Full references (including those not matched with items on IDEAS)

    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. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    2. Kumar, Amit & Peeta, Srinivas, 2015. "A day-to-day dynamical model for the evolution of path flows under disequilibrium of traffic networks with fixed demand," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 235-256.
    3. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.
    4. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun & Gao, Ziyou, 2015. "An intersection-movement-based stochastic dynamic user optimal route choice model for assessing network performance," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 182-217.
    5. Yang, Lixing & Zhou, Xuesong, 2014. "Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 22-44.
    6. Long, Jiancheng & Szeto, W.Y. & Du, Jie & Wong, R.C.P., 2017. "A dynamic taxi traffic assignment model: A two-level continuum transportation system approach," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 222-254.
    7. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    8. Long, Jiancheng & Szeto, W.Y. & Gao, Ziyou & Huang, Hai-Jun & Shi, Qin, 2016. "The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 179-206.
    9. S. Waller & David Fajardo & Melissa Duell & Vinayak Dixit, 2013. "Linear Programming Formulation for Strategic Dynamic Traffic Assignment," Networks and Spatial Economics, Springer, vol. 13(4), pages 427-443, December.
    10. Long, Jiancheng & Wang, Chao & Szeto, W.Y., 2018. "Dynamic system optimum simultaneous route and departure time choice problems: Intersection-movement-based formulations and comparisons," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 166-206.
    11. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.
    12. Friesz, Terry L. & Han, Ke & Neto, Pedro A. & Meimand, Amir & Yao, Tao, 2013. "Dynamic user equilibrium based on a hydrodynamic model," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 102-126.
    13. Kachani, Soulaymane & Perakis, Georgia, 2006. "Fluid dynamics models and their applications in transportation and pricing," European Journal of Operational Research, Elsevier, vol. 170(2), pages 496-517, April.
    14. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    15. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    16. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
    17. Liu, Siyuan & Qu, Qiang, 2016. "Dynamic collective routing using crowdsourcing data," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 450-469.
    18. Redmond, Michael & Campbell, Ann Melissa & Ehmke, Jan Fabian, 2022. "Reliability in public transit networks considering backup itineraries," European Journal of Operational Research, Elsevier, vol. 300(3), pages 852-864.
    19. Yang, Fan & Zhang, Ding, 2009. "Day-to-day stationary link flow pattern," Transportation Research Part B: Methodological, Elsevier, vol. 43(1), pages 119-126, January.
    20. Friesz, Terry L. & Kim, Taeil & Kwon, Changhyun & Rigdon, Matthew A., 2011. "Approximate network loading and dual-time-scale dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 176-207, January.

    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:cdl:itsdav:qt9ng3z8vn. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucdus.html .

    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.