AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS

DOI10.1142/S0217595904000254zbMath1056.90118MaRDI QIDQ4650598

Katsuhisa Ohno, Jia-Li Du, Zhihong Jin

Publication date: 18 February 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealing; benchmarks; fixed loading (unloading) orders; flexible packing patterns; loading stability; Sub-volume

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

A tree search method for the container loading problem with shipment priority, Layer-layout-based heuristics for loading homogeneous items into a single container, A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach, MIP-based approaches for the container loading problem with multi-drop constraints, Three-dimensional container loading models with cargo stability and load bearing constraints, ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Weight distribution considerations in container loading
• Loading plates with non-identical items
• An efficient approach for the multi-pallet loading problem
• A global optimization algorithm for the three-dimensional packing problem
• A computer-based heuristic for packing pooled shipment containers
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• A Genetic Algorithm for Solving the Container Loading Problem
• Applying spatial representation techniques to the container packing problem
• A systematic approach for the three-dimensional palletization problem
• 3D random stacking of weakly heterogeneous palletization problems