The University of Southampton
University of Southampton Institutional Repository

The congested multicommodity network design problem

The congested multicommodity network design problem
The congested multicommodity network design problem
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.
1366-5545
166-187
Paraskevopoulos, D.
08127270-0140-4848-a028-02ebd84ab1aa
Gurel, S.
5cf92853-9fd1-4c8e-aa38-8d1597b9e715
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Paraskevopoulos, D.
08127270-0140-4848-a028-02ebd84ab1aa
Gurel, S.
5cf92853-9fd1-4c8e-aa38-8d1597b9e715
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9

Paraskevopoulos, D., Gurel, S. and Bektas, T. (2016) The congested multicommodity network design problem. Transportation Research Part E: Logistics and Transportation Review, 85, 166-187. (doi:10.1016/j.tre.2015.10.007).

Record type: Article

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.

Text
MCND_Conic2.pdf - Accepted Manuscript
Download (2MB)

More information

Accepted/In Press date: 19 October 2015
Published date: 1 January 2016
Organisations: Centre of Excellence in Decision, Analytics & Risk Research

Identifiers

Local EPrints ID: 383174
URI: http://eprints.soton.ac.uk/id/eprint/383174
ISSN: 1366-5545
PURE UUID: d326384e-e252-4b9f-af83-8f61f4d4e698
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 09 Nov 2015 13:10
Last modified: 15 Mar 2024 05:21

Export record

Altmetrics

Contributors

Author: D. Paraskevopoulos
Author: S. Gurel
Author: T. Bektas ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×