Efficient implementations of construction heuristics for the rectilinear block packing problem

DOI10.1016/J.COR.2014.06.021MaRDI QIDQ337284zbMATH OpenOpenAlexFDO

Authors Y. Hu, Shinji Imahori, Mutsunori Yagiura

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.06.021

zbMATH Keywords

strip packingconstruction heuristicsefficient implementationrectilinear blocks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• A partition-based heuristic algorithm for the rectilinear block packing problem
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Design of rectangular packings: Block structure-based reconstruction algorithm
• Computational Science – ICCS 2005
• The rectangular packing problem: local optimum search methods based on block structures

Cites work

• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• An effective quasi-human based heuristic for solving the rectangle packing problem
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An improved typology of cutting and packing problems
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Enumerating bottom-left stable positions for rectangle placements with overlap
• Fast neighborhood search for two- and three-dimensional nesting problems
• Orthogonal Packings in Two Dimensions
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Solving the irregular strip packing problem via guided local search for overlap minimization
• Some experiments with simulated annealing techniques for packing problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.

Cited in

(7)

• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Data set generation for rectangular placement problems
• A partition-based heuristic algorithm for the rectilinear block packing problem
• 4-block heuristic for the rectangle packing problem
• The rectangular packing problem: local optimum search methods based on block structures
• Design of rectangular packings: Block structure-based reconstruction algorithm
• Efficient overlap detection and construction algorithms for the bitmap shape packing problem

This page was built for publication: Efficient implementations of construction heuristics 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 Q337284)