TS^2PACK: A two-level tabu search for the three-dimensional bin packing problem

DOI10.1016/J.EJOR.2007.06.063MaRDI QIDQ2378415zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

bin packingtabu searchthree-dimensional packing

Mathematics Subject Classification ID

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

Recommendations

• Heuristic algorithms for the three-dimensional bin packing problem
• The Three-Dimensional Bin Packing Problem
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• Guided local search for the three-dimensional bin-packing problem
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

Cites work

• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• An improved typology of cutting and packing problems
• Approximation algorithm for the oriented two-dimensional bin packing problem
• Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• Extreme point-based heuristics for three-dimensional bin packing
• Guided local search for the three-dimensional bin-packing problem
• Heuristic algorithms for the three-dimensional bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• New lower bounds for the three-dimensional finite bin packing problem
• On Packing Two-Dimensional Bins
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• Tabu Search—Part I
• Tabu Search—Part II
• The Three-Dimensional Bin Packing Problem
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• Two-Dimensional Finite Bin-Packing Algorithms
• Two-dimensional packing problems: a survey

Cited in

(39)

• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• A MIP-based slicing heuristic for three-dimensional bin packing
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• A global search framework for practical three-dimensional packing with variable carton orientations
• BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
• Heuristic algorithms for the three-dimensional bin packing problem
• Space defragmentation for packing problems
• A prototype column generation strategy for the multiple container loading problem
• Solving packing problems by a distributed global optimization algorithm
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• The forgotten sons: warehousing systems for brick-and-mortar retail chains
• A data-driven approach for mixed-case palletization with support
• Constructive heuristics for the canister filling problem
• Constraints in container loading -- a state-of-the-art review
• A comparative review of 3D container loading algorithms
• Guided local search for the three-dimensional bin-packing problem
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• A two-stage packing problem procedure
• Metaheuristics for truck loading in the car production industry
• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• 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
• Ts2pack
• Container packing problem with balance constraints
• Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
• Spatial scheduling and workforce assignment problem in block assembly shop of shipbuilding
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• The multiple container loading cost minimization problem
• A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
• A fast optimization approach for a complex real-life 3D multiple bin size bin packing problem
• Compliant-based robotic 3D bin packing with unavoidable uncertainties
• The semi-online robotic pallet loading problem
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• Improved approximation algorithms for three-dimensional bin packing
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem

Describes a project that uses

Uses Software

• TSpack

This page was built for publication: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378415)