{"title":"约束优化问题的人工植物优化算法","authors":"Ziqiang Zhao, Z. Cui, J. Zeng, Xiaoguang Yue","doi":"10.1109/IBICA.2011.34","DOIUrl":null,"url":null,"abstract":"Artificial plant optimization algorithm is proposed to solve constrained optimization problems in this paper. In APOA, a shrinkage coefficient is introduce to ensure that all dimensions of a branch are within lower and upper bounds, and a new function to determine whether the particle is within the feasible region. One dimensional search optimization methods are selected in algorithm to produce a new position which is guaranteed to be in the feasible region for the branch which escapes from the feasible region. The experimental results show that artificial plant optimization algorithm is effective and efficient for constrained optimization problems.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"os-42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Artificial Plant Optimization Algorithm for Constrained Optimization Problems\",\"authors\":\"Ziqiang Zhao, Z. Cui, J. Zeng, Xiaoguang Yue\",\"doi\":\"10.1109/IBICA.2011.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial plant optimization algorithm is proposed to solve constrained optimization problems in this paper. In APOA, a shrinkage coefficient is introduce to ensure that all dimensions of a branch are within lower and upper bounds, and a new function to determine whether the particle is within the feasible region. One dimensional search optimization methods are selected in algorithm to produce a new position which is guaranteed to be in the feasible region for the branch which escapes from the feasible region. The experimental results show that artificial plant optimization algorithm is effective and efficient for constrained optimization problems.\",\"PeriodicalId\":158080,\"journal\":{\"name\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"volume\":\"os-42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IBICA.2011.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBICA.2011.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Artificial Plant Optimization Algorithm for Constrained Optimization Problems
Artificial plant optimization algorithm is proposed to solve constrained optimization problems in this paper. In APOA, a shrinkage coefficient is introduce to ensure that all dimensions of a branch are within lower and upper bounds, and a new function to determine whether the particle is within the feasible region. One dimensional search optimization methods are selected in algorithm to produce a new position which is guaranteed to be in the feasible region for the branch which escapes from the feasible region. The experimental results show that artificial plant optimization algorithm is effective and efficient for constrained optimization problems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
