...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation
【24h】

Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation

机译：用进化粒子群算法求解无方向性二维装箱问题

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

摘要

The non-oriented two-dimensional bin packing problem (NO-2DBPP) deals with a set of integer sized rectangular pieces that are to be packed into identical square bins. The specific problem is to allocate the pieces to a minimum number of bins allowing the pieces to be rotated by 90° but without overlap. In this paper, an evolutionary particle swarm optimisation algorithm (EPSO) is proposed for solving the NO-2DBPP. Computational performance experiments of EPSO, simulating annealing (SA), genetic algorithm (GA) and unified tabu search (UTS) using published benchmark data were studied. Based on the results for packing 3000 rectangles, EPSO outperformed SA and GA. In addition; EPSO results were consistent with the results of UTS indicating that it is a promising algorithm for solving the NO-2DBPP.
机译：无方向性二维装箱问题（NO-2DBPP）处理一组整数大小的矩形块，这些矩形块将被包装到相同的正方形箱中。具体的问题是将零件分配到最小数量的箱中，以允许零件旋转90°但没有重叠。本文提出了一种进化粒子群算法（EPSO）来求解NO-2DBPP。利用已发布的基准数据，对EPSO的计算性能实验，模拟退火（SA），遗传算法（GA）和统一禁忌搜索（UTS）进行了研究。根据包装3000个矩形的结果，EPSO的性能优于SA和GA。此外; EPSO结果与UTS结果一致，表明它是解决NO-2DBPP的有前途的算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号