{"title":"Grey Wolf Optimizer with Multi-Strategy Optimization and Its Application on TSP","authors":"Rumeng Wang, Ke-wen Xia, Mukase Sandrine","doi":"10.1145/3424311.3424318","DOIUrl":null,"url":null,"abstract":"The Grey Wolf Optimizer (GWO) is an optimized search method inspired by the grey wolf predation activity in the wolf pack. Due to the shortcomings of GWO that are easy to fall into the local minimum and slow convergence speed, a GWO with Multi-Strategy Optimization (MSO-GWO) is proposed, that is, the opposition-based learning strategy method is used in the population initialization stage and the weighted distance is used in the search stage to update the position, so to improve the population diversity and avoid falling into the local minimum. After testing and comparative analysis of various international benchmark functions, the results show that the MSO-GWO algorithm has obvious convergence speed and conversion accuracy. Finally, the MSO-GWO algorithm is used to solve Traveling Salesman Problem (TSP), and its solution effect is remarkable.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3424311.3424318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The Grey Wolf Optimizer (GWO) is an optimized search method inspired by the grey wolf predation activity in the wolf pack. Due to the shortcomings of GWO that are easy to fall into the local minimum and slow convergence speed, a GWO with Multi-Strategy Optimization (MSO-GWO) is proposed, that is, the opposition-based learning strategy method is used in the population initialization stage and the weighted distance is used in the search stage to update the position, so to improve the population diversity and avoid falling into the local minimum. After testing and comparative analysis of various international benchmark functions, the results show that the MSO-GWO algorithm has obvious convergence speed and conversion accuracy. Finally, the MSO-GWO algorithm is used to solve Traveling Salesman Problem (TSP), and its solution effect is remarkable.