Single-layer Cuts for Multi-layer Network Design Problems

Please always quote using this URN: urn:nbn:de:0297-zib-9641

We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation that takes many practical side constraints into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branch-and-cut approach with problem-specific preprocessing and cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these cutting planes are still useful in the multi-layer context, helping to increase the dual bound and to reduce the optimality gaps.

Metadaten
Author:	Arie M.C.A. Koster, Sebastian Orlowski, Christian Raack, Georg Bayer, Thomas Engel
Document Type:	ZIB-Report
Tag:	cutting planes; mixed-integer programming; multi-layer network design; telecommunication network
MSC-Classification:	68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area) / 68Mxx Computer system organization / 68M10 Network design and communication [See also 68R10, 90B18]
	90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B18 Communication networks [See also 68M10, 94A05]
	90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
Date of first Publication:	2007/08/13
Series (Serial Number):	ZIB-Report (07-21)
ISSN:	1438-0064
ZIB-Reportnumber:	07-21
Published in:	Appeared in: Telecommunications Modeling, Policy, and Technology. S. Raghavan et al. (eds.) Springer 2008. ISBN 978-0-387-77779-5, pp. 1-23

Open Access