A heuristic for multiple container loading problems

DOI10.1007/S002910050104zbMath0967.90007OpenAlexW1969084976MaRDI QIDQ1569798

Andreas Bortfeldt

Publication date: 3 September 2001

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002910050104

zbMATH Keywords

containertransportationheuristiccontainer loading problemthree-dimensional bin packing problemthree-dimensional multiple knapsack problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A heuristic for solving large bin packing problems in two and three dimensions ⋮ An improved typology of cutting and packing problems ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading cost minimization problem ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ Solving container loading problems by block arrangement

This page was built for publication: A heuristic for multiple container loading problems