Application of Chaos Optimization Algorithm to Nonlinear Constrained Programming

Zhiliang Wang, Yongshan Zhang
{"title":"Application of Chaos Optimization Algorithm to Nonlinear Constrained Programming","authors":"Zhiliang Wang, Yongshan Zhang","doi":"10.1109/ICEEE.2010.5660461","DOIUrl":null,"url":null,"abstract":"The studying history and present situation of chaos optimization algorithm is summarized and the basic steps of this method are introduced.A new,feasible chaos optimization is presented to nonlinear constrained programming problems. Computing results in an instance show that this algorithm is reliable and applicable to almost all of the problems in multidimensional, nonlinear,complex constrained programming.This algorithm is liable to be applied and mastered.","PeriodicalId":6302,"journal":{"name":"2010 International Conference on E-Product E-Service and E-Entertainment","volume":"6 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on E-Product E-Service and E-Entertainment","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEEE.2010.5660461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The studying history and present situation of chaos optimization algorithm is summarized and the basic steps of this method are introduced.A new,feasible chaos optimization is presented to nonlinear constrained programming problems. Computing results in an instance show that this algorithm is reliable and applicable to almost all of the problems in multidimensional, nonlinear,complex constrained programming.This algorithm is liable to be applied and mastered.
混沌优化算法在非线性约束规划中的应用
综述了混沌优化算法的研究历史和现状,介绍了混沌优化算法的基本步骤。针对非线性约束规划问题,提出了一种新的可行混沌优化方法。实例计算结果表明,该算法是可靠的,适用于几乎所有的多维、非线性、复杂约束规划问题。该算法易于应用和掌握。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信