A hybrid evolutionary algorithm for the two-dimensional packing problem
From MaRDI portal
Publication:301327
DOI10.1007/S10100-013-0300-0zbMath1339.90337OpenAlexW2013004479WikidataQ59163020 ScholiaQ59163020MaRDI QIDQ301327
Publication date: 30 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-013-0300-0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (7)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Rectangle packing with a recursive pilot method ⋮ The cutting stock problem applied to the hardening process in an automotive spring factory ⋮ Exact solution techniques for two-dimensional cutting and packing
Uses Software
Cites Work
- Unnamed Item
- A heuristic for solving large bin packing problems in two and three dimensions
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- 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
- Some experiments with simulated annealing techniques for packing problems
- 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
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack 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
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An improved typology of cutting and packing problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Modeling of packing problems
- Orthogonal Packings in Two Dimensions
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
This page was built for publication: A hybrid evolutionary algorithm for the two-dimensional packing problem
