A partition-based heuristic algorithm for the rectilinear block packing problem

DOI10.15807/JORSJ.59.110MaRDI QIDQ2829376zbMATH OpenOpenAlexFDO

Authors Y. Hu, Takeaki Uno, Shinji Imahori, Mutsunori Yagiura

Publication date 27 October 2016

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.59.110

zbMATH Keywords

combinatorial optimizationgroup-mannerstrip packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient implementations of construction heuristics for the rectilinear block packing problem
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• A recursive heuristic algorithm for 2D rectangular strip packing problems
• A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
• Computational Science – ICCS 2005

Cited in

(4)

• 4-block heuristic for the rectangle packing problem
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Efficient implementations of construction heuristics for the rectilinear block packing problem
• Efficient overlap detection and construction algorithms for the bitmap shape packing problem

This page was built for publication: A partition-based heuristic algorithm for the rectilinear block packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829376)