...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>The Kasetsart Journal >A Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
【24h】

A Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem

机译：混合遗传算法和禁忌搜索法求解不规则形状带状包装问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like regular genetic algorithms. After that, a hybrid method is self adapting until it behaves like a tabu search. This paper compares results generated by a hybrid method with genetic algorithms and tabu search. The experiment data is the 13 pieces convex-type polygon and duplicate, triplicate and quadruplicate. The experiment shows that a hybrid method generates better result than genetic algorithms about 2.56% to 4.69% and a hybrid method generates better result than tabu search about 0.26% to 2.78%.
机译：本文提出了一种用于解决不规则形状的条形包装问题的包装算法。多边形以条带材料包装，这限制了条带宽度但不限制条带长度。打包算法的目的是使存储箱长度最小化。本文提出了一种遗传算法和禁忌搜索的混合方法来解决包装问题。最初，混合方法的行为类似于常规遗传算法。此后，混合方法会自我适应，直到表现得像禁忌搜索一样。本文将混合方法与遗传算法和禁忌搜索生成的结果进行比较。实验数据为13个凸型多边形，一式三份，一式三份，一式四份。实验表明，混合方法比遗传算法产生的结果更好，约为2.56％至4.69％，混合方法比禁忌搜索产生的结果更好，约为0.26％至2.78％。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号