Highlights A new fixed-charge multicommodity network design problem with congestion at nodes. A reformulation of the problem as a mixed integer second order cone program. An efficient evolutionary algorithm that combines iterated local search and scatter search. Computational experiments on new benchmark instances and real case data.

    Abstract 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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The congested multicommodity network design problem


    Beteiligte:


    Erscheinungsdatum :

    2015-10-15


    Format / Umfang :

    22 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    The congested multicommodity network design problem

    Dimitris C Paraskevopoulos | Online Contents | 2016


    THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM

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


    The multicommodity maximal covering network design problem

    Viswanath, K. / Peeta, S. | IEEE | 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