期刊文献+

0/1背包问题竞争决策算法 被引量:12

Competitive decision algorithm for 0/1-knapsack problem
下载PDF
导出
摘要 竞争决策算法是在分析大自然生物世界特别是人类的各种竞争机制和决策原理的基础上,利用竞争造就优化、决策左右结果的特性来到达优化目的的新型寻优算法。在考虑0/1背包问题特点的基础上给出了用竞争决策算法求解0/1背包问题的算法,经过大量数据测试和验证,获得了较好的结果。 Competitive decision algorithm is a new optimization algorithm based on the analysis of the mechanism of natural competitions and the principle of decision.lt uses the characteristics that competition builds optimisation and the result of competition hinges on decision.Based on some mathematical structure of 0/1-knapsack problem,this paper provides a competitive decision algorithm for 0/1-knapsack problem.We use this algorithm to solve many instances of 0/1-knapsack problems and computational result results in good performances.
作者 宁爱兵 马良
出处 《计算机工程与应用》 CSCD 北大核心 2008年第3期14-16,38,共4页 Computer Engineering and Applications
基金 国家自然科学基金(the National Natural Science Foundation of China under Grant No.70471065) 上海市高校选拔培养优秀青年教师科研专项基金(Shanghai Scientific Special Funds For Cultivation and Selection of Excellent Young Teaching Staffs of Higher Education under Grant No.21012) 上海市教委科技发展基金(Science and Technology Development Funds of Shanghai Education Commission under Grant No.05EZ31) 上海市重点学科建设项目(Shanghai Leading Academic Discipline Project under Grant No.T0502)
关键词 竞争决策算法 0/1背包问题 竞争力函数 决策函数 资源交换规则 竞争决策均衡 competitive decision algorithm 0/1-knapsack problem competitive force function decision function resources exchangerule competitive decision equilibrium
  • 相关文献

参考文献12

二级参考文献59

  • 1MA Liang, WANG Long de College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China.Artificial Ant Algorithm for Constrained Optimization[J].Journal of Systems Science and Systems Engineering,2001,13(1):57-61. 被引量:8
  • 2陈珽.决策分析[M].北京:科学出版社,1987..
  • 3马良.中国144城市TSP的蚂蚁搜索算法[J].计算机应用研究,2000,17(1):36-37.
  • 4马良,计算机应用研究,2000年,17卷,1期,36页
  • 5Ma Liang,J Syst Sci Syst Eng,1999年,8卷,3期,335页
  • 6Ma Liang,Proc'99 Int Conf Management Science Engineering,1999年,448页
  • 7Syslo M M et al. Discrete Optimization Algorithms[M].Englewood Cliffs,New Jersey:Prentice-Hall,Inc,1983:370~373.
  • 8Laport G.The Travelling Salesman Problem:An Overview of Exact and Approximate Algorithms[J].European J of Operational Research,1992;59(2) :231~247.
  • 9约翰·H·霍兰著 周小牧 韩晖译.隐秩序-适应性造就复杂性[M].上海:上海科技教育出版社,2000..
  • 10Syslo M M. Discrete optimization algorithrns[M].Englewood Cliffs :Prentice-Hall, 1983. 118-165.

共引文献132

同被引文献90

引证文献12

二级引证文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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