{"title":"用分布估计算法求解约束优化问题","authors":"P. A. Simionescu, D. Beale, G. Dozier","doi":"10.1109/CEC.2004.1330870","DOIUrl":null,"url":null,"abstract":"Two variants of estimation of distribution algorithm (EDA) are tested solving several continuous optimization problems with constraints. Numerical experiments are conducted and comparison is made between constraint handling using several types of penalty and repair operators in case of both elitist and nonelitist implementation of the EDA's. Graphical display and animations of representative runs of the best and worst performers proved useful in enhancing the understanding of how such algorithms work.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Constrained optimization problem solving using estimation of distribution algorithms\",\"authors\":\"P. A. Simionescu, D. Beale, G. Dozier\",\"doi\":\"10.1109/CEC.2004.1330870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two variants of estimation of distribution algorithm (EDA) are tested solving several continuous optimization problems with constraints. Numerical experiments are conducted and comparison is made between constraint handling using several types of penalty and repair operators in case of both elitist and nonelitist implementation of the EDA's. Graphical display and animations of representative runs of the best and worst performers proved useful in enhancing the understanding of how such algorithms work.\",\"PeriodicalId\":152088,\"journal\":{\"name\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2004.1330870\",\"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 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2004.1330870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constrained optimization problem solving using estimation of distribution algorithms
Two variants of estimation of distribution algorithm (EDA) are tested solving several continuous optimization problems with constraints. Numerical experiments are conducted and comparison is made between constraint handling using several types of penalty and repair operators in case of both elitist and nonelitist implementation of the EDA's. Graphical display and animations of representative runs of the best and worst performers proved useful in enhancing the understanding of how such algorithms work.