A quantum evolutionary algorithm for the second-best congestion pricing problem in urban traffic networks

Mehrdad Gholami Shahbandi, Mohammad Mahdi Nasiri and Abbas Babazadeh

Transportation Planning and Technology, 2015, vol. 38, issue 8, 851-865

Abstract: This paper investigates the congestion pricing problem in urban traffic networks. A first-best strategy, a second-best strategy for toll leveling in closed cordons and a second-best strategy for determining both toll levels and toll points are considered. The problem is known to be a mixed integer programming model and formulated as a bi-level optimization problem, with an objective of maximizing the social welfare. A method is presented to solve the problem, based on a novel metaheuristic algorithm, namely quantum evolutionary algorithm (QEA). To verify the proposed method, the widely used genetic algorithm (GA) is also applied to solve the problem. The problem is solved for a medium-size urban traffic network and the results of the QEA are compared against the conventional GA. Computational results show that the QEA outperforms the GA in solution quality.

Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2015.1079386 (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:transp:v:38:y:2015:i:8:p:851-865

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

DOI: 10.1080/03081060.2015.1079386

Access Statistics for this article

Transportation Planning and Technology is currently edited by Dr. David Gillingwater

More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().