An AND/OR-graph approach to the container loading problem

DOI10.1016/0969-6016(94)90046-9zbMath0854.90121OpenAlexW2123169215WikidataQ57719586 ScholiaQ57719586MaRDI QIDQ4888228

Reinaldo Morabito, Marcos Nereu Arenales

Publication date: 28 July 1996

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0969-6016(94)90046-9

zbMATH Keywords

branch-and-boundpackingheuristiccontainer loading problemcuttingsearch graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (33)

A caving degree approach for the single container loading problem ⋮ The multiple container loading problem with preference ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ A beam search approach to the container loading problem ⋮ Solving a large multicontainer loading problem in the car manufacturing industry ⋮ On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Exact algorithms for the product configuration problem ⋮ Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation ⋮ MIP-based approaches for the container loading problem with multi-drop constraints ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ A parallel multi-population biased random-key genetic algorithm for a container loading problem ⋮ A hybrid genetic algorithm for the container loading problem ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach ⋮ ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE ⋮ An efficient approach for the multi-pallet loading problem ⋮ Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem ⋮ Heuristics for the container loading problem ⋮ Solving container loading problems by block arrangement ⋮ An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints ⋮ Constraints in container loading -- a state-of-the-art review

This page was built for publication: An AND/OR-graph approach to the container loading problem