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

求解复杂约束优化问题的演化多目标算法
引用本文:覃俊,康立山.求解复杂约束优化问题的演化多目标算法[J].中南民族大学学报(自然科学版),2004,23(1):66-68.
作者姓名:覃俊  康立山
作者单位:1. 中南民族大学计算机科学学院,武汉,430074
2. 武汉大学软件工程国家重点实验室,武汉,430074
摘    要:在分析了传统的求解带约束的单目标优化问题存在的问题的基础上,利用多目标优化算法的框架,把单目标优化问题中的软性约束化为新增的目标,把原问题化为一个多目标优化问题,然后利用演化多目标优化算法求解转化后的问题,分析了该方法处理约束的优势,并给出了初步实验结果.

关 键 词:多目标优化  带约束的单目标优化  约束处理
文章编号:1672-4321(2004)01-0066-03
修稿时间:2003年11月17

An Evolutionary Multi-Objective Optimization Algorithm for Single-Objective Optimization Problem with Constraints
Qin Jun Assoc Prof,College of Computer Science,SCUFN,Wuhan ,China Kang Lishan.An Evolutionary Multi-Objective Optimization Algorithm for Single-Objective Optimization Problem with Constraints[J].Journal of South-Central Univ for,2004,23(1):66-68.
Authors:Qin Jun Assoc Prof  College of Computer Science  SCUFN  Wuhan  China Kang Lishan
Institution:Qin Jun Assoc Prof,College of Computer Science,SCUFN,Wuhan 430074,China Kang Lishan
Abstract:Some drawbacks, which exist in traditional methods to solve single objective optimism problem with constraints, are presented . And a new technique, which transforms original single objective optimism problem with constraints to multi objective optimism problem without constraints, is given. This method provides the decision makers more than one solution . An evolutionary multi objective optimism algorithm(EMOA) to solve the transformed problem is discussed and an initial experiment is given, too.
Keywords:multi  objective optimization  single  objective with constraints  constraint handling
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《中南民族大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《中南民族大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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