同济大学学报（自然科学版）2011，Vol.39Issue(8)：1222-1226,5.DOI:10.3969/j.issn.0253-374x.2011.08.023
动态拓扑结构的多目标粒子群优化算法
Dynamical Topology Multi-objective Particle Swarm Optimization Algorithm
摘要
Abstract
The paper presents a dynamical topology multi-objective particle swarm optimization (DMPSO) algorithm and a definition of the degree of domain and congestion and discrepancy of particles as well as a strategy of renewing archives which depends on the degree of domain and congestion around neighborhood. So the diversity and uniformity of solution are enhanced. In order to overcome the premature convergence, a new imitating small world dynamical topology strategy based on congestion degree and discrepancy degree is applied to balancing the ability of global searching and local searching. In the end, the application successfully to engineering shows that the DMPSO is feasible and effective.关键词
多目标粒子群优化/拟小世界动态拓扑/支配度拥挤度Key words
multi-objective particle swarm optimization (MPSO)/ imitating small world dynamical topology/ domain degree/ congestion degree分类
计算机与自动化引用本文复制引用
任子晖,王坚..动态拓扑结构的多目标粒子群优化算法[J].同济大学学报（自然科学版）,2011,39(8):1222-1226,5.基金项目
国家自然科学基金重大研究计划集成项目(91024131) （91024131）
“十一五”国家科技支撑计划(2006BAG01A02) （2006BAG01A02）
上海市科技发展基金(08201201905,08DZ1120802) （08201201905,08DZ1120802）
