Algorithms for the integer multicommodity network design problem
Kılınç, Mustafa Rasim
Karaşan, Oya Ekin
Item Usage Stats
MetadataShow full item record
In this thesis, we study the problem of logical network design in telecommunication networks. Given a set of nodes and a set of commodities, we aim to locate lightpaths(links) between nodes and route the commodities over these lightpaths. The cost to be minimized is the number of lightpaths used. The problem has capacity, degree and delay constraints. An important characteristic of our problem is that the commodities can not be split, therefore they must be routed on a single path. We present two integer programming formulations of the problem and consider four sets of valid inequalities. Additionally, a relaxation of the problem is presented to obtain a lower bound to the problem. Finally, we propose two algorithms of generating good feasible solutions to the problem. Our results prove to be close to the lower bounds.
KeywordsNetwork Topology Design
Capacitated Network Design
Integer Multicommodity Flow Problem
T57.85 .K54 2004
Network analysis (Planning).