Title: Detecting Braess paradox links with a mixed integer linear programme

Authors: Yangbeibei Ji; Wei Mao; Xiaoning Zhang

Addresses: School of Economics and Management, Tongji University, Shanghai 200092, China ' School of Business, Central South University, Changsha, Hunan, 410083, China ' School of Economics and Management, Tongji University, Shanghai 200092, China

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.

DOI: 10.1504/IJISE.2014.062538

International Journal of Industrial and Systems Engineering, 2014 Vol.17 No.3, pp.275 - 284

Published online: 25 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article