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

Sharaf AlKheder and Ahmed Al-Rashidi

International Journal of Urban Sciences, 2021, vol. 25, issue 2, 178-192

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/12265934.2020.1808048 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:rjusxx:v:25:y:2021:i:2:p:178-192

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/rjus20

DOI: 10.1080/12265934.2020.1808048

Access Statistics for this article

International Journal of Urban Sciences is currently edited by Dongjoo Park and Mack Joong Choi

More articles in International Journal of Urban Sciences from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().