A Simulated Annealing Heuristic for a Branch and Price-Based Routing and Spectrum Allocation Algorithm in Elastic Optical Networks
In the paper we focus on developing an efficient algorithm capable of producing optimal solutions to the problem of routing and spectrum allocation (RSA) – a basic optimization problem in elastic optical networks. We formulate the problem as a mixed-integer program and we solve it using a branch and price (BP) algorithm. With the aim to improve the performance of BP, we enhance it with a simulated annealing-based RSA heuristic that is employed in the search for upper bound solutions. The results of numerial experiments show that the heuristic allows to decrease significantly the time required to solve the problem.
KeywordsSimulated annealing Elastic optical networks Routing and spectrum allocation Mixed-integer programming Branch and price
This work was supported by the Polish National Science Centre (NCN) under Grant DEC-2012/07/B/ST7/01215 and by the FP7 project IDEALIST (grant no. 317999)
- 5.Żotkiewicz, M., et al.: Optimization models for flexgrid elastic optical networks. In: Proceedings of IEEE ICTON, Cartagena, Spain (2013)Google Scholar
- 8.Aibin, M., Walkowiak, K.: Simulated annealing algorithm for optimization of elastic optical networks with unicast and anycast traffic. In: Proceedings of IEEE ICTON, Graz, Austria (2014)Google Scholar
- 11.IBM: ILOG CPLEX optimizer (2012). http://www.ibm.com
- 12.Klinkowski, M., et al.: Spectrum allocation problem in elastic optical networks - a branch-and-price approach. In: Proceedings of IEEE ICTON, Budapest, Hungary (2015)Google Scholar