A Comparative Evaluation of Nature Inspired Algorithms for Telecommunication Network Design
Source abstract
Abstract
The subject of the study was an application of nature-inspired metaheuristic algorithms to node configuration optimization in optical networks. The main objective of the optimization was to minimize capital expenditure, which includes the costs of optical node resources, such as transponders and amplifiers used in a new generation of optical networks. For this purpose a model that takes into account the physical phenomena in the optical network is proposed. Selected nature-inspired metaheuristic algorithms were implemented and compared with a reference, deterministic algorithm, based on linear integer programming. For the cases studied the obtained results show that there is a large advantage in using metaheuristic algorithms. In particular, the evolutionary algorithm, the bees algorithm and the harmony search algorithm showed superior performance for the considered data-sets corresponding to large optical networks; the integer programming-based algorithm failed to find an acceptable sub-optimal solution within the assumed maximum computational time. All optimization methods were compared for selected instances of realistic teletransmission networks of different dimensions subject to traffic demand sets extracted from real traffic data.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Optical Network Technologies · Optical Network Technologies · Advanced Photonic Communication Systems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
George Green Institute, University of Nottingham, Nottingham NG7 2RD, UK
Telecommunications and Teleinformatics Department, Wroclaw University of Science and Technology, 50-370 Wroclaw, Poland
References (29)
Show source-provided references
1. Space Division Multiplexing in Optical Fibres10.1038/nphoton.2013.94 ↗
2. ILOG (2007). CPLEX 11.0 User’s Manual, ILOG.
3. Garey, M.R., and Johnson, D.S. (1990). Computers and Intractability; A Guide to the Theory of NP-Completeness, W. H. Freeman & Co.
4. Routing and Spectrum Assignment in Spectrum Sliced Elastic Optical Path Network10.1109/LCOMM.2011.060811.110281 ↗
5. Solving large instances of the RSA problem in flexgrid elastic optical networks10.1364/JOCN.8.000320 ↗
6. Novel Node-Arc Model and Multiiteration Heuristics for Static Routing and Spectrum Assignment in Elastic Optical Networks10.1109/JLT.2013.2282696 ↗
7. Kozdrowski, S., Żotkiewicz, M., and Sujecki, S. (2019). Optimization of Optical Networks Based on CDC-ROADM Technology. Appl. Sci., 9.10.3390/app9030399 ↗
8. Reoptimization of dynamic flexgrid optical networks after link failure repairs10.1364/JOCN.7.000049 ↗
9. Routing, Spectrum, and Transponder Assignment in Elastic Optical Networks10.1109/JLT.2015.2477898 ↗
10. Kozdrowski, S., Żotkiewicz, M., and Sujecki, S. (2020). Ultra-Wideband WDM Optical Network Optimization. Photonics, 7.10.3390/photonics7010016 ↗
11. Physical-layer-aware performance evaluation of SDM networks based on SMF bundles, MCFs, and FMFs10.1364/JOCN.10.000712 ↗
12. The GN-Model of Fiber Non-Linear Propagation and its Applications10.1109/JLT.2013.2295208 ↗
13. Yang, X.S. (2010). Nature-Inspired Metaheuristic Algorithms, Guide books.
14. Elastic Bandwidth Allocation in Flexible OFDM-Based Optical Networks10.1109/JLT.2011.2125777 ↗
15. Syswerda, G. (1989). Uniform Crossover in Genetic Algorithms, ICGA’89; Morgan Kaufmann.
16. Pham, D., Ghanbarzadeh, A., Koç, E., Otri, S., Rahim, S., and Zaidi, M. (2006). The Bees Algorithm—A Novel Tool for Complex Optimisation Problems. Intell. Prod. Mach. Syst., 454–459.10.1016/B978-008045157-2/50081-X ↗
17. Karaboga, D., and Basturk, B. (2007, January 18–21). Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems. Proceedings of the Foundations of Fuzzy Logic and Soft Computing, 12th International Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Mexico.
18. Honey Bees Inspired Optimization Method: The Bees Algorithm10.3390/insects4040646 ↗
19. Bäck, H. (1997). Proceedings of the Seventh International Conference on Genetic Algorithms: Michigan State University, East Lansing, MI, USA, 19–23 July 1997, Morgan Kaufmann Publishers Inc.
20. Michalkiewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs, Springer.10.1007/978-3-662-03315-9 ↗
21. Applying an evolutionary algorithm to telecommunication network design10.1109/4235.942526 ↗
22. Yang, X.S. (2020, September 20). Harmony Search as a Metaheuristic Algorithm, Available online: http://xxx.lanl.gov/abs/1003.1599.
23. Turky, A.M., Abdullah, S., McCollum, B., and Sabar, N.R. (2013, January 27–30). An Evolutionary Hill Climbing Algorithm for Dynamic Optimisation Problems. Proceedings of the 6th Multidisciplinary Int. conf. on Scheduling: Theory and Applications (MISTA 2013), Ghent, Belgium.
24. Abbie, J. (1970). Branch and Bound Methods for Integer and Nonconvex Programming. Integer and Nonlinear Programming, North-Holland.
25. Wolsey, L. (1998). Integer Programming, John Wiley & Sons.
26. A New Heuristic Optimization Algorithm: Harmony Search10.1177/003754970107600201 ↗
27. Evolution strategies—A comprehensive introduction10.1023/A:1015059928466 ↗
28. Arabas, J., and Kozdrowski, S. (1998, January 4–9). Population initialization in the context of a biased, problem-specific mutation. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), Anchorage, AK, USA.
29. SNDlib 1.0-Survivable Network Design Library10.1002/net.20371 ↗