首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种求解不等式约束下函数优化问题的新算法
引用本文:郭涛,康立山,李艳.一种求解不等式约束下函数优化问题的新算法[J].武汉大学学报(理学版),1999(5).
作者姓名:郭涛  康立山  李艳
作者单位:武汉大学软件工程国家重点实验室!武汉430072
基金项目:国家自然科学基金,国家863 计划资助
摘    要:提出了一种求解不等式约束下的函数优化问题的新算法. 算法设计思想来源于演化计算的群体搜索技术,但又不同于现存的任何一种演化算法. 对一些典型的约束优化问题测试结果表明:新算法结构的简单性,搜索的高效性,收敛的全局性,应用的广泛性,算法的鲁棒性及结果的精确性,都优于现存的演化算法.

关 键 词:遗传算法  不等式约束  函数优化问题

A New Algorithm for Solving Function Optimization Problems with Inequality Constraints
GUO Tao,KANG Li\|shan,LI Yan.A New Algorithm for Solving Function Optimization Problems with Inequality Constraints[J].JOurnal of Wuhan University:Natural Science Edition,1999(5).
Authors:GUO Tao  KANG Li\|shan  LI Yan
Abstract:A new algorithm for solving function optimization problem with inequality constraints is proposed. The ideas for designing the algorithm come from evolutionary computation,but deffer from any of the existing evolutionary algorithms. Some typical test problems are solved by this algorithm. The results show that new algorithm is better than existing evelutionary algorithm in the simplicity of structures, the robustness of algorithms, the accuracy of solutions and the wide range of applications.
Keywords:genetic algorithm  inequality constraint  function optimization problem
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号