Loading Multiple Pallets

DOI10.1057/jors.1995.181zbMath0858.90106OpenAlexW2013212413MaRDI QIDQ4896688

M. S. W. Ratcliff, Eberhard E. Bischoff

Publication date: 23 March 1997

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.181

zbMATH Keywords

heuristicslogisticsgreedy procedureloading pallets with non-identical items

Mathematics Subject Classification ID

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

Related Items

A caving degree approach for the single container loading problem ⋮ An improved typology of cutting and packing problems ⋮ A heuristic for the three-dimensional strip packing problem ⋮ Weight distribution considerations in container loading ⋮ Allowing for weight considerations in container loading ⋮ A reference length approach for the 3D strip packing problem ⋮ A new iterative-doubling greedy-lookahead algorithm for the single container loading problem ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ A novel hybrid tabu search approach to container loading ⋮ The multiple container loading problem with loading docks ⋮ The multiple container loading cost minimization problem ⋮ A tree search method for the container loading problem with shipment priority ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach ⋮ Manufacturer's mixed pallet design problem ⋮ A new heuristic algorithm for cuboids packing with no orientation constraints ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ A new load balance methodology for container loading problem in road transportation ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ 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 ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ A hybrid genetic algorithm for the container loading problem ⋮ An efficient placement heuristic for three-dimensional rectangular packing ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ Weight distribution in container loading: a case study ⋮ An efficient approach for the multi-pallet loading problem ⋮ Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem ⋮ 4-block heuristic for the rectangle packing problem ⋮ Three-dimensional packing of items with limited load bearing strength ⋮ 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 ⋮ 3-D container packing heuristics ⋮ An exact depth-first algorithm for the pallet loading problem ⋮ Constraints in container loading -- a state-of-the-art review