A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
From MaRDI portal
Publication:2488910
DOI10.1016/j.ejor.2004.11.016zbMath1111.90094OpenAlexW2034669439MaRDI QIDQ2488910
Publication date: 16 May 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.11.016
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (47)
Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms ⋮ A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Dynamic reduction heuristics for the rectangle packing area minimization problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ The disruptive anti-covering location problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A joint replenishment problem considering multiple trucks with shipment and resource constraints ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ An exact method for the 2D guillotine strip packing problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A reference length approach for the 3D strip packing problem ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ 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 ⋮ Metaheuristics for truck loading in the car production industry ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Reactive GRASP for the strip-packing problem ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ Numerical optimization method for packing regular convex polygons ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ 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 ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average-case analysis of cutting and packing in two dimensions
- Guillotineable bin packing: A genetic approach
- On genetic algorithms for the packing of polygons
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
