This paper studies a version of the fixed-charge multicommodity network design problem where in addition to the traditional costs of flow and design, congestion at nodes is explicitly considered. The problem is initially modeled as a nonlinear integer programming formulation and two solution approaches are proposed: (i) a reformulation of the problem as a mixed integer second order cone program to optimally solve the problem for small to medium scale problem instances, and (ii) an evolutionary algorithm using elements of iterated local search and scatter search to provide upper bounds. Extensive computational results on new benchmark problem instances and on real case data are presented.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The congested multicommodity network design problem




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    The congested multicommodity network design problem

    Paraskevopoulos, Dimitris C. / Gürel, Sinan / Bektaş, Tolga | Elsevier | 2015


    The multicommodity maximal covering network design problem

    Viswanath, K. / Peeta, S. | IEEE | 2002


    THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM

    Viswanath, K. / Peeta, S. / IEEE | British Library Conference Proceedings | 2002


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo | Online Contents | 2016


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo / Alfandari, Laurent / Létocart, Lucas et al. | British Library Online Contents | 2016