TY - GEN
T1 - An adaptive large neighbourhood search for designing transparent optical core network
AU - Mehta, Deepak
AU - O'Sullivan, Barry
AU - Ozturk, Cemalettin
AU - Quesada, Luis
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/8/31
Y1 - 2015/8/31
N2 - In this paper, we focus on designing a core optical network. Given a set of Metro-Core (MC) nodes, the problem is to select a set of links such that the maximum distance between any pair of nodes is bounded. The primary objective is to minimise the total length of the links followed by a secondary objective which is to minimise the total length of the paths between the pairs of MC nodes. We present a mixed integer programming (MIP) model for this problem. As the size of the instances of this problem increases, the MIP model does not scale in terms of memory and time. We therefore present an adaptive large neighbourhood search (LNS) algorithm where the idea is to find an initial solution and repeatedly improve it by solving relatively small subproblems. We propose two different ways of selecting subproblems. The experiments are performed using 3 real-world network topologies: Ireland, UK and Italy. Our results demonstrate that the developed approach is suitable for solving large networks and it can compute very high quality solutions which are very close to optimal values.
AB - In this paper, we focus on designing a core optical network. Given a set of Metro-Core (MC) nodes, the problem is to select a set of links such that the maximum distance between any pair of nodes is bounded. The primary objective is to minimise the total length of the links followed by a secondary objective which is to minimise the total length of the paths between the pairs of MC nodes. We present a mixed integer programming (MIP) model for this problem. As the size of the instances of this problem increases, the MIP model does not scale in terms of memory and time. We therefore present an adaptive large neighbourhood search (LNS) algorithm where the idea is to find an initial solution and repeatedly improve it by solving relatively small subproblems. We propose two different ways of selecting subproblems. The experiments are performed using 3 real-world network topologies: Ireland, UK and Italy. Our results demonstrate that the developed approach is suitable for solving large networks and it can compute very high quality solutions which are very close to optimal values.
KW - Algorithm design and analysis
KW - Optical design
KW - Optical network units
KW - Optical switches
KW - Pabive optical networks
UR - https://www.scopus.com/pages/publications/84960450410
U2 - 10.1109/ConTEL.2015.7231187
DO - 10.1109/ConTEL.2015.7231187
M3 - Conference proceeding
AN - SCOPUS:84960450410
T3 - Proceedings of the 13th International Conference on Telecommunications, ConTEL 2015
BT - Proceedings of the 13th International Conference on Telecommunications, ConTEL 2015
A2 - Plank, Thomas
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th International Conference on Telecommunications, ConTEL 2015
Y2 - 13 July 2015 through 15 July 2015
ER -