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

一种离散型多目标粒子群优化算法
引用本文:杨晓燕.一种离散型多目标粒子群优化算法[J].莆田学院学报,2010,17(2):61-65.
作者姓名:杨晓燕
作者单位:闽江学院,计算机科学系,福建,福州,350108
基金项目:福建省自然科学基金,闽江学院科技育苗项目 
摘    要:为获得更好的非劣前端,提出一种离散型多目标粒子群优化算法。该算法根据离散型多目标优化问题的特点,将种群分成多个子种群,在各个子种群中利用表现型共享的适应度函数选择每个子种群的最优粒子。通过多个最优粒子的引导,使整个种群分布更均匀,避免陷入局部最优,保证了解的多样性。实验表明了该算法的有效性。

关 键 词:多目标优化问题  粒子群优化算法  表现型共享

A Discrete Multi-objective Particle Swarm Optimization Algorithm
YANG Xiao-yan.A Discrete Multi-objective Particle Swarm Optimization Algorithm[J].journal of putian university,2010,17(2):61-65.
Authors:YANG Xiao-yan
Institution:Computer Science Department/a>;Minjiang University/a>;Fuzhou Fujian 350108/a>;China
Abstract:To obtain a better approximation of true Pareto front,a discrete multi-objective particle swarm optimization(PSO) algorithm is proposed in this paper.According to the features of discrete multi-objective optimizaion problem(MOP),an evolutionary swarm is divided into several subswarms and a fitness function based on phenotype sharing is introduced to select the optimal particle for each subswarm.By the guidance of multiple optimal particles,the whole particle swarm is distributed uniformly and avoided local ...
Keywords:multi-objective optimization problem  particle swarm optimization  phenotype sharing  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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