An adaptive genetic algorithm for 2D packing problem

MaRDI QIDQ3567150zbMATH OpenFDO

Authors Baochun Wang

Publication date 11 June 2010

Full work available at URL http://ccsenet.org/journal/index.php/mas/article/view/5657

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Use of genetic algorithms for solution of the rectangle packing problem
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• Computational Science – ICCS 2005
• A recursive heuristic algorithm for 2D rectangular strip packing problems
• An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle

Cited in

(10)

• Application of particle swarm optimization to packing problem
• On genetic algorithms for the packing of polygons
• Differential evolution algorithm with moving collected points placement for 2D rectangle packing problem
• An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
• Automatic layouting of personalized newspaper pages
• A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
• Use of genetic algorithms for solution of the rectangle packing problem
• A modified partially mapped multicrossover genetic algorithm for two-dimensional bin packing problem
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• scientific article; zbMATH DE number 2083807 (Why is no real title available?)

This page was built for publication: An adaptive genetic algorithm for 2D packing problem

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