Detecting Braess paradox links with a mixed integer linear programme
by Yangbeibei Ji; Wei Mao; Xiaoning Zhang
International Journal of Industrial and Systems Engineering (IJISE), Vol. 17, No. 3, 2014

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.

Online publication date: Fri, 25-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com