One-dimensional heuristics adapted for two-dimensional rectangular strip packing
From MaRDI portal
Publication:5387421
DOI10.1057/palgrave.jors.2602393zbMath1153.90444OpenAlexW2044542980MaRDI QIDQ5387421
No author found.
Publication date: 9 May 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602393
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (28)
Sequential heuristic for the two-dimensional bin-packing problem ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution ⋮ A sequential value correction heuristic for a bi-objective two-dimensional bin-packing ⋮ A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ Order and static stability into the strip packing problem ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ Local search of orthogonal packings using the lower bounds ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
This page was built for publication: One-dimensional heuristics adapted for two-dimensional rectangular strip packing
