IDEAS home Printed from https://ideas.repec.org/a/taf/rjusxx/v25y2021i2p178-192.html
   My bibliography  Save this article

Congestion pricing with Genetic Algorithm for delay reduction on urban road network

Author

Listed:
  • Sharaf AlKheder
  • Ahmed Al-Rashidi

Abstract

This paper investigated the possibility of applying congestion pricing in order to mitigate the traffic congestion on urban road networks in Kuwait. In order to explore the public support of this idea, a satisfaction study survey had been distributed randomly to road users. Genetic Algorithm (GA) was utilized to design the congestion pricing system as a unit price combinatorial optimization problem. Additionally, network analysis with SYNCHRO simulation software had been applied to examine Kuwait city network overall performance before and after applying congestion pricing. Two different approaches had been introduced: User Equilibrium (UE) and System Optimal Flow (SO). It was concluded that commuters are supporting applying congestion pricing as long as it will guarantee them a lower travel time with less delay. Eventually, the positive impact of congestion pricing on the studied network and the delay reduction was clearly noticed.

Suggested Citation

  • Sharaf AlKheder & Ahmed Al-Rashidi, 2021. "Congestion pricing with Genetic Algorithm for delay reduction on urban road network," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 25(2), pages 178-192, April.
    • Handle: RePEc:taf:rjusxx:v:25:y:2021:i:2:p:178-192
    DOI: 10.1080/12265934.2020.1808048
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/12265934.2020.1808048
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/12265934.2020.1808048?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.

    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:taf:rjusxx:v:25:y:2021:i:2:p:178-192. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rjus20 .

    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.