{"title":"hLCGA:混合竞争协同进化遗传算法","authors":"Grégoire Danoy, P. Bouvry, T. Martins","doi":"10.1109/HIS.2006.32","DOIUrl":null,"url":null,"abstract":"We introduce in this article a new hybrid coevolutionary algorithm called hLCGA (hybrid Loosely Coupled Genetic Algorithm) that consists in combining a competitive coevolutionary genetic algorithm and a local search algorithm. We apply it to the Rosenbrock function optimization problem and compare the results of five hybrid variants to the original LCGA. We show the advantages of hybridizing a coevolutionary algorithm with local search algorithms in terms of solution quality and convergence speed.","PeriodicalId":150732,"journal":{"name":"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"hLCGA: A Hybrid Competitive Coevolutionary Genetic Algorithm\",\"authors\":\"Grégoire Danoy, P. Bouvry, T. Martins\",\"doi\":\"10.1109/HIS.2006.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce in this article a new hybrid coevolutionary algorithm called hLCGA (hybrid Loosely Coupled Genetic Algorithm) that consists in combining a competitive coevolutionary genetic algorithm and a local search algorithm. We apply it to the Rosenbrock function optimization problem and compare the results of five hybrid variants to the original LCGA. We show the advantages of hybridizing a coevolutionary algorithm with local search algorithms in terms of solution quality and convergence speed.\",\"PeriodicalId\":150732,\"journal\":{\"name\":\"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2006.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2006.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
hLCGA: A Hybrid Competitive Coevolutionary Genetic Algorithm
We introduce in this article a new hybrid coevolutionary algorithm called hLCGA (hybrid Loosely Coupled Genetic Algorithm) that consists in combining a competitive coevolutionary genetic algorithm and a local search algorithm. We apply it to the Rosenbrock function optimization problem and compare the results of five hybrid variants to the original LCGA. We show the advantages of hybridizing a coevolutionary algorithm with local search algorithms in terms of solution quality and convergence speed.