Memetic evolutionary algorithms to design optical networks with a local search that improves diversity

被引:4
作者
Candeias, Jorge [1 ]
de Araujo, Danilo R. B. [1 ]
Miranda, Pericles [1 ]
Bastos-Filho, Carmelo J. A. [2 ]
机构
[1] UFRPE Fed Rural Univ Pernambuco, Rua Dom Manuel de Medeiros S-N, BR-52171900 Recife, PE, Brazil
[2] UPE Univ Pernambuco, Ave Agamenon Magalhaes S-N Santo Amaro, BR-50100010 Recife, PE, Brazil
关键词
Optical networks; Network design; Manyobjective optimization; Local search; Pivot rules; Evolutionary algorithms;
D O I
10.1016/j.eswa.2023.120805
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The last few years have seen an increasing demand for high-capacity Internet services, and this need has intensified in the years 2020 and 2021. In 2020 and 2021, Internet usage grew by 50% in several European countries, mainly due to home office, video streaming, hybrid teaching, and others. High-capacity optical networks usually meet this growing demand for Internet services. Thus, investigations that can improve the quality of optical networks are highly relevant in the current context. One of the research problems in this area is related to the physical topology design (PTD) of optical networks, which is classified as NP-hard. Several studies on PTD consider the application of meta-heuristics that obtain suboptimal solutions in a time compatible with engineering applications. However, meta-heuristics and local search techniques have been combined in several other optimization problems, which is not typical for the PTD problem. This paper proposes a solution to the PTD problem that combines a known multipurpose optimization algorithm, the NSGA-III, with operators considering the domain-specific knowledge of the problem to provide superior-quality networks. According to our results, the new proposal presents quality up to 8% higher than previous proposals concerning the hypervolume metrics (HV), maintaining a similar computational cost.
引用
收藏
页数:16
相关论文
共 32 条
[1]   Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search [J].
Abouhawwash, Mohamed ;
Seada, Haitham ;
Deb, Kalyanmoy .
COMPUTERS & OPERATIONS RESEARCH, 2017, 79 :331-346
[2]  
[Anonymous], 2003, NAT COMP SER, DOI 10.1007/978-3-662-44874-8
[3]  
[Anonymous], 2015, P COMP PUBL 2015 ANN, DOI DOI 10.1145/2739482.2768462
[4]  
Araujo D. R. B., 2011, Proceedings of the 2011 11th International Conference on Intelligent Systems Design and Applications (ISDA), P76, DOI 10.1109/ISDA.2011.6121634
[5]  
Araujo D. R. B. d., 2015, THESIS U FEDERAL PER
[6]  
Barbosa F, 2018, PROCEEDINGS OF 2018 10TH INTERNATIONAL WORKSHOP ON RESILIENT NETWORKS DESIGN AND MODELING (RNDM)
[7]  
Ben Mansour I, 2017, INT C INTELL COMP CO, P163, DOI 10.1109/ICCP.2017.8116999
[8]   Model-based evaluation of clustering validation measures [J].
Brun, Marcel ;
Sima, Chao ;
Hua, Jianping ;
Lowey, James ;
Carroll, Brent ;
Suh, Edward ;
Dougherty, Edward R. .
PATTERN RECOGNITION, 2007, 40 (03) :807-824
[9]  
Castro-Gutierrez J, 2011, IEEE SYS MAN CYBERN, P257, DOI 10.1109/ICSMC.2011.6083675
[10]  
Chaves D. A., 2010, J COMMUNICATION INFO, V25, P1