期刊文献+

用基于快速排序的MOGA求解MOKP 被引量:1

Solving 0/1 Multi-objective Knapsack Problem by Multi-objective Genetic Algorithm Based On Quick Sort
下载PDF
导出
摘要 0/1背包问题是一类典型的组合优化问题,且属于NP完全问题.多目标遗传算法通过一次运行可以搜索到多个解,同时具有比规范遗传算法更强的求解问题的能力.该文将基于快速排序的多目标遗传算法应用于多目标0/1背包问题中,可以快速、高效地找出多个最优解.实验表明该方法能够获得满意的效果. 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.
出处 《湘潭大学自然科学学报》 CAS CSCD 北大核心 2005年第2期50-53,65,共5页 Natural Science Journal of Xiangtan University
基金 国家自然科学基金资助项目(90104021) 湖南省自然科学基金资助项目(01JJY2060)
关键词 多目标遗传算法 多目标优化 非支配集 0 l背包问题 Multi-objective genetic algorithm Multi-objective optimization Non-dominated set knapsack problem
  • 相关文献

参考文献9

  • 1Hanafi S, Freville A. An efficient tabu search approach for the O-1 multidimensional knapsack problem[J].European Journal of Operational Research.1997.
  • 2刘勇 康立山 陈毓屏.非数值并行算法[M].北京:科学出版社,1995..
  • 3Hoff A,Lokketangen A, Mittet I. Genetic Algorithms for 0/1 Multidimensional Knapsack Problems[R].Molde College Britveien Molde Norway,1996.
  • 4Corne D W,Jerran N R, Knowles and Oates M J. PESA- : Region- based selection in evolutionary multibojective optimizition[A]. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001 )[C].Morgan Kaufmann Publishers,2001.283-290.
  • 5Knowles J D, Corne D W. Approximating the nondominated front using the pareto archived evolution strategy[J]. Evol Comput, 2000,8:149 - 172.
  • 6Zitzler E. SPEA2: Improving the strength Pareto evolutionary algorithm, fir multiojeotive optimization[A].Giannakoglou K C. Proc EUROGEN 2001 - Evoluctionary Methods for Desion. Optimixation and Control with Applications to Undustrial Problems[C]. 2001,95 - 100.
  • 7Kalyanmoy Deb, Amrit Pratap, Sameer Agrawal,et al. A Fast and Elitist Multi - objective Genetic Algorithm : NSGA -Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002,6(2) : 182 - 197.
  • 8Zheng Jinhua, Charles X Ling, Shi Zhongzhi, Xie Yong. Some Discussions about MOGAs.: Individual Relations, Non - dominated Set,and Application on Automatic Negotiation [A]. Congress on Evolutionary Computation[C]. 2004.
  • 9.[EB/OL].http://www.tik. ee. ethz. ch/zitzler/testdata, html/[ OL ].,.

共引文献3

同被引文献7

  • 1Kalyanmoy Deb, Amrit Pratap, Sameer Agrawal, et al. A Fast and Elitist Multi-objective Genetic Algorithm: NSGA-II [ J ]. IEEE Transactions on Evolutionary Computation ,2002,6 ( 2 ) : 182 - 197.
  • 2Zheng Jinhua, Charles X Ling, Shi Zhongzhi, Xie Yong. Some Discussions about MOGAs : Individual Relations, Non-dominated Set, and Application on Automatic Negotiation [ A ]. Congress on Evolutionary Computation [ C ] ,2004.
  • 3Corne D W,Jerran N R,Knowles,Oates M J. PESA-:Region-based selection in evolutionary multibojective optimizition [ A ]. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO- 2001 ) [ C]. Morgan Kaufmann Publishers,2001:283 -290.
  • 4Schippers C A. Multi-Parent Scanning Crossover and Genetic Drift. A. E. Eiben. Multiparent Recombination in evolutionary computing[ J]. In Ghosh A ,Tsutsui S, editors. Advances in Evolutionary Computing, Natural Computing Series, Springer ,2002, 175 - 192.
  • 5Tsutsui S, Yamamura M, Higuchi T. Multi-parent recombination with simplex crossover in real-coded genetic algorithms [C]. Proc. of the GECCO - 99,1999.657 - 664.
  • 6Schippers C A. Multi - Parent Scanning Crossover and Genetic Drift [ M ]. Theoretical Aspects of Evolutionary Computing, Berlin: Springer, 2001.307 - 330.
  • 7Tsutsui S, Yamamura M, Higuchi T. Multi-parent recombination with simplex crossover in real coded genetic algorithms[C]. Proceedings of th Genetic and Evolutionary Computation Conference, 1999,657 -664.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部