A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
From MaRDI portal
Recommendations
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- scientific article; zbMATH DE number 1728404
- An adaptive genetic algorithm for 2D packing problem
- scientific article; zbMATH DE number 994412
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A hybrid genetic algorithm for the job shop scheduling problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Cutting stock problems and solution procedures
- Exact algorithms for the guillotine strip cutting/packing problem.
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Genetic Algorithms-a Tool for OR?
- Genetic algorithms and tabu search: Hybrids for optimization
- On genetic algorithms for the packing of polygons
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Some experiments with simulated annealing techniques for packing problems
- The trim-loss and assortment problems: A survey
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-dimensional packing problems: a survey
Cited in
(34)- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Biased random-key genetic algorithms with applications in telecommunications
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Computational Science – ICCS 2005
- An adaptive genetic algorithm for 2D packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- 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
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem
- The maximum diversity assortment selection problem
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- Fragmentary structures in a two-dimensional strip packing problem
- A random key based genetic algorithm for the resource constrained project scheduling problem
- scientific article; zbMATH DE number 2161546 (Why is no real title available?)
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- A hybrid demon algorithm for the two-dimensional orthogonal strip 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
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- An efficient deterministic optimization approach for rectangular packing problems
- Fragmentary structures in discrete optimization problems
- A modified partially mapped multicrossover genetic algorithm for two-dimensional bin packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
This page was built for publication: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643953)
