A tabu search algorithm for weakly heterogeneous container loading problems
From MaRDI portal
Publication:1286776
zbMath0917.90116MaRDI QIDQ1286776
Hermann Gehring, Andreas Bortfeldt
Publication date: 26 May 1999
Published in: OR Spektrum (Search for Journal in Brave)
Related Items (19)
Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry ⋮ An integrated approach to the vehicle routing and container loading problems ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ An improved typology of cutting and packing problems ⋮ A heuristic for the three-dimensional strip packing problem ⋮ A novel hybrid tabu search approach to container loading ⋮ A tree search method for the container loading problem with shipment priority ⋮ Container packing problem with balance constraints ⋮ A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem ⋮ Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ A hybrid genetic algorithm for the container loading problem ⋮ A pure quasi-human algorithm for solving the cuboid packing problem ⋮ Neighborhood structures for the container loading problem: a VNS implementation ⋮ Weight distribution in container loading: a case study ⋮ Three-dimensional packing of items with limited load bearing strength ⋮ Solving container loading problems by block arrangement ⋮ An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
This page was built for publication: A tabu search algorithm for weakly heterogeneous container loading problems
