首页 | 官方网站   微博 | 高级检索  
     

一种基于输运理论的多目标演化算法
引用本文:李康顺,李元香,康立山,吴志健.一种基于输运理论的多目标演化算法[J].计算机学报,2007,30(5):796-805.
作者姓名:李康顺  李元香  康立山  吴志健
作者单位:1. 江西理工大学信息工程学院,江西,赣州,341000;武汉大学软件工程国家重点实验室,武汉,430072;江西师范大学省高性能计算技术重点实验室,南昌,330022
2. 武汉大学软件工程国家重点实验室,武汉,430072
基金项目:国家自然科学基金 , 江西省教育厅科研项目 , 江西师范大学省高性能计算技术重点实验室基金
摘    要:提出了一种根据输运理论中的粒子输运方程、相空间能量定律和熵增法则构造的一种能够准确、高效地求解多目标优化问题的多目标演化算法(MOPEA).由于该算法使用了粒子系统从非平衡达到平衡的理论来定义求解多目标问题的Rank函数和Niche适应值函数,使得种群中的所有个体都有机会参与演化操作,以达到快速、均匀地求出多目标优化问题的Pareto最优解.数据实验显示,利用该算法求解多目标优化问题不仅能够使算法快速地收敛到全局Pareto前沿,同时由于该算法要求所有的粒子都要参与杂交和变异等演化操作,从而避免问题早熟现象的出现,并通过与传统演化算法的性能指标分析比较说明,使用该算法求解多目标优化问题具有明显的优越性.

关 键 词:多目标优化  演化算法  输运理论  Pareto前沿  输运理论  多目标演化算法  Theory  Transportation  Based  比较  指标分析  算法的性能  早熟现象  问题  变异  杂交  粒子  收敛  利用  显示  实验  数据  最优解  Pareto
修稿时间:2006-01-112006-08-24

A MOP Evolutionary Algorithm Based on Transportation Theory
LI Kang-Shun,LI Yuan-Xiang,KANG Li-Shan,WU Zhi-Jian.A MOP Evolutionary Algorithm Based on Transportation Theory[J].Chinese Journal of Computers,2007,30(5):796-805.
Authors:LI Kang-Shun  LI Yuan-Xiang  KANG Li-Shan  WU Zhi-Jian
Affiliation:1School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, Jiangxi 341000;2State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072;3Provincial Key Laboratory of High-Performance Computing Technology, Jiangxi Normal University, Nanchang 330022
Abstract:In this paper a Multi-objective Optimization Problems Evolutionary Algorithm,MOPEA,for solving multi-objective optimization problems precisely and efficiently is presented according to the equation of particle transportation and the principle of energy decreasing and the law of entropy increasing in phase space of particles based on transportation theory.In the algorithm,the theory of particle system changing from non-equilibrium to equilibrium is used to define the Rank function and Niche function for solving multi-objective problems,all the individuals in the population have chance to participate the evolving operation to solve the Pareto optimal solutions of the multi-objective problems fast and evenly.The experiments show that this algorithm can not only converge to global Pareto optimal front fast and precisely,but also can avoid premature phenomenon of multi-objective problems because the algorithm requires all the particles in the phase space to cross and mutate simultaneously.Through analyzing the performance indices of evolutionary algorithms it illustrates that this algorithm have more advantages than traditional evolutionary algorithms.
Keywords:multi-objective optimization problems  evolutionary algorithm  transportation theory  Pareto front
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号