An improved best-fit heuristic for the orthogonal strip packing problem
From MaRDI portal
Publication:2862160
DOI10.1111/itor.12030zbMath1274.90330OpenAlexW2158214408MaRDI QIDQ2862160
Jannes Verstichel, Greet vanden Berghe, Patrick de Causmaecker
Publication date: 14 November 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12030
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A mixed‐integer linear programming model and a metaheuristic approach for the selection and allocation of land parcels problem ⋮ Exact and heuristic methods for placing ships in locks ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
Cites Work
- 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 beam search implementation for the irregular shape packing problem
- Guillotineable bin packing: A genetic approach
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A typology of cutting and packing problems
- Alternative formulations for a layout problem in the fashion industry
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- An improved typology of cutting and packing problems
- A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Orthogonal Packings in Two Dimensions
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
