Abhronil Sengupta, T. Chakraborti, A. Konar, Eunjin Kim, A. Nagar
{"title":"基于差分进化和学习自动机的自适应模因算法","authors":"Abhronil Sengupta, T. Chakraborti, A. Konar, Eunjin Kim, A. Nagar","doi":"10.1109/CEC.2012.6256574","DOIUrl":null,"url":null,"abstract":"In recent years there has been a growing trend in the application of Memetic Algorithms for solving numerical optimization problems. They are population based search heuristics that integrate the benefits of natural and cultural evolution. In this paper, we propose an Adaptive Memetic Algorithm, named LA-DE which employs a competitive variant of Differential Evolution for global search and Learning Automata as the local search technique. During evolution Stochastic Automata Learning helps to balance the exploration and exploitation capabilities of DE resulting in local refinement. The proposed algorithm has been evaluated on a test-suite of 25 benchmark functions provided by CEC 2005 special session on real parameter optimization. Experimental results indicate that LA-DE outperforms several existing DE variants in terms of solution quality.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"An Adaptive Memetic Algorithm using a synergy of Differential Evolution and Learning Automata\",\"authors\":\"Abhronil Sengupta, T. Chakraborti, A. Konar, Eunjin Kim, A. Nagar\",\"doi\":\"10.1109/CEC.2012.6256574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years there has been a growing trend in the application of Memetic Algorithms for solving numerical optimization problems. They are population based search heuristics that integrate the benefits of natural and cultural evolution. In this paper, we propose an Adaptive Memetic Algorithm, named LA-DE which employs a competitive variant of Differential Evolution for global search and Learning Automata as the local search technique. During evolution Stochastic Automata Learning helps to balance the exploration and exploitation capabilities of DE resulting in local refinement. The proposed algorithm has been evaluated on a test-suite of 25 benchmark functions provided by CEC 2005 special session on real parameter optimization. Experimental results indicate that LA-DE outperforms several existing DE variants in terms of solution quality.\",\"PeriodicalId\":376837,\"journal\":{\"name\":\"2012 IEEE Congress on Evolutionary Computation\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2012.6256574\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2012.6256574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Adaptive Memetic Algorithm using a synergy of Differential Evolution and Learning Automata
In recent years there has been a growing trend in the application of Memetic Algorithms for solving numerical optimization problems. They are population based search heuristics that integrate the benefits of natural and cultural evolution. In this paper, we propose an Adaptive Memetic Algorithm, named LA-DE which employs a competitive variant of Differential Evolution for global search and Learning Automata as the local search technique. During evolution Stochastic Automata Learning helps to balance the exploration and exploitation capabilities of DE resulting in local refinement. The proposed algorithm has been evaluated on a test-suite of 25 benchmark functions provided by CEC 2005 special session on real parameter optimization. Experimental results indicate that LA-DE outperforms several existing DE variants in terms of solution quality.