The congested multicommodity network design problem

Download

index.pdf

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

107
views

52
downloads

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

Journal

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW

DOI

https://doi.org/10.1016/j.tre.2015.10.007

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

The Performance-Based Interlinked Model (PBIM) In Architectural Design: Exchanging Environmental, Structural And Spatial Parameters In The Early Design Stage Yazıcı, Sevil (Middle East Technical University, Faculty of Architecture, 2021-6-30) The paper aims to present a model that generates a framework for incorporating different types of performance issues into the conceptual design to improve the decision-making process of students by extracting only the critical parameters and demonstrate its applicability in the context of architectural education. The proposed Performance-based Interlinked Model (PBIM) seeks to address the question of whether design and performance parameters can be evaluated together in the early design stage, where concept...
An interactive evolutionary algorithm for the multiobjective relocation problem with partial coverage Orbay, Berk; Karasakal, Esra; Department of Operational Research (2011) In this study, a bi-objective capacitated facility location problem is presented which includes partial coverage concept and relocation of facility nodes. In partial coverage, a predefined distance between a demand node and a facility node is assumed to be fully covered. After the predefined distance, the service level commences to decay linearly. The problem is designed to consider the existence of already functioning facility nodes. It is allowed to close these existing facilities and open new facilities ...
The position of three-dimensional modeling and visualization techniques in industrial design education COŞKUN, MERVE; Akiner, Dilem (2012-05-04) The purpose of this research is to determine the position of three-dimensional modeling and digital visualization within the scope of concept and product development process in the undergraduate education in Middle East Technical University Faculty of Architecture Department of Industrial Design, designate the problems that the students encounter during the integration of these methods to the design process, and finally question how these methods can be incorporated into design education in order to influen...
The strong partial transitive-closure problem: Algorithms and performance evaluation Toroslu, İsmail Hakkı (1996-08-01) The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values...
A comparative study of evolutionary network design Kalkan, Sinan; Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2003) In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitne...

Citation Formats

D. C. Paraskevopoulos, S. Gürel, and T. Bektas, “The congested multicommodity network design problem,” TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, pp. 166–187, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33095.