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

一种多目标多约束问题的优化算法研究
引用本文:蒋伟进,彭召意,许宇胜,孙星明. 一种多目标多约束问题的优化算法研究[J]. 控制工程, 2004, 11(4): 360-363
作者姓名:蒋伟进  彭召意  许宇胜  孙星明
作者单位:株洲工学院,计算机系,湖南,株洲,412008;北京工业大学,机电学院,北京,100022
基金项目:国家自然科学基金资助项目(60373062 10271100),湖南省杰出中青年专家科技基金资助项目(02JJYB012),教育部重点科研基金资助项目(02A056)
摘    要:针对优化设计中常见的多目标多约束优化问题,提出了一种求解新方法:利用KS函数的凝聚特性,将优化问题中的全部或部分约束凝聚为一个近似的、逼近精度仅由一个参数控制的约束,然后,再对约束压缩后的优化问题选用适当的约束优化方法求解。仿真结果表明,由于压缩了求解规模,此法收敛稳定且速度快,用于求解一类多目标多约束优化问题具有很好的效果。

关 键 词:多约束优化问题  KS函数  可行域  凝聚算法
文章编号:1671-7848(2004)04-0360-04
修稿时间:2004-03-25

On Solving Problems of Multi-object and of Multi-constraint Optimization
JIANG Wei-jin,PENG Zhao-yi,XU Yu-sheng,SUN Xing-ming. On Solving Problems of Multi-object and of Multi-constraint Optimization[J]. Control Engineering of China, 2004, 11(4): 360-363
Authors:JIANG Wei-jin  PENG Zhao-yi  XU Yu-sheng  SUN Xing-ming
Abstract:Aimed at the common problems of multi-constraint optimization in optimal design of machinery, a new kind of solving method is presented. By using the agglomeration features of KS function, the total or partial constraints of optimization problems are agglomerated to an approximate and constraint whose precision is controlled by one parameter only. And then a proper constraint optimization method is chosen to solve the optimal problem after the compression of constraints. The geometric explanation of constraints agglomeration is presented by an example of feasible region figure in three dimensional space.
Keywords:multi-constraints optimization problem  KS function  feasible region  agglomeration algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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