Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
From MaRDI portal
(Redirected from Publication:1869488)
Recommendations
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Hybrid genetic algorithms for bin-packing and related problems
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1032376 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An effective hybrid optimization strategy for job-shop scheduling problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Equation of state calculations by fast computing machines
- Genetic Algorithms-a Tool for OR?
- Genetic algorithms and tabu search: Hybrids for optimization
- Genetic algorithms and very fast simulated reannealing: A comparison
- Metaheuristics: A bibliography
- New directions in genetic algorithm theory
- On genetic algorithms for the packing of polygons
- Optimization by simulated annealing
- Parallel recombinative simulated annealing: A genetic algorithm
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Some experiments with simulated annealing techniques for packing problems
Cited in
(25)- Packaging optimization using the dynamic vector fields method
- 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
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A note on ``Reducing the number of binary variables in cutting stock problems
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- The maximum diversity assortment selection problem
- A morph-based simulated annealing heuristic for a modified bin-packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
- An efficient deterministic optimization approach for rectangular packing problems
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Deterministic model for customized pilot manufacture production with various backplane sizes
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
This page was built for publication: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869488)
