The congested multicommodity network design problem

Date

2016-01-01

Author

Paraskevopoulos, Dimitris C.
Gürel, Sinan
Bektas, Tolga

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

7
views

6
downloads

Cite This

This paper studies a version of the fixed-charge multicommedity 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. (C) 2015 Published by Elsevier Ltd.

Subject Keywords

Multi-commodity network design, Congestion, Evolutionary algorithms

URI

https://hdl.handle.net/11511/33095

Collections

Department of Industrial Engineering, Article