Guided local search for the three-dimensional bin-packing problem

DOI10.1287/IJOC.15.3.267.16080zbMATH Open1238.90112DBLPjournals/informs/FaroePZ03OpenAlexW2158804684WikidataQ58826464 ScholiaQ58826464MaRDI QIDQ2884559FDOQ2884559

Authors: Oluf Faroe, David Pisinger, Martin Zachariasen 

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dfe6d091fdfae9e759f6cbc4d1286ba4cd5f3f0d

Recommendations

• The Three-Dimensional Bin Packing Problem
• Heuristic algorithms for the three-dimensional bin packing problem
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• scientific article; zbMATH DE number 21364

zbMATH Keywords

cutting and packingsuboptimal algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (53)

• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• A global search framework for practical three-dimensional packing with variable carton orientations
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• An introduction to the two‐dimensional rectangular cutting and packing problem
• Routing problems with loading constraints
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• The Three-Dimensional Bin Packing Problem
• A particular approach for the three-dimensional packing problem with additional constraints
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching
• A two-stage packing problem procedure
• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• Weight distribution in container loading: a case study
• A heuristic for solving large bin packing problems in two and three dimensions
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• The forgotten sons: warehousing systems for brick-and-mortar retail chains
• The multiple container loading cost minimization problem
• Adaptive simulated annealing with greedy search for the circle bin packing problem
• An agent-based approach to the two-dimensional guillotine bin packing problem
• Raster penetration map applied to the irregular packing problem
• Three-stage heuristic algorithm for three-dimensional irregular packing problem
• Space and time allocation in a shipyard assembly hall
• The multiple container loading problem with preference
• A heuristic algorithm for container loading of pallets with infill boxes
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• The pallet loading problem: three-dimensional bin packing with practical constraints
• Efficient algorithms for orthogonal packing problems
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
• Translational packing of arbitrary polytopes
• A data-driven approach for mixed-case palletization with support
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance
• The load-balanced multi-dimensional bin-packing problem
• Model development and optimization for space engineering: concepts, tools, applications, and perspectives
• A prototype column generation strategy for the multiple container loading problem
• Space defragmentation for packing problems
• Heuristics for the container loading problem
• Three-dimensional bin packing problem with variable bin height
• A comparative review of 3D container loading algorithms
• A MIP-based slicing heuristic for three-dimensional bin packing
• Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
• Constraints in container loading -- a state-of-the-art review
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
• New lower bounds for the three-dimensional finite bin packing problem
• A variable neighborhood descent approach for the two-dimensional bin packing problem
• A greedy search for the three-dimensional bin packing problem: the packing static stability case

This page was built for publication: Guided local 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 Q2884559)