ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2015, Vol. 52 ›› Issue (12): 2813-2823.doi: 10.7544/issn1000-1239.2015.20148025

• 人工智能 • 上一篇    下一篇

基于双种群的约束多目标优化算法

毕晓君1, 张磊1, 肖婧2   

  1. 1(哈尔滨工程大学信息与通信工程学院 哈尔滨 150001); 2(大连民族大学信息与通信工程学院 辽宁大连 116000)(zl12306124@163.com)
  • 出版日期: 2015-12-01
  • 基金资助: 
    国家自然科学基金项目(61175126);中央高校基本科研业务费专项资金项目(HEUCFZ1209);教育部高等学校博士学科点专项科研基金项目(20112304110009);黑龙江省博士后基金项目(LBH-Z12073);辽宁省博士科研启动基金项目(201205118);辽宁省教育厅科学技术研究项目(L2012458)

Constrained Multi-Objective Optimization Algorithm Based on Dual Populations

Bi Xiaojun1, Zhang Lei1, Xiao Jing2   

  1. 1(College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001); 2(College of Information and Communication Engneering, Dalian Nationalities University, Dalian, Liaoning 116000)
  • Online: 2015-12-01

摘要: 为提高约束多目标优化算法的分布性和收敛性,提出一种基于双种群的约束多目标优化算法.首先,改进的Harmonic距离一方面去除了Pareto等级较差个体和较远个体的影响,从而改善可行解集的分布性;另一方面有效减少了计算量,可以提高算法效率.其次,新的不可行解集更新方式与可行解集紧密联系,保留目标函数值和约束违反度同时较优的个体,将有助于产生更优可行解,同时提高了种群的多样性和搜索效率.最后,新的变异策略充分利用最优可行解和优秀不可行解的优良信息来引导种群进化,很好地兼顾了探索和开发能力,进而平衡全局搜索和局部搜索.将提出算法与其他3种优秀的约束多目标进化算法在CTP测试集上进行对比实验,结果表明提出算法相比其他算法具有一定的优势,不仅提升了算法的收敛性能,而且保证了Pareto解集良好的分布性.

关键词: 约束多目标优化, Harmonic距离, 不可行解集, 变异策略, 分布性, 收敛性

Abstract: In order to improve the distribution and convergence of constrained multi-objective optimization algorithms, this paper proposes a constrained multi-objective optimization algorithm based on dual populations. The improved Harmonic distance eliminates the effect of the individuals whose Pareto grade is weak and distance is far, consequently the distribution of population can be enhanced. Also it reduces the amount of calculation effectively and improves the efficiency of the suggested algorithm. Then, the new update method of the infeasible solution set is closely linked with the feasible solution set, and these infeasible individuals both the objective function value and the constraint violation are excellent can be retained, so the better feasible individuals will be produced in the following evolution process, and the diversity of the populations and the search efficiency are improved simultaneously. Finally, the new variation strategy makes full use of the information of the best feasible individuals and the good infeasible individuals, which ensures the good ability of exploration and exploitation and balances the global and local search. The proposed algorithm is compared with 3 state-of-the-art constrained multi-objective optimization algorithms on CTP test problems. Simulation results show that the presented algorithm has certain advantages than other algorithms because it can ensure good convergence while it has uniform distribution.

Key words: constrained multi-objective optimization, Harmonic distance, infeasible solution set, mutation strategy, distribution, convergence

中图分类号: