A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
From MaRDI portal
Publication:2643953
DOI10.1016/j.ejor.2005.11.062zbMath1136.90414OpenAlexW2043559721MaRDI QIDQ2643953
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.062
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (22)
A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks ⋮ Fragmentary structures in a two-dimensional strip packing problem ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Fragmentary structures in discrete optimization problems ⋮ Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ A parallel multi-population biased random-key genetic algorithm for a container loading problem ⋮ The maximum diversity assortment selection problem ⋮ A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ An efficient deterministic optimization approach for rectangular packing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- The trim-loss and assortment problems: A survey
- Cutting stock problems and solution procedures
- Solution for the constrained Guillotine cutting problem by simulated annealing
- On genetic algorithms for the packing of polygons
- Some experiments with simulated annealing techniques for packing problems
- Genetic algorithms and tabu search: Hybrids for optimization
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Two-dimensional packing problems: a survey
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm for the job shop scheduling problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Genetic Algorithms-a Tool for OR?
This page was built for publication: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
