TSpack: A unified tabu search code for multi-dimensional bin packing problems
From MaRDI portal
Recommendations
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- scientific article; zbMATH DE number 4112059
- The Three-Dimensional Bin Packing Problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
Cited in
(14)- Exact solution techniques for two-dimensional cutting and packing
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- 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
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Integrated shipment dispatching and packing problems: a case study
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows
- BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
- The load-balanced multi-dimensional bin-packing problem
- Capping methods for the automatic configuration of optimization algorithms
- A comparative review of 3D container loading algorithms
- Constraints in container loading -- a state-of-the-art review
This page was built for publication: TSpack: A unified tabu search code for multi-dimensional bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702723)