An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation

DOI10.1016/j.cor.2016.11.024zbMath1391.90538OpenAlexW2558364177MaRDI QIDQ1652199

Lijun Wei, Stephen C. H. Leung, Qian Hu, Ning Zhang

Publication date: 11 July 2018

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

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

zbMATH Keywords

heuristicspackingcuttingbest-fitrandom local search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Rectangle packing with a recursive pilot method ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem

Cites Work

• A simple randomized algorithm for two-dimensional strip packing
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• Reactive GRASP for the strip-packing problem
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
• A least wasted first heuristic algorithm for the rectangular packing problem
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• Exact algorithms for the guillotine strip cutting/packing problem.
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• An effective quasi-human based heuristic for solving the rectangle packing problem
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A new heuristic recursive algorithm for the strip rectangular packing problem
• An improved typology of cutting and packing problems
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
• An improved best-fit heuristic for the orthogonal strip packing problem
• An Exact Approach to the Strip-Packing Problem
• A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
• Combinatorial Benders' Cuts for the Strip Packing Problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Two-Dimensional Finite Bin-Packing Algorithms
• Orthogonal Packings in Two Dimensions
• An Algorithm for Two-Dimensional Cutting Problems
• LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• Data set generation for rectangular placement problems

This page was built for publication: An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation