Guided Local Search for the Three-Dimensional Bin-Packing Problem
From MaRDI portal
Publication:2884559
DOI10.1287/ijoc.15.3.267.16080zbMath1238.90112OpenAlexW2158804684WikidataQ58826464 ScholiaQ58826464MaRDI QIDQ2884559
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
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, A heuristic for solving large bin packing problems in two and three dimensions, A variable neighborhood descent approach for the two-dimensional bin packing problem, Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, Adaptive simulated annealing with greedy search for the circle bin packing problem, The multiple container loading problem with preference, A heuristic algorithm for container loading of pallets with infill boxes, An improved typology of cutting and packing problems, Fast neighborhood search for two- and three-dimensional nesting problems, 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, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Space defragmentation for packing problems, A prototype column generation strategy for the multiple container loading problem, Space and time allocation in a shipyard assembly hall, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, Routing problems with loading constraints, A MIP-based slicing heuristic for three-dimensional bin packing, An introduction to the two‐dimensional rectangular cutting and packing problem, The multiple container loading cost minimization problem, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, A two-stage packing problem procedure, Solving the one-dimensional bin packing problem with a weight annealing heuristic, 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, Efficient algorithms for orthogonal packing problems, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, A global search framework for practical three-dimensional packing with variable carton orientations, A particular approach for the three-dimensional packing problem with additional constraints, A greedy search for the three-dimensional bin packing problem: the packing static stability case, The pallet loading problem: three-dimensional bin packing with practical constraints, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Three-stage heuristic algorithm for three-dimensional irregular packing problem, BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem, Weight distribution in container loading: a case study, A comparative review of 3D container loading algorithms, Translational packing of arbitrary polytopes, An agent-based approach to the two-dimensional guillotine bin packing problem, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, Raster penetration map applied to the irregular packing problem, Placement of two- and three-dimensional irregular shapes for inertia moment and balance, New lower bounds for the three-dimensional finite bin packing problem, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, Three-dimensional bin packing problem with variable bin height, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, Heuristics for the container loading problem, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Constraints in container loading -- a state-of-the-art review
