Resolution of strip-packing problems with genetic algorithms

DOI10.1057/PALGRAVE.JORS.2601019MaRDI QIDQ3156675zbMATH OpenOpenAlexFDO

Authors

Publication date 10 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601019

zbMATH Keywords

combinatorial optimisationgenetic algorithmsheuristicsstrip-packing

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• Use of genetic algorithms for solution of the rectangle packing problem
• An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
• scientific article; zbMATH DE number 2050771
• A review of the application of meta-heuristic algorithms to 2D strip packing problems

Cited in

(16)

• Guillotineable bin packing: A genetic approach
• On genetic algorithms for the packing of polygons
• Use of genetic algorithms for solution of the rectangle packing problem
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A hybrid genetic algorithm for the two-dimensional single large object placement problem
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• scientific article; zbMATH DE number 2089828 (Why is no real title available?)
• An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
• Generalized particular covering problem with genetic algorithms
• scientific article; zbMATH DE number 1975106 (Why is no real title available?)
• Genetic Algorithms and Heuristic Rules for Solving the Nesting Problem in the Package Industry
• Nature inspired genetic algorithms for hard packing problems
• Computing maximum polygonal packings in convex polygons using best-fit, genetic algorithms and ILPs (CG challenge)
• Reactive GRASP for the strip-packing problem

This page was built for publication: Resolution of strip-packing problems with genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156675)