检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统仿真学报》2005年第10期2383-2387,共5页Journal of System Simulation
基 金:国家自然科学资金(60175018);安徽省青年教师资助项目(2004jq108);安徽大学人才队伍建设经费资助
摘 要:演化算法(EA)是求解多目标优化问题(MOP)重要而有效的方法,而应用演化策略、技巧是改善解性能的重要途径。作者叙述了多目标优化问题的有关概念,结合已有算法中的方法,设计了基于两种交叉操作相互结合的多目标演化算法(MOEADC),并且分析相关性能。该算法不仅具有较高的计算效率,而且具有较好的收敛性能,并且运用了有关方法维护了解集的分布性能。算例结果表明该算法的良好性能。Evolutionary algorithm is a main and effective method solving a multi-objective optimization problem (MOP). It is a significant approach, in which solutions' performance of MOP is improved, by using all kinds of evolutionary strategies and techniques. Some concepts about a multi-objective optimization problem were described, and with some operators in several noted algorithms, a multi-objective evolutionary algorithm based on double crossover was designed, and relevant performances were analyzed. The proposed algorithm is not only computationally efficient, but also has good convergence performance, and some method is also applied to maintain solutions' diversity. The experiment shows it performs well.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.127