Scholarlink

<p>This paper presents a novel approach to the two-dimensional orthogonal rectangular strip packing problem (2D-SPP), focusing on arranging rectangular items on a strip of fixed width to minimize the total height. We extend the recently proposed novel neural-based constructive heuristic by integrating a local search strategy that explores the space of heuristics, encoded as neural network weights, rather than the solution space. Utilizing the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for both training and problem-specific refinement, our method dynamically learns and optimizes placement decisions. We introduce benchmarking datasets inspired by real-world fast-moving consumer goods (FMCG) logistics, demonstrating the approach’s efficacy. Experimental results show that our refined constructive heuristic (RCH) significantly outperforms traditional heuristics like MaxRects and Skyline, and achieves up to tenfold reductions in wasted space compared to constraint programming for larger, heterogeneous instances. The proposed method offers scalability and adaptability, making it particularly suited for practical applications in logistics and manufacturing.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Improving neural-based heuristics for 2D strip packing through local search in heuristic space

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月22日

查看全文
  • Mariusz Kaleta,
  • Tomasz Śliwiński

摘要

This paper presents a novel approach to the two-dimensional orthogonal rectangular strip packing problem (2D-SPP), focusing on arranging rectangular items on a strip of fixed width to minimize the total height. We extend the recently proposed novel neural-based constructive heuristic by integrating a local search strategy that explores the space of heuristics, encoded as neural network weights, rather than the solution space. Utilizing the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for both training and problem-specific refinement, our method dynamically learns and optimizes placement decisions. We introduce benchmarking datasets inspired by real-world fast-moving consumer goods (FMCG) logistics, demonstrating the approach’s efficacy. Experimental results show that our refined constructive heuristic (RCH) significantly outperforms traditional heuristics like MaxRects and Skyline, and achieves up to tenfold reductions in wasted space compared to constraint programming for larger, heterogeneous instances. The proposed method offers scalability and adaptability, making it particularly suited for practical applications in logistics and manufacturing.