【摘要】 多目标0-1背包问题是一个NP-complete的多目标优化问题,基于群体搜索机制的遗传算法非常适合多目标优化问题的求解。在著名的多目标优化遗传算法NSGA-II中,引入邻域搜索机制,并将其应用于多目标0-1背包问题的求解。数值实验表明,引入邻域搜索机制的NSGA-II算法在求解多目标0-1背包问题时表现出更好的性能。更多还原

【Abstract】 Multi-objective 0-1 knapsack problem is an NP-complete multi-objective optimization problem.Population-based genetic algorithm is well-suited for multi-objective optimization problems.In the famous algorithm NSGA-II,the neighborhood search is introduced.The numerical experimental results show that NSGA-II with the neighborhood search can outperform NSGA-II applied to multi-objective 0-1 knapsack problems.更多还原