TSpack: A unified tabu search code for multi-dimensional bin packing problems
From MaRDI portal
Publication:702723
DOI10.1023/B:ANOR.0000039519.03572.08zbMath1066.90142OpenAlexW2151459007MaRDI QIDQ702723
Andrea Lodi, Daniele Vigo, Silvano Martello
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000039519.03572.08
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial aspects of packing and covering (05B40)
Related Items (14)
Integrated shipment dispatching and packing problems: a case study ⋮ A heuristic for solving large bin packing problems in two and three dimensions ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ A hybrid algorithm for constrained order packing ⋮ TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem ⋮ An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem ⋮ A comparative review of 3D container loading algorithms ⋮ Constraints in container loading -- a state-of-the-art review
Uses Software
This page was built for publication: TSpack: A unified tabu search code for multi-dimensional bin packing problems
