{"title":"随机加权系数随机灰狼优化器(RGWO","authors":"Kartikeya Jaiswal, H. Mittal, Sonia Kukreja","doi":"10.1109/IC3.2017.8284355","DOIUrl":null,"url":null,"abstract":"Meta-heuristic algorithms are quiet widely used in engineering and science. In this paper, a novel variant of grey-wolf optimizer, randomized gray-wolf optimizer, is proposed where the effect of random coefficients of the best agents are taken into consideration. The proposed variant is tested on a set of 12 standard benchmark functions and compared with grey-wolf optimizer and particle swarm optimization on different dimensional search spaces. To statistically validate and analyse the convergence behaviour of variant, wilcoxon rank sum test along with convergence graphs over 30 runs is studied. The experimental study signify that the proposed variant not only enhances the performance but has comparable convergence rate, especially in case of multi-modal problems.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Randomized grey wolf optimizer (RGWO) with randomly weighted coefficients\",\"authors\":\"Kartikeya Jaiswal, H. Mittal, Sonia Kukreja\",\"doi\":\"10.1109/IC3.2017.8284355\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Meta-heuristic algorithms are quiet widely used in engineering and science. In this paper, a novel variant of grey-wolf optimizer, randomized gray-wolf optimizer, is proposed where the effect of random coefficients of the best agents are taken into consideration. The proposed variant is tested on a set of 12 standard benchmark functions and compared with grey-wolf optimizer and particle swarm optimization on different dimensional search spaces. To statistically validate and analyse the convergence behaviour of variant, wilcoxon rank sum test along with convergence graphs over 30 runs is studied. The experimental study signify that the proposed variant not only enhances the performance but has comparable convergence rate, especially in case of multi-modal problems.\",\"PeriodicalId\":147099,\"journal\":{\"name\":\"2017 Tenth International Conference on Contemporary Computing (IC3)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Tenth International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2017.8284355\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Tenth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2017.8284355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Randomized grey wolf optimizer (RGWO) with randomly weighted coefficients
Meta-heuristic algorithms are quiet widely used in engineering and science. In this paper, a novel variant of grey-wolf optimizer, randomized gray-wolf optimizer, is proposed where the effect of random coefficients of the best agents are taken into consideration. The proposed variant is tested on a set of 12 standard benchmark functions and compared with grey-wolf optimizer and particle swarm optimization on different dimensional search spaces. To statistically validate and analyse the convergence behaviour of variant, wilcoxon rank sum test along with convergence graphs over 30 runs is studied. The experimental study signify that the proposed variant not only enhances the performance but has comparable convergence rate, especially in case of multi-modal problems.