Layer-layout-based heuristics for loading homogeneous items into a single container

DOI10.1631/jzus.2007.A1944zbMath1135.90440MaRDI QIDQ926048

Kevin W. Li, Zhou-Jing Wang

Publication date: 26 May 2008

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

optimizationpackingheuristiclayercontainer loading problem (CLP)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Constraints in container loading -- a state-of-the-art review

Cites Work

• Unnamed Item
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• Weight distribution considerations in container loading
• An efficient approach for the multi-pallet loading problem
• A tabu search algorithm for the pallet loading problem
• A typology of cutting and packing problems
• Heuristics for the container loading problem
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• Three-dimensional packing of items with limited load bearing strength
• A parallel hybrid local search algorithm for the container loading problem
• A note on an L-approach for solving the manufacturer's pallet loading problem
• A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
• Applying spatial representation techniques to the container packing problem
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• The G4-Heuristic for the Pallet Loading Problem
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: Layer-layout-based heuristics for loading homogeneous items into a single container