{"title":"一个探索性和剥削性的突变方案","authors":"F. Vafaee, P. Nelson","doi":"10.1109/CEC.2010.5586142","DOIUrl":null,"url":null,"abstract":"Exploration and exploitation are the two cornerstones which characterize Evolutionary Algorithms (EAs) capabilities. Maintaining the reciprocal balance of the explorative and exploitative power is the key to the success of EA applications. Accordingly, in this work the canonical Genetic Algorithm is augmented by a new mutation scheme that is capable of exploring the unseen regions of the search space, and simultaneously exploiting the already-found promising elements. The proposed mutation operator specifies different mutation rates for different sites (loci) of the individuals. These site-specific rates are wisely derived based on the fitness and structure of the population individuals. In order to retain the balance of the required exploration and exploitation, the mutation rates are adapted during the evolution. To demonstrate the efficacy of the proposed algorithm, the method is evaluated using a set of benchmark problems and the outcome is compared with a series of well-known relevant algorithms. The results demonstrate that the newly suggested method significantly outperforms its rivals.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"126 3","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"An explorative and exploitative mutation scheme\",\"authors\":\"F. Vafaee, P. Nelson\",\"doi\":\"10.1109/CEC.2010.5586142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Exploration and exploitation are the two cornerstones which characterize Evolutionary Algorithms (EAs) capabilities. Maintaining the reciprocal balance of the explorative and exploitative power is the key to the success of EA applications. Accordingly, in this work the canonical Genetic Algorithm is augmented by a new mutation scheme that is capable of exploring the unseen regions of the search space, and simultaneously exploiting the already-found promising elements. The proposed mutation operator specifies different mutation rates for different sites (loci) of the individuals. These site-specific rates are wisely derived based on the fitness and structure of the population individuals. In order to retain the balance of the required exploration and exploitation, the mutation rates are adapted during the evolution. To demonstrate the efficacy of the proposed algorithm, the method is evaluated using a set of benchmark problems and the outcome is compared with a series of well-known relevant algorithms. The results demonstrate that the newly suggested method significantly outperforms its rivals.\",\"PeriodicalId\":6344,\"journal\":{\"name\":\"2009 IEEE Congress on Evolutionary Computation\",\"volume\":\"126 3\",\"pages\":\"1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2010.5586142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2010.5586142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Exploration and exploitation are the two cornerstones which characterize Evolutionary Algorithms (EAs) capabilities. Maintaining the reciprocal balance of the explorative and exploitative power is the key to the success of EA applications. Accordingly, in this work the canonical Genetic Algorithm is augmented by a new mutation scheme that is capable of exploring the unseen regions of the search space, and simultaneously exploiting the already-found promising elements. The proposed mutation operator specifies different mutation rates for different sites (loci) of the individuals. These site-specific rates are wisely derived based on the fitness and structure of the population individuals. In order to retain the balance of the required exploration and exploitation, the mutation rates are adapted during the evolution. To demonstrate the efficacy of the proposed algorithm, the method is evaluated using a set of benchmark problems and the outcome is compared with a series of well-known relevant algorithms. The results demonstrate that the newly suggested method significantly outperforms its rivals.