首页> 外文会议>Computer Science and Information Technology, 2008 International Multiconference on >Two stages optimization problem: New variant of Bin Packing Problem for decision making
【24h】

Two stages optimization problem: New variant of Bin Packing Problem for decision making

机译:两个阶段的优化问题:用于决策的装箱问题的新变体

获取原文

摘要

In this paper, we present a new multi-criteria assignment problem that groups characteristics from the well known Bin Packing Problem (BPP) and Generalized Assignment Problem (GAP). Similarities and differences between these problems are discussed, and a new variant of BPP is presented. The new variant will be called generalized assignment problem with identified first-use bins (GAPIFB). The GAPIFB will be used to supply decision makers with quantitative and qualitative indicators in order to optimize a business process. An algorithm based on the GAP problem model and on GAPIFB is proposed.
机译:在本文中,我们提出了一种新的多标准分配问题,即从已知的垃圾箱包装问题(BPP)和广义分配问题(间隙)组的特征。讨论了这些问题之间的相似性和差异,并提出了一种新的BPP变体。新变种将被称为识别的首次使用箱(GapIFB)称为广义分配问题。 GAPIFB将用于提供具有定量和定性指标的决策者,以优化业务流程。提出了一种基于GAP问题模型和GAPIFB的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号