| 基于遗传算法的多目标0-1背包问题优化模型 |
| |
| 引用本文： | 敖友云,迟洪钦. 基于遗传算法的多目标0-1背包问题优化模型[J]. 计算机工程与应用, 2006, 42(25): 44-45 |
| |
| 作者姓名： | 敖友云 迟洪钦 |
| |
| 作者单位： | 上海师范大学数理学院,上海,200234 |
| |
| 摘 要： | 多目标0-1背包问题是一个NP-complete的多目标优化问题,基于群体搜索机制的遗传算法非常适合多目标优化问题的求解。在著名的多目标优化遗传算法NSGA-II中,引入邻域搜索机制,并将其应用于多目标0-1背包问题的求解。数值实验表明,引入邻域搜索机制的NSGA-II算法在求解多目标0-1背包问题时表现出更好的性能。
|
| 关 键 词： | 遗传算法 多目标优化 背包问题 Pareto最优 |
| 文章编号： | 1002-8331-（2006）25-0044-02 |
| 收稿时间： | 2005-12-01 |
| 修稿时间： | 2005-12-01 |
Optimization Model Based on Genetic Algorithm for Multi-Objective 0-1 Knapsack Problems |
| |
| AO You-yun,CHI Hong-qin. Optimization Model Based on Genetic Algorithm for Multi-Objective 0-1 Knapsack Problems[J]. Computer Engineering and Applications, 2006, 42(25): 44-45 |
| |
| Authors: | AO You-yun CHI Hong-qin |
| |
| Affiliation: | Mathematics and Science College,Shanghai Normal University,Shanghai 200234 |
| |
| 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. |
| |
| Keywords: | Pareto |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
