TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
From MaRDI portal
Publication:2378415
DOI10.1016/j.ejor.2007.06.063zbMath1161.90012OpenAlexW2066875820WikidataQ58644503 ScholiaQ58644503MaRDI QIDQ2378415
Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.063
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, The multiple container loading problem with preference, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, The load-balanced multi-dimensional bin-packing problem, A data-driven approach for mixed-case palletization with support, Space defragmentation for packing problems, A prototype column generation strategy for the multiple container loading problem, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, A MIP-based slicing heuristic for three-dimensional bin packing, The multiple container loading cost minimization problem, A two-stage packing problem procedure, Metaheuristics for truck loading in the car production industry, Solving packing problems by a distributed global optimization algorithm, Container packing problem with balance constraints, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem, SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems, A global search framework for practical three-dimensional packing with variable carton orientations, Constructive heuristics for the canister filling problem, The forgotten sons: warehousing systems for brick-and-mortar retail chains, BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem, A comparative review of 3D container loading algorithms, Ts2pack, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, Constraints in container loading -- a state-of-the-art review
Uses Software
Cites Work
- Unnamed Item
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Approximation algorithm for the oriented two-dimensional bin packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Two-dimensional packing problems: a survey
- Heuristic algorithms for the three-dimensional bin packing problem
- An improved typology of cutting and packing problems
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Two-Dimensional Finite Bin-Packing Algorithms
- On Packing Two-Dimensional Bins
- Tabu Search—Part I
- Tabu Search—Part II
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
