Effective methods for a container packing operation

DOI10.1016/S0895-7177(97)00008-3zbMath0881.90048OpenAlexW1967379091WikidataQ128116511 ScholiaQ128116511MaRDI QIDQ1361222

O. Diekmann

Publication date: 19 February 1998

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00008-3

zbMATH Keywords

heuristicstransportationpackingcargo loading problem3D-cutting stock

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

A comparative review of 3D container loading algorithms, 3-D container packing heuristics

Cites Work

• Unnamed Item
• Loading plates with non-identical items
• Packing different-sized circles into a rectangular container
• The trim-loss and assortment problems: A survey
• Packing problems
• A comparative evaluation of heuristics for container loading
• A computer-based heuristic for packing pooled shipment containers
• A Linear Programming Approach to the Cutting-Stock Problem
• A heuristic approach to the three-dimensional cargo-loading problem
• A Method for Solving Container Packing for a Single Size of Box
• Physical simulation of a three dimensional palletizing heuristic
• Multiple Container Packing: A Case Study of Pipe Packing
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions