A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

DOI10.1016/j.ejor.2007.08.017zbMath1146.90507OpenAlexW1967873811MaRDI QIDQ930941

Jason K. Levy, Kevin W. Li, Zhou-Jing Wang

Publication date: 24 June 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://scholar.uwindsor.ca/odettepub/68

zbMATH Keywords

heuristicscontainer loading problemdynamic space decompositionholistic loadingtertiary tree

Mathematics Subject Classification ID

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

Related Items

An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ 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 new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• Weight distribution considerations in container loading
• Loading plates with non-identical items
• An efficient approach for the multi-pallet loading problem
• A typology of cutting and packing problems
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• Three-dimensional packing of items with limited load bearing strength
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• A parallel hybrid local search algorithm for the container loading problem
• A Genetic Algorithm for Solving the Container Loading Problem
• Applying spatial representation techniques to the container packing problem
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• Loading Multiple Pallets
• A hybrid genetic algorithm for the container loading problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach