Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic

DOI10.1016/j.ejor.2004.12.029zbMath1136.90412OpenAlexW2035550107MaRDI QIDQ2643955

Kevin J. Binkley, Masafumi Hagiwara

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.2004.12.029

zbMATH Keywords

simulated annealinggenetic algorithmspackingevolutionary algorithmscutting

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Metaheuristics for truck loading in the car production industry ⋮ An agent-based approach to the two-dimensional guillotine bin packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel recombinative simulated annealing: A genetic algorithm
• On genetic algorithms for the packing of polygons
• 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
• Exhaustive approaches to 2D rectangular perfect packings
• An improved typology of cutting and packing problems
• Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms

This page was built for publication: Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic