A family of genetic algorithms for the pallet loading problem

DOI10.1007/BF02125406zbMath0851.90096MaRDI QIDQ1919852

Edward A. Herbert, Kathryn A. Dowsland

Publication date: 28 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmstwo-dimensional packingpallet loading

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

A joint replenishment problem considering multiple trucks with shipment and resource constraints, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Metaheuristics: A bibliography, Packing different-sized circles into a rectangular container, A branch-and-cut algorithm for the pallet loading problem, The pallet loading problem: a review of solution methods and computational experiments, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Packing different-sized circles into a rectangular container
• Packing problems
• Genetic algorithms, function optimization, and facility layout design
• Some experiments with simulated annealing techniques for packing problems
• An exact algorithm for the pallet loading problem
• A typology of cutting and packing problems
• A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem