Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem

DOI10.13328/J.CNKI.JOS.005100MaRDI QIDQ4640958zbMATH OpenFDO

Authors

Publication date 25 May 2018

zbMATH Keywords

fitnessheuristic search algorithmbin packing problemfixed-size

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
• Sequential heuristic for the two-dimensional bin-packing problem

Cited in

(1)

• A beam search approach to solve the convex irregular bin packing problem with guillotine guts

This page was built for publication: Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem

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