期刊文献+

基于背包问题的散货航次方案优选方法研究 被引量:2

Optimal Voyage Selection of Bulk Cargo Shipping Based on Knapsack Problem
下载PDF
导出
摘要 针对散货航运市场的航次方案优选问题,使得公司能够在自身的能力约束下获得最大收益,最终目标是快速地在潜在的商业机会中找出最优的航次方案组合。通过调研定义了合理的航次收益、成本定量预估方法,在此基础上结合背包问题构建了航次方案优选模型,并进行改进,从而快速地求解航次方案优选问题,提高企业的核心竞争力。 Focusing on the research of method of optimal voyage selection to meet the specific needs of bulk cargo shipping,this paper analyzes how three factor of cargo,vessel and port influence the decision qualitatively and quantitatively.Then based on the knapsack problem,we create the corresponding optimal voyage selection model and define reasonable constraint rules to accelerate getting final results.
出处 《价值工程》 2011年第5期221-222,共2页 Value Engineering
关键词 航次预估 背包问题 航次优选 投资组合 Voyage Estimate Knapsack Problem Optimal Voyage Selection Investment Portfolio
  • 相关文献

参考文献5

  • 1谭威.基于VAR模型的干散货航运市场分析研究[R].大连大连海事大学,2005.
  • 2胡美芬,王义源.远洋运输业务[M].人民交通出版社,2009.29.
  • 3谭宇.船舶营运成本的分析与控制[R].大连:大连海事大学,2005:10.
  • 4谭锋,钟骏杰.船舶航次经营效益估算及计算机实现[J].中国水运(下半月),2009,9(11):66-68. 被引量:5
  • 5王晓东.算法设计与分析[M].清华大学出版社,2006:92.

共引文献5

同被引文献13

  • 1谢涛,陈火旺,康立山.二次背包问题的一种快速解法[J].计算机学报,2004,27(9):1162-1169. 被引量:4
  • 2B Chor, R Rivest. A knapsack-type public key cryptosystem based on arithmetic in finite fields[J]. IEEE Transactions on Information Theory,1988,34(5):901-909.
  • 3C Laih, J Lee, L Ham, et al. Linearly shift knapsack publickey cryptosystem[J]. IEEE Journal of Selected Areas Communication, 1989,7(4) : 534- 539.
  • 4D Yao, K Frikken, M Atallah, et al. Private information:to reveal or not to reveal[J]. ACM Transactions on Information and Systems Security, 2008, 12(1) :1-27.
  • 5Kong M,Tian P,Kao Y.A new ant colony optimization algorithm for the multidimensional Knapsack problem[J].Computers&Operations Research,2008,35(8):2672-2683.
  • 6Dorigo M,Maniezzo V,Colorni A.The ant system:opti-mization by a colony of cooperating agents[J].IEEE Trans on System,Man,and Cybernetics:Part B,1996,2(1):29-41.
  • 7Chu P C,Beasley J E.A genetic algorithm for the multi-dimensional knapsack problem[J].Journal of Heuristics,1998,4:63-86.
  • 8Leguizamon G,Michalewicz Z.A new version of Ant System for Subset Problem[C]//Congress on Evolutionary Computation,1999:1459-1464.
  • 9Parra-Hernandez R,Dimopoulos N.On the performance of the ant colony system for solving the multidimen-sional knapsack problem[C]//IEEE Pacific Rim Confer-ence on Communications,Computers and Sigal Process-ing.Piscataway NJ:IEEE Press,2003:338-341.
  • 10汪采萍,胡学钢,王会颖.基于蚁群算法的多维0-1背包问题的研究[J].计算机工程与应用,2007,43(30):74-76. 被引量:6

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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