节点文献
一种改进快速稳定的多目标优化算法
Improved Fast Robust PSO Multi-objective Algorithm
【摘要】 多目标优化问题属于高维的搜索空间,用一些传统方法来优化这些问题会导致较高的时间复杂性。为了解决该问题,使用了粒子群优化算法(PSO),同时将-εdom inance的概念应用到PSO中。该方法在实验过程中取得了良好的效果。其运算速度快,而且最终优化的点数可以得到控制。
【Abstract】 Multi-bbjective optimization problems always have large and complex search space.Using traditional exact methods solve multi-objective problems may results high time-complex.To solve the problem,the Particle Swarm Optimization(PSO) algorithm was used.The algorithm used ε-dominance method.During experiment,it has better results than CMOPSO,at the same time,it runs fast,and the optimal solutions can be controlled.
【关键词】 多目标优化;
粒子群算法;
ε支配多目标优化;
【Key words】 multi-objective optimization; particle swarm optimization algorithm; ε-dominance multi-objective optimization;
【Key words】 multi-objective optimization; particle swarm optimization algorithm; ε-dominance multi-objective optimization;
【基金】 国家“863”计划资助项目(2002AA1Z1490)
- 【文献出处】 计算机应用研究 ,Application Research of Computers , 编辑部邮箱 ,2007年04期
- 【分类号】TP301.6
- 【被引频次】13
- 【下载频次】361