{"title":"连续函数优化的循环多阶段进化算法性能研究","authors":"Mohammad Shafiul Alam, Md Wasi Ul Kabir, M. Islam","doi":"10.1109/ICCITECHN.2010.5723830","DOIUrl":null,"url":null,"abstract":"Recurring Multistage Evolutionary Algorithm is a novel evolutionary approach that is based on repeating conventional, explorative and exploitative genetic operations in order to perform better optimization with improved robustness against local optima. This work compares the performance of RMEA with that of classical evolutionary algorithm, differential evolution and particle swarm optimization on a test suite of 50 different benchmark functions. The test functions include unimodal and multimodal, separable and non-separable, regular and irregular, low and high dimensional functions. Very few works have been tested on a similar range of benchmark problems. The experimental results show that the performance of RMEA is comparable to and often better than the other mentioned algorithms.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On the performance of Recurring Multistage Evolutionary Algorithm for continuous function optimization\",\"authors\":\"Mohammad Shafiul Alam, Md Wasi Ul Kabir, M. Islam\",\"doi\":\"10.1109/ICCITECHN.2010.5723830\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recurring Multistage Evolutionary Algorithm is a novel evolutionary approach that is based on repeating conventional, explorative and exploitative genetic operations in order to perform better optimization with improved robustness against local optima. This work compares the performance of RMEA with that of classical evolutionary algorithm, differential evolution and particle swarm optimization on a test suite of 50 different benchmark functions. The test functions include unimodal and multimodal, separable and non-separable, regular and irregular, low and high dimensional functions. Very few works have been tested on a similar range of benchmark problems. The experimental results show that the performance of RMEA is comparable to and often better than the other mentioned algorithms.\",\"PeriodicalId\":149135,\"journal\":{\"name\":\"2010 13th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2010.5723830\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2010.5723830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the performance of Recurring Multistage Evolutionary Algorithm for continuous function optimization
Recurring Multistage Evolutionary Algorithm is a novel evolutionary approach that is based on repeating conventional, explorative and exploitative genetic operations in order to perform better optimization with improved robustness against local optima. This work compares the performance of RMEA with that of classical evolutionary algorithm, differential evolution and particle swarm optimization on a test suite of 50 different benchmark functions. The test functions include unimodal and multimodal, separable and non-separable, regular and irregular, low and high dimensional functions. Very few works have been tested on a similar range of benchmark problems. The experimental results show that the performance of RMEA is comparable to and often better than the other mentioned algorithms.