The congested multicommodity network design problem

Creative Commons License

Paraskevopoulos D. C., Guerel S., Bektas T.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, cilt.85, ss.166-187, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 85
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.tre.2015.10.007
  • Dergi Adı: TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.166-187
  • Anahtar Kelimeler: Multi-commodity network design, Congestion, Evolutionary algorithms, POLLUTION-ROUTING PROBLEM, CYCLE-BASED NEIGHBORHOODS, FREIGHT TRANSPORTATION, FLOW PROBLEMS, ALGORITHM, EXPANSION, EMISSIONS, MODELS, COSTS
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.