Guided local search for the three-dimensional bin-packing problem
From MaRDI portal
Publication:2884559
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
Cited in
(53)- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- 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
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Routing problems with loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- An introduction to the two‐dimensional rectangular cutting and packing problem
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- A particular approach for the three-dimensional packing problem with additional constraints
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- The Three-Dimensional Bin Packing Problem
- 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 goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A two-stage packing problem procedure
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A heuristic for solving large bin packing problems in two and three dimensions
- Weight distribution in container loading: a case study
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- The multiple container loading cost minimization problem
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- 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
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- Efficient algorithms for orthogonal packing 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
- The load-balanced multi-dimensional bin-packing problem
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance
- A prototype column generation strategy for the multiple container loading problem
- Space defragmentation for packing problems
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Heuristics for the container loading problem
- Three-dimensional bin packing problem with variable bin height
- A MIP-based slicing heuristic for three-dimensional bin packing
- A comparative review of 3D container loading algorithms
- Constraints in container loading -- a state-of-the-art review
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- A variable neighborhood descent approach for the two-dimensional bin packing problem
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)
