Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

DOI10.1016/S0377-2217(02)00218-7zbMath1011.90033MaRDI QIDQ1869488

Marvin D. Troutt, Chi Kin Chan, T. W. Leung

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealinggenetic algorithmmeta-heuristicsdifference process strategymixed heuristicstwo-dimensional orthogonal packing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (21)

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 ⋮ AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ A tabu search algorithm for a two-dimensional non-guillotine cutting 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 ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ The maximum diversity assortment selection problem ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ An efficient deterministic optimization approach for rectangular packing problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Parallel recombinative simulated annealing: A genetic algorithm
• Genetic algorithms and very fast simulated reannealing: A comparison
• 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
• New directions in genetic algorithm theory
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Metaheuristics: A bibliography
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Genetic Algorithms-a Tool for OR?
• Equation of State Calculations by Fast Computing Machines
• An effective hybrid optimization strategy for job-shop scheduling problems

This page was built for publication: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem