A hybrid genetic algorithm for the two-dimensional single large object placement problem
From MaRDI portal
Publication:2643949
DOI10.1016/J.EJOR.2005.11.061zbMath1146.90481OpenAlexW2078681980MaRDI QIDQ2643949
Manuel Iori, Eleni Hadjiconstantinou
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.061
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A scheduling framework for large-scale, parallel, and topology-aware applications ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects ⋮ The maximum diversity assortment selection problem ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Cutting stock problems and solution procedures
- Packing problems
- On genetic algorithms for the packing of polygons
- An optimal algorithm for rectangle placement
- Genetic algorithm crossover operators for ordering applications
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Approximation algorithm for the oriented two-dimensional bin packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Hybrid genetic algorithms for bin-packing and related problems
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Resolution of strip-packing problems with genetic algorithms
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Modeling of packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
This page was built for publication: A hybrid genetic algorithm for the two-dimensional single large object placement problem
