首页> 外国专利> ENGINEERING OPTIMIZATION BY USING AN EXACT POLYNOMIAL ALGORITHM FOR THE 0/1 KNAPSACK PROBLEM

ENGINEERING OPTIMIZATION BY USING AN EXACT POLYNOMIAL ALGORITHM FOR THE 0/1 KNAPSACK PROBLEM

机译:0/1背包问题的精确多项式算法进行工程优化

摘要

An engineering optimization method based on an Exact Polynomial Algorithm forsolving of the0/1 Knapsack Problem is described. This method has a wide variety ofindustrial and scientificapplications including engineering design, naval, aerospace, internetsecurity, and computerscience, amongst others. The method searches the vast solution space for thefocused set ofPareto optimal alternatives. At each level of optimization it employs aforecasting procedure toeliminate the non-productive combinations of items with the weight sumexceeding the knapsackcapacity, a Pareto optimization procedure to eliminate non-optimal solutions,and a duplicateelimination procedure to exclude all but one of the combinations of items withthe identicalweights and values. This optimization approach tremendously reduces the scopeof the problemand provides an industrial engineer with an efficient tool to generate andcompare differentdesign solutions under some measurable restrictions.
机译:基于精确多项式算法的工程优化方法解决描述了0/1背包问题。这种方法有各种各样的工业和科学应用包括工程设计,海军,航空航天,互联网安全和计算机科学等等。该方法在广阔的解决方案空间中搜索集中的帕累托最优选择。在每个优化级别,它都会采用预测程序用权重之和消除项目的非生产性组合超过背包容量,用于消除非最优解的帕累托优化程序,和一个副本排除程序,排除以下项的组合之一相同的权重和价值。这种优化方法极大地缩小了范围问题的并为工业工程师提供了有效的工具来生成和比较不同在一些可测量的限制下设计解决方案。

著录项

  • 公开/公告号CA2714346A1

    专利类型

  • 公开/公告日2012-03-01

    原文格式PDF

  • 申请/专利权人 PETROUNEVITCH EDOUARD;

    申请/专利号CA20102714346

  • 发明设计人 PETROUNEVITCH EDOUARD;

    申请日2010-09-01

  • 分类号G06F17/11;

  • 国家 CA

  • 入库时间 2022-08-21 17:20:39

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号