Conventional discrete transportation network design problem deals with the optimal decision on new link addition, assuming the capacity of each candidate link addition is predetermined and fixed. In this paper, we address a novel yet general discrete network design problem formulation that aims to determine the optimal new link addition and their optimal capacities simultaneously, which answers the questions on whether a new link should be added or not, and if added, what should be the optimal link capacity. A global optimization method employing linearization, outer approximation and range reduction techniques is developed to solve the formulated model.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A novel discrete network design problem formulation and its global optimization solution algorithm




    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr





    Global optimization methods for the discrete network design problem

    Wang, Shuaian / Meng, Qiang / Yang, Hai | Elsevier | 2013


    Solution algorithm for the bi-level discrete network design problem

    Gao, Ziyou / Wu, Jianjun / Sun, Huijun | Elsevier | 2004