The congested multicommodity network design problem
Paraskevopoulos, D. C., Gürel, S. & Bektaş, T. (2016). The congested multicommodity network design problem. Transportation Research Part E: Logistics and Transportation Review, 85, pp. 166-187. doi: 10.1016/j.tre.2015.10.007
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.
| Publication Type: | Article |
|---|---|
| Additional Information: | © 2016 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Publisher Keywords: | Multi-commodity network design, Congestion, Evolutionary algorithms |
| Subjects: | H Social Sciences > HE Transportation and Communications |
| Departments: | Bayes Business School > Management |
| SWORD Depositor: |
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (2MB) | Preview
Export
Downloads
Downloads per month over past year
Metadata
MetadataActions (login required)
Admin Login