IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v19y2019i1d10.1007_s11067-018-9422-1.html
   My bibliography  Save this article

A Combinatorial Dynamic Network Trajectory Reservation Algorithm for Connected Autonomous Vehicles

Author

Listed:
  • Michael W. Levin

    (University of Minnesota)

Abstract

We present a combinatorial assignment algorithm for reserving space-time trajectories from origins to destinations given an ordered list of vehicles. Space-time trajectories include guaranteed arrival times at every node in the path, including at the destination. Traffic flows are modeled using the cell transmission model, a Godunov approximation to the kinematic wave model. Space-time trajectories are constructed to follow the cell transmission model constraints and first-in-first-out behavior. Reservation-based intersection control for connected autonomous vehicles, which determines intersection access and delays for individual vehicles, is used to ensure that reserved trajectories are followed. The algorithm is suitable for city networks. Results show that vehicles with higher priority tend to have much lower travel times. In addition, the trajectory reservation system reduced overall congestion in the network compared with dynamic user equilibrium assignments.

Suggested Citation

  • Michael W. Levin, 2019. "A Combinatorial Dynamic Network Trajectory Reservation Algorithm for Connected Autonomous Vehicles," Networks and Spatial Economics, Springer, vol. 19(1), pages 27-55, March.
    • Handle: RePEc:kap:netspa:v:19:y:2019:i:1:d:10.1007_s11067-018-9422-1
    DOI: 10.1007/s11067-018-9422-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-018-9422-1
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-018-9422-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    2. Le Vine, Scott & Polak, John, 2016. "A novel peer-to-peer congestion pricing marketplace enabled by vehicle-automation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 94(C), pages 483-494.
    3. Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
    4. Wong, Jinn-Tsai, 1997. "Basic concepts for a system for advance booking for highway use," Transport Policy, Elsevier, vol. 4(2), pages 109-114, April.
    5. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    6. Yang, Hai & Wang, Xiaolei, 2011. "Managing network mobility with tradable credits," Transportation Research Part B: Methodological, Elsevier, vol. 45(3), pages 580-594, March.
    7. 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.
    8. Paul I. Richards, 1956. "Shock Waves on the Highway," Operations Research, INFORMS, vol. 4(1), pages 42-51, February.
    9. Levin, Michael W. & Boyles, Stephen D. & Patel, Rahul, 2016. "Paradoxes of reservation-based intersection controls in traffic networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 90(C), pages 14-25.
    10. S. Waller & Athanasios Ziliaskopoulos, 2006. "A Combinatorial user optimal dynamic traffic assignment algorithm," Annals of Operations Research, Springer, vol. 144(1), pages 249-261, April.
    11. Daganzo, Carlos F., 1994. "The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory," Transportation Research Part B: Methodological, Elsevier, vol. 28(4), pages 269-287, August.
    12. E Verhoef & P Nijkamp & P Rietveld, 1997. "Tradeable Permits: Their Potential in the Regulation of Road Transport Externalities," Environment and Planning B, , vol. 24(4), pages 527-548, August.
    13. Malachy Carey & Chandra Balijepalli & David Watling, 2015. "Extending the Cell Transmission Model to Multiple Lanes and Lane-Changing," Networks and Spatial Economics, Springer, vol. 15(3), pages 507-535, September.
    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. 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).
    2. 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.
    3. H. M. Abdul Aziz & Satish V. Ukkusuri & Xianyuan Zhan, 2017. "Determining the Impact of Personal Mobility Carbon Allowance Schemes in Transportation Networks," Networks and Spatial Economics, Springer, vol. 17(2), pages 505-545, June.
    4. Samitha Samaranayake & Walid Krichene & Jack Reilly & Maria Laura Delle Monache & Paola Goatin & Alexandre Bayen, 2018. "Discrete-Time System Optimal Dynamic Traffic Assignment (SO-DTA) with Partial Control for Physical Queuing Networks," Transportation Science, INFORMS, vol. 52(4), pages 982-1001, August.
    5. Georgia Perakis & Guillaume Roels, 2006. "An Analytical Model for Traffic Delays and the Dynamic User Equilibrium Problem," Operations Research, INFORMS, vol. 54(6), pages 1151-1171, December.
    6. Kontorinaki, Maria & Spiliopoulou, Anastasia & Roncoli, Claudio & Papageorgiou, Markos, 2017. "First-order traffic flow models incorporating capacity drop: Overview and real-data validation," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 52-75.
    7. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    8. Takayama, Yuki & Kuwahara, Masao, 2017. "Bottleneck congestion and residential location of heterogeneous commuters," Journal of Urban Economics, Elsevier, vol. 100(C), pages 65-79.
    9. Mohebifard, Rasool & Hajbabaie, Ali, 2019. "Optimal network-level traffic signal control: A benders decomposition-based solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 252-274.
    10. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    11. Ngoduy, D. & Hoang, N.H. & Vu, H.L. & Watling, D., 2016. "Optimal queue placement in dynamic system optimum solutions for single origin-destination traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 148-169.
    12. Bao, Yue & Xiao, Feng & Gao, Zaihan & Gao, Ziyou, 2017. "Investigation of the traffic congestion during public holiday and the impact of the toll-exemption policy," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 58-81.
    13. Bar-Gera, Hillel & Carey, Malachy, 2022. "Constructing a cell transmission model solution adhering fully to first-in-first-out conditions," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 247-267.
    14. Takayama, Yuki, 2020. "Who gains and who loses from congestion pricing in a monocentric city with a bottleneck?," Economics of Transportation, Elsevier, vol. 24(C).
    15. Kimms, A. & Maiwald, M., 2018. "Bi-objective safe and resilient urban evacuation planning," European Journal of Operational Research, Elsevier, vol. 269(3), pages 1122-1136.
    16. Shen, Wei & Zhang, H.M., 2009. "On the morning commute problem in a corridor network with multiple bottlenecks: Its system-optimal traffic flow patterns and the realizing tolling scheme," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 267-284, March.
    17. Carey, Malachy, 2021. "The cell transmission model with free-flow speeds varying over time or space," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 245-257.
    18. 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.
    19. Takayama, Yuki, 2015. "Bottleneck congestion and distribution of work start times: The economics of staggered work hours revisited," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 830-847.
    20. Jiancheng Long & Wai Yuen Szeto, 2019. "Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks," Operations Research, INFORMS, vol. 67(1), pages 167-182, 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:kap:netspa:v:19:y:2019:i:1:d:10.1007_s11067-018-9422-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.