{"title":"Group selection and its application to constrained evolutionary optimization","authors":"Ming Chang, K. Ohkura, K. Ueda, M. Sugiyama","doi":"10.1109/CEC.2003.1299642","DOIUrl":null,"url":null,"abstract":"Multilevel selection theory views natural selection as hierarchy process that acts on any level of biological organizations whenever there exist heritable variation in fitness among units of that level. In this paper, selection schemes of evolutionary algorithms (EAs) are reconsidered from the point of view of the theory, and a novel constraint handling method is introduced in which a two-level selection process, namely within-group selection and between-group selection, is modeled to keep right balance between objective and penalty functions. The method is implemented on 3 group selection models that possessing different population structures and tested using (/spl mu/, /spl lambda/)-evolution strategies on a set of 13 benchmark problems. We show that a proper understanding of multilevel selection theory will help us to design EAs and might also enable us to challenge the old problems from a new angle.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"192 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299642","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Multilevel selection theory views natural selection as hierarchy process that acts on any level of biological organizations whenever there exist heritable variation in fitness among units of that level. In this paper, selection schemes of evolutionary algorithms (EAs) are reconsidered from the point of view of the theory, and a novel constraint handling method is introduced in which a two-level selection process, namely within-group selection and between-group selection, is modeled to keep right balance between objective and penalty functions. The method is implemented on 3 group selection models that possessing different population structures and tested using (/spl mu/, /spl lambda/)-evolution strategies on a set of 13 benchmark problems. We show that a proper understanding of multilevel selection theory will help us to design EAs and might also enable us to challenge the old problems from a new angle.