Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

DOI10.1016/J.EJOR.2004.04.030MaRDI QIDQ2569035zbMATH OpenOpenAlexFDO

Authors K. Dowsland, Edward A. Herbert, Graham Kendall, Edmund K. Burke

Publication date 17 October 2005

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

zbMATH Keywords

branch and boundcuttinggenetic algorithmspacking

Mathematics Subject Classification ID

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

Recommendations

• Use of genetic algorithms for solution of the rectangle packing problem
• Guillotineable bin packing: A genetic approach
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A family of genetic algorithms for the pallet loading problem
• scientific article; zbMATH DE number 994412

Cites work

• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• A family of genetic algorithms for the pallet loading problem
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• An Algorithm for Two-Dimensional Cutting Problems
• An exact algorithm for the pallet loading problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• An indirect genetic algorithm for a nurse-scheduling problem
• Guided local search for the three-dimensional bin-packing problem
• Handbook of applied optimization
• Handbook of metaheuristics
• Heuristic algorithms for the multiple knapsack problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• scientific article; zbMATH DE number 1728536 (Why is no real title available?)
• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Two-dimensional packing problems: a survey

Cited in

(9)

• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• A hybrid algorithm based on variable neighbourhood for the strip packing problem
• Decomposition based hybrid metaheuristics
• An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
• Relatives assist genetic algorithm for the rectangle packing problem
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems

This page was built for publication: Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

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