IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v34y2019i4p486-509.html
   My bibliography  Save this article

System optimal relaxation and Benders decomposition algorithm for the large-sized road network design problem

Author

Listed:
  • Saeed Asadi Bagloee
  • Majid Sarvi
  • Abbas Rajabifard
  • Russell George Thompson

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.

Suggested Citation

  • Saeed Asadi Bagloee & Majid Sarvi & Abbas Rajabifard & Russell George Thompson, 2019. "System optimal relaxation and Benders decomposition algorithm for the large-sized road network design problem," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 34(4), pages 486-509.
    • Handle: RePEc:ids:ijlsma:v:34:y:2019:i:4:p:486-509
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=103516
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijlsma:v:34:y:2019:i:4:p:486-509. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.