Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem
Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem
复制标题
比较多目标 0/1 背包问题的表示和重组算子
DOI：
10.1109/cec.2003.1299756
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
C. Mumford
中科院分区：
文献类型：
--
作者：
C. Mumford
多背包问题(MKP)是研究人员开发基于Pareto的新的多目标进化算法的热门试验台。我们探索了MKP的一系列不同的表示和运算符，它们是从单一的客观情况改编而来的。结果表明，对于本文所讨论的问题实例，基于顺序的方法优于二进制表示。
The multiple knapsack problem (MKP) is a popular test-bed for researchers developing new Pareto-based multiobjective evolutionary algorithms. We explore a range of different representations and operators for the MKP, which have been adapted from the single objective case. Results indicate that order-based approaches are superior to binary representations for the problem instances considered here.