A tabu search algorithm for the pallet loading problem

DOI10.1007/S00291-004-0183-5zbMath1176.90478OpenAlexW2089655322MaRDI QIDQ1764209

Ramón Alvarez-Valdés, José Manuel Tamarit, Francisco Parreño

Publication date: 24 February 2005

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

Full work available at URL: https://doi.org/10.1007/s00291-004-0183-5

zbMATH Keywords

HeuristicsTabu searchPackingPallet loading

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ Necessity and complexity of order picking routing optimisation based on pallet loading features ⋮ Layer-layout-based heuristics for loading homogeneous items into a single container ⋮ The pallet loading problem: a review of solution methods and computational experiments

This page was built for publication: A tabu search algorithm for the pallet loading problem