首页> 外文会议>Evolutionary computation in combinatorial optimization >A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic
【24h】

A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic

机译:提前启发式中块重定位问题和收益的新二进制描述

获取原文
获取原文并翻译 | 示例

摘要

We discuss the blocks relocation problem (BRP), a specific problem in storing and handling of uniform blocks like containers. The BRP arises as an important subproblem of major logistic processes, like container handling on ships or bays, or storing of palettes in a stacking area. Any solution method for the BRP has to work with the stacking area and needs to draw relevant information from there. The strength of related approaches may rely on the extensive search of neighborhood structures. For an efficient implementation, fast access to data of the current stacking area and an efficient transformation into neighboring states is needed. For this purpose, we develop a binary description of the stacking area that fulfills the aforementioned requirements. We implement the binary representation and use it within a look ahead heuristic. Comparing our results with those from literature, our method outperforms best known approaches in terms of solution quality and computational time.
机译:我们讨论了块重定位问题(BRP),这是在存储和处理统一块(如容器)中的特定问题。 BRP是主要物流流程的一个重要子问题,例如在船上或海湾上的集装箱装卸,或在堆放区中存放货盘。 BRP的任何解决方法都必须与堆叠区域配合使用,并且需要从那里获取相关信息。相关方法的优势可能取决于对邻域结构的广泛搜索。为了有效地实现,需要快速访问当前堆叠区域的数据并有效地转换为相邻状态。为此,我们开发了满足上述要求的堆叠区域的二进制描述。我们实现二进制表示形式,并在前瞻性启发式算法中使用它。将我们的结果与文献中的结果进行比较,我们的方法在解决方案质量和计算时间方面均胜过最著名的方法。

著录项

  • 来源
  • 会议地点 Tubingen(DE);Tubingen(DE)
  • 作者单位

    University of Hamburg, Institute of Information Systems,Von-Melle-Park 5, 20146 Hamburg, Germany;

    University of Hamburg, Institute of Information Systems,Von-Melle-Park 5, 20146 Hamburg, Germany;

    University of Hamburg, Institute of Information Systems,Von-Melle-Park 5, 20146 Hamburg, Germany;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 理论、方法;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号