The congested multicommodity network design problem

Dimitris C. Paraskevopoulos, Sinan Gurel, Tolga Bektaş

Research output: Contribution to journalArticle

11 Citations (Scopus)
152 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)166-187
Number of pages22
JournalTransportation Research Part E: Logistics and Transportation Review
Volume85
Early online date17 Dec 2015
DOIs
Publication statusPublished - 1 Jan 2016

Keywords

  • Multi-commodity network design
  • congestion
  • evolutionary algorithms

Fingerprint Dive into the research topics of 'The congested multicommodity network design problem'. Together they form a unique fingerprint.

  • Cite this