Detecting Braess paradox links with a mixed integer linear programme

Yangbeibei Ji, Wei Mao and Xiaoning Zhang

International Journal of Industrial and Systems Engineering, 2014, vol. 17, issue 3, 275-284

Abstract: Braess's paradox is a counterintuitive fact that adding new links to a network can increase travel costs due to routing competition. Real networks may have unreasonably constructed roads that cause Braess paradoxes. Therefore, to improve the performance of the transportation networks, it is a necessary task to identify Braess paradox affected locations and close them. In this paper, we study the Braess paradox detection problem. Given a transportation network, we seek for a set of Braess-tainted roads whose closure will reduce travel cost. The problem is formulated by a mixed integer linear programme that can be solved by employing commercial computing package. A numerical example is demonstrated to show the performance of the programme.

Keywords: Braess paradox detection; transport networks; mixed integer linear programming; MILP; new network links; travel costs; routing competition; road closures; cost reduction. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=62538 (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:ids:ijisen:v:17:y:2014:i:3:p:275-284

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().