The continuous network design problem is formulated as a mathematical program with complementarity constraints (MPCC) and a Gauss–Seidel decomposition scheme is presented for the solution of the MPCC model. The model has an upper level as a nonlinear programming problem and the lower level as a nonlinear complementarity problem. With the application of the complementarity slackness condition of the lower-level problem, the original bilevel formulation can be converted into a single-level nonlinear programming problem. To solve the single-level problem, a decomposition scheme that can resolve the possible dimensionality problem (i.e., a large number of defining variables) is developed. The decomposition scheme is tested, and promising results are shown for well-known test problems.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Decomposition Scheme for Continuous Network Design Problem with Asymmetric User Equilibria


    Additional title:

    Transportation Research Record


    Contributors:


    Publication date :

    2006-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Decomposition Scheme for Continuous Network Design Problem with Asymmetric User Equilibria

    Ban, X. / Liu, H. X. / Lu, J. et al. | British Library Conference Proceedings | 2006


    Decomposition Scheme for Continuous Network Design Problem with Asymmetric User Equilibria

    Ban, Xuegang / Liu, Henry / Lu, Jiangang et al. | Transportation Research Record | 2006


    Hierarchy Decomposition for Faster User Equilibria on Road Networks

    Luxen, Dennis / Sanders, Peter | Tema Archive | 2011


    Dynamic Continuous Network Design Problem

    Karoonsoontawong, Ampol / Waller, S. Travis | Transportation Research Record | 2006