{"title":"遗传算法中的目标函数分解","authors":"K. G. Khoo, P. N. Suganthan","doi":"10.1109/CEC.2002.1006260","DOIUrl":null,"url":null,"abstract":"The genetic algorithm (GA) has been applied to numerous optimization problems since its introduction. Here, information on each element of the solution strings is extracted to improve the GA's performance. We decouple a fitness evaluation function, estimating the fitness contribution by each dimension. Using this information, each dimension within each solution fights for its position in the offspring. A comparison with the standard GA showed that the proposed GA is superior on commonly tested functions.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Objective function decomposition within genetic algorithm\",\"authors\":\"K. G. Khoo, P. N. Suganthan\",\"doi\":\"10.1109/CEC.2002.1006260\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The genetic algorithm (GA) has been applied to numerous optimization problems since its introduction. Here, information on each element of the solution strings is extracted to improve the GA's performance. We decouple a fitness evaluation function, estimating the fitness contribution by each dimension. Using this information, each dimension within each solution fights for its position in the offspring. A comparison with the standard GA showed that the proposed GA is superior on commonly tested functions.\",\"PeriodicalId\":184547,\"journal\":{\"name\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2002.1006260\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2002.1006260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Objective function decomposition within genetic algorithm
The genetic algorithm (GA) has been applied to numerous optimization problems since its introduction. Here, information on each element of the solution strings is extracted to improve the GA's performance. We decouple a fitness evaluation function, estimating the fitness contribution by each dimension. Using this information, each dimension within each solution fights for its position in the offspring. A comparison with the standard GA showed that the proposed GA is superior on commonly tested functions.