IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v183y2024ics0965856424001150.html
   My bibliography  Save this article

Urban network geofencing with dynamic speed limit policy via deep reinforcement learning

Author

Listed:
  • Lu, Wenqi
  • Yi, Ziwei
  • Gidofalvi, Gyözö
  • Simoni, Michele D.
  • Rui, Yikang
  • Ran, Bin

Abstract

Urban environment and mobility are threatened by traffic congestion due to the growth in the number of vehicles and urbanization. To address this problem, we propose a deep reinforcement learning-based (DRL) urban network geofencing (UNG) strategy for traffic management to improve traffic operations and sustainability. The proposed solution creates a real-time geofence that consists of several sub-networks where dynamic speed limit policies are implemented. The road links in each sub-network share the same speed limit policy in a control cycle. An actor-critic framework is developed to learn the discrete speed limits of sub-networks in a continuous action space, and a reward function is developed based on the average speeds of vehicles on the network. A twin delayed deep deterministic policy gradient (TD3) method is introduced for calibrating the actor-critic networks and solving the overestimation bias problem arising with the function approximation. Based on the traffic simulation of a real-world local network in Shanghai, the performance of the geofencing methods is investigated in various scenarios characterized by different levels of traffic demand and control settings. The findings suggest that the proposed TD3-UNG controller is capable of generating beneficial dynamic speed limit policies to reduce total time spent, emissions, and fuel consumption in various scenarios.

Suggested Citation

  • Lu, Wenqi & Yi, Ziwei & Gidofalvi, Gyözö & Simoni, Michele D. & Rui, Yikang & Ran, Bin, 2024. "Urban network geofencing with dynamic speed limit policy via deep reinforcement learning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 183(C).
  • Handle: RePEc:eee:transa:v:183:y:2024:i:c:s0965856424001150
    DOI: 10.1016/j.tra.2024.104067
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856424001150
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tra.2024.104067?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.

    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:transa:v:183:y:2024:i:c:s0965856424001150. 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/547/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.