Xia Lin, Haomiao Li, Xin Jiang, Yuchao Gao, Jinran Wu, Yang Yang
{"title":"Improve Exploration of Arithmetic Optimization Algorithm by Opposition-based Learning","authors":"Xia Lin, Haomiao Li, Xin Jiang, Yuchao Gao, Jinran Wu, Yang Yang","doi":"10.1109/PIC53636.2021.9687010","DOIUrl":null,"url":null,"abstract":"An improved version of the arithmetic optimization algorithm (AOA) based on the opposition-based learning (OBL) strategy called OBLAOA is proposed in this paper. The proposed OBLAOA algorithm consists of two stages, and in the second stage we adds OBL to update the AOA population in each iteration. The improved AOA is compared with the original AOA by using 12 benchmark functions in different dimensions to validate the improvement on exploration with the OBL. Eventually ,we get a conclusion that the OBLAOA is committed to take both candidate solutions and their opposite solutions into consideration, which shows greater opportunity to reach the global optimal and faster convergence acceleration than AOA.","PeriodicalId":297239,"journal":{"name":"2021 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC53636.2021.9687010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
An improved version of the arithmetic optimization algorithm (AOA) based on the opposition-based learning (OBL) strategy called OBLAOA is proposed in this paper. The proposed OBLAOA algorithm consists of two stages, and in the second stage we adds OBL to update the AOA population in each iteration. The improved AOA is compared with the original AOA by using 12 benchmark functions in different dimensions to validate the improvement on exploration with the OBL. Eventually ,we get a conclusion that the OBLAOA is committed to take both candidate solutions and their opposite solutions into consideration, which shows greater opportunity to reach the global optimal and faster convergence acceleration than AOA.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
