System optimal relaxation and Benders decomposition algorithm for the large-sized road network design problem
by Saeed Asadi Bagloee; Majid Sarvi; Abbas Rajabifard; Russell George Thompson
International Journal of Logistics Systems and Management (IJLSM), Vol. 34, No. 4, 2019

Abstract: Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as the discrete network design problem (DNDP). The DNDP is often characterised as a bilevel programming problem which is known to be NP-hard. Despite a plethora of research, due to the combinatorial complexity, the literature addressing this problem for large-sized networks is scarce. To this end, we first transform the bilevel problem into a single-level problem by relaxing it to a system-optimal traffic flow. As such, the problem turns to be a mixed integer nonlinear programming (MINLP) problem. Secondly, we develop an efficient Benders decomposition algorithm to solve the ensuing MINLP problem. The proposed methodology is applied to three examples, a pedagogical network, Sioux Falls and a real-size network representing the City of Winnipeg, Canada. Numerical tests on the network of Winnipeg at various budget levels demonstrate promising results.

Online publication date: Fri, 08-Nov-2019

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 Logistics Systems and Management (IJLSM):
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