{"title":"进化算法中非泛型种群结构的统一模型","authors":"J. Sprave","doi":"10.1109/CEC.1999.782644","DOIUrl":null,"url":null,"abstract":"This paper presents a formal model of population structures in evolutionary algorithms based on hypergraphs. Since it covers fine grained and coarse grained parallel approaches as well as the simple panmictic case, it provides a unified base for theoretical work on a broad range of algorithms.","PeriodicalId":292523,"journal":{"name":"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A unified model of non-panmictic population structures in evolutionary algorithms\",\"authors\":\"J. Sprave\",\"doi\":\"10.1109/CEC.1999.782644\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a formal model of population structures in evolutionary algorithms based on hypergraphs. Since it covers fine grained and coarse grained parallel approaches as well as the simple panmictic case, it provides a unified base for theoretical work on a broad range of algorithms.\",\"PeriodicalId\":292523,\"journal\":{\"name\":\"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.1999.782644\",\"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 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.1999.782644","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A unified model of non-panmictic population structures in evolutionary algorithms
This paper presents a formal model of population structures in evolutionary algorithms based on hypergraphs. Since it covers fine grained and coarse grained parallel approaches as well as the simple panmictic case, it provides a unified base for theoretical work on a broad range of algorithms.