约束优化问题的一种新的进化算法

Yi Hu, Yuping Wang
{"title":"约束优化问题的一种新的进化算法","authors":"Yi Hu, Yuping Wang","doi":"10.1109/CIS.2007.199","DOIUrl":null,"url":null,"abstract":"In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. To overcome this shortcoming, this paper presents a new constraint handling scheme. Firstly, a new fitness function defined by this penalty function and the objective function is designed. The new fitness function not only can classify all individuals in current population into different layers automatically, but also can distinguish solutions effectively from different layers. Meanwhile, a new crossover operator is also proposed which can produce more high quality individuals. Based on these, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations are made on five widely used benchmark problems, and the results indicate the proposed algorithm is effective.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A New Evolutionary Algorithm for Constrained Optimization Problems\",\"authors\":\"Yi Hu, Yuping Wang\",\"doi\":\"10.1109/CIS.2007.199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. To overcome this shortcoming, this paper presents a new constraint handling scheme. Firstly, a new fitness function defined by this penalty function and the objective function is designed. The new fitness function not only can classify all individuals in current population into different layers automatically, but also can distinguish solutions effectively from different layers. Meanwhile, a new crossover operator is also proposed which can produce more high quality individuals. Based on these, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations are made on five widely used benchmark problems, and the results indicate the proposed algorithm is effective.\",\"PeriodicalId\":127238,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security (CIS 2007)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security (CIS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2007.199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2007.199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在约束优化问题中,进化算法通常使用惩罚函数来处理约束,但惩罚参数难以控制。为了克服这一缺点,本文提出了一种新的约束处理方案。首先,由罚函数和目标函数定义一个新的适应度函数;新的适应度函数不仅可以自动将当前种群中的所有个体划分为不同的层,而且可以有效地区分不同层的解。同时,提出了一种新的交叉算子,可以产生更多的高质量个体。在此基础上,提出了一种求解约束优化问题的进化算法。对5个常用的基准问题进行了仿真,结果表明该算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Evolutionary Algorithm for Constrained Optimization Problems
In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. To overcome this shortcoming, this paper presents a new constraint handling scheme. Firstly, a new fitness function defined by this penalty function and the objective function is designed. The new fitness function not only can classify all individuals in current population into different layers automatically, but also can distinguish solutions effectively from different layers. Meanwhile, a new crossover operator is also proposed which can produce more high quality individuals. Based on these, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations are made on five widely used benchmark problems, and the results indicate the proposed algorithm is effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信