A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
From MaRDI portal
Publication:610979
DOI10.1007/s10479-008-0449-4zbMath1201.90176OpenAlexW2035260387MaRDI QIDQ610979
José Fernando Oliveira, Francisco Parreño, José Manuel Tamarit, Ramón Alvarez-Valdés
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0449-4
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (28)
A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ A variable neighborhood descent approach for the two-dimensional bin packing problem ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ The multiple container loading problem with preference ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ 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 ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ The multiple container loading problem with loading docks ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ The multiple container loading cost minimization problem ⋮ A two-stage packing problem procedure ⋮ A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics ⋮ A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ MIP-based approaches for the container loading problem with multi-drop constraints ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem ⋮ Determining the best shipper sizes for sending products to customers ⋮ The exact solutions of several types of container loading problems ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ Constraints in container loading -- a state-of-the-art review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A probabilistic heuristic for a computationally difficult set covering problem
- Loading plates with non-identical items
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Approximation algorithm for the oriented two-dimensional bin packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Neighborhood structures for the container loading problem: a VNS implementation
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- A Maximal-Space Algorithm for the Container Loading Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The Three-Dimensional Bin Packing Problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
This page was built for publication: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
