Approximate algorithms for the container loading problem
From MaRDI portal
Publication:4468894
DOI10.1111/1475-3995.00386zbMath1044.90060OpenAlexW2048611372MaRDI QIDQ4468894
Publication date: 11 June 2004
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00386
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (13)
A parallel hybrid local search algorithm for the container loading problem ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study ⋮ Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study ⋮ A new heuristic algorithm for cuboids packing with no orientation 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 comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for publication: Approximate algorithms for the container loading problem
