| 用基于快速排序的MOGA求解MOKP |
| |
| 引用本文： | 唐欢容,郑金华,蒋浩.用基于快速排序的MOGA求解MOKP[J].湘潭大学自然科学学报,2005,27(2):50-53,65. |
| |
| 作者姓名： | 唐欢容 郑金华 蒋浩 |
| |
| 作者单位： | 湘潭大学信息工程学,湖南,湘潭,411105 |
| |
| 基金项目： | 国家自然科学基金资助项目(90104021)，湖南省自然科学基金资助项目(01JJY2060) |
| |
| 摘 要： | 0/1背包问题是一类典型的组合优化问题,且属于NP完全问题.多目标遗传算法通过一次运行可以搜索到多个解,同时具有比规范遗传算法更强的求解问题的能力.该文将基于快速排序的多目标遗传算法应用于多目标0/1背包问题中,可以快速、高效地找出多个最优解.实验表明该方法能够获得满意的效果.
|
| 关 键 词： | 多目标遗传算法 多目标优化 非支配集 0/1背包问题 |
| 文章编号： | 1000-5900(2005)02-0050-04 |
Solving 0/1 Multi-objective Knapsack Problem by Multi-objective Genetic Algorithm Based On Quick Sort |
| |
| TANG Huan-rong,ZHENG Jin-hua,JIANG Hao.Solving 0/1 Multi-objective Knapsack Problem by Multi-objective Genetic Algorithm Based On Quick Sort[J].Natural Science Journal of Xiangtan University,2005,27(2):50-53,65. |
| |
| Authors: | TANG Huan-rong ZHENG Jin-hua JIANG Hao |
| |
| Abstract: | The 0/1 knapsack problem is a well known combinatorial problem which is NP-Complete. As multi-objective genetic algorithm can find multiple solutions in a single simulation run and have stronger faculty to solve problem than CGA(Canonical Genetic Algorithm), we apply fast MOGA based on quick sort to knapsack problem and find out multiple optimal solutions faster and more efficiently. Experimental results show that the processing scheme generates desirable results. |
| |
| Keywords: | Multi-objective genetic algorithm Multi-objective optimization Non-dominated set knapsack problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
