Population Decomposition-Based Greedy Approach Algorithm for the Multi-Objective Knapsack Problems
Population Decomposition-Based Greedy Approach Algorithm for the Multi-Objective Knapsack Problems
复制标题
基于群体分解的多目标背包问题贪心算法
DOI:
10.1142/s0218001417590066
复制
发表时间:
2017-02
期刊:
影响因子:
--
通讯作者:
Chaoda Peng
中科院分区:
文献类型:
--
作者:
Jiawei Yuan;Hai-Lin Liu;Chaoda Peng
Despite the effectiveness of the decomposition-based multi-objective evolutional algorithm (MOEA/D-M2M) in solving continuous multi-objective optimization problems (MOPs), its performance in addressing 0/1 multi-objective knapsack problems (MOKPs) has not been fully explored. In this paper, we use MOEA/D-M2M with an improved greedy repair strategy to solve MOKPs. It first decomposes an MOKP into a number of simple optimization subproblems and solves them in a collaborative way. Each subproblem has its own subpopulation, and then an improved greedy strategy is introduced to improve the performance of the proposed algorithm on MOKPs. Therein, a weight vector chosen randomly from a corresponding subpopulation is utilized to repair infeasible individuals or improve feasible individuals to have a better fitness, which improves the convergence of the population. Experimental studies on a set of test instances indicate that the MOEA/D-M2M with the improved greedy strategy is superior to MOGLS and MOEA/D in terms...
登录
查看更多内容
DOI:
10.1016/j.ejor.2013.11.032
发表时间:
2014-07
期刊:
Eur. J. Oper. Res.
影响因子:
--
作者:
Aiying Rong;J. Figueira
通讯作者:
Aiying Rong;J. Figueira
影响因子:
4.8
作者:
A. Fukunaga
通讯作者:
A. Fukunaga
DOI:
10.1109/icec.1996.542345
发表时间:
1996-05
期刊:
Proceedings of IEEE International Conference on Evolutionary Computation
影响因子:
--
作者:
H. Ishibuchi;T. Murata
通讯作者:
H. Ishibuchi;T. Murata
影响因子:
4.1
作者:
Gu, Fangqing;Liu, Hai-Lin;Tan, Kay Chen
通讯作者:
Tan, Kay Chen
DOI:
10.1007/3-540-45356-3_82
发表时间:
2000-09
期刊:
--
影响因子:
--
作者:
D. Corne;Joshua D. Knowles;M. Oates
通讯作者:
D. Corne;Joshua D. Knowles;M. Oates