IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8784067.html
   My bibliography  Save this article

Improved Road-Network-Flow Control Strategy Based on Macroscopic Fundamental Diagrams and Queuing Length in Connected-Vehicle Network

Author

Listed:
  • Xiaohui Lin
  • Jianmin Xu
  • Peiqun Lin
  • Chengtao Cao
  • Jiahui Liu

Abstract

Connected-vehicles network provides opportunities and conditions for improving traffic signal control, and macroscopic fundamental diagrams (MFD) can control the road network at the macrolevel effectively. This paper integrated proposed real-time access to the number of mobile vehicles and the maximum road queuing length in the Connected-vehicles network. Moreover, when implementing a simple control strategy to limit the boundary flow of a road network based on MFD, we determined whether the maximum queuing length of each boundary section exceeds the road-safety queuing length in real-time calculations and timely adjusted the road-network influx rate to avoid the overflow phenomenon in the boundary section. We established a road-network microtraffic simulation model in VISSIM software taking a district as the experimental area, determined MFD of the region based on the number of mobile vehicles, and weighted traffic volume of the road network. When the road network was tending to saturate, we implemented a simple control strategy and our algorithm limits the boundary flow. Finally, we compared the traffic signal control indicators with three strategies: no control strategy, boundary control, and boundary control with limiting queue strategy. The results show that our proposed algorithm is better than the other two.

Suggested Citation

  • Xiaohui Lin & Jianmin Xu & Peiqun Lin & Chengtao Cao & Jiahui Liu, 2017. "Improved Road-Network-Flow Control Strategy Based on Macroscopic Fundamental Diagrams and Queuing Length in Connected-Vehicle Network," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-7, November.
  • Handle: RePEc:hin:jnlmpe:8784067
    DOI: 10.1155/2017/8784067
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/8784067.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/8784067.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/8784067?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
    ---><---

    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:hin:jnlmpe:8784067. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.