A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
DOI10.1016/J.COR.2012.03.016zbMATH Open1348.90531OpenAlexW1971647084MaRDI QIDQ336709FDOQ336709
José Manuel Tamarit, Ramón Alvarez-Valdes, Francisco Parreño
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.016
Recommendations
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- A heuristic for solving large bin packing problems in two and three dimensions
- A 3-approximation algorithm for two-dimensional bin packing
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- Models and algorithms for three-stage two-dimensional bin packing
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- An improved typology of cutting and packing problems
- GRASP for set packing problems.
- A hybrid heuristic for the \(p\)-median problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Title not available (Why is that?)
- New bounds for multidimensional packing
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A probabilistic heuristic for a computationally difficult set covering problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The two-dimensional bin packing problem with variable bin sizes and costs
- Exact solution of the two-dimensional finite bin packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- The Three-Dimensional Bin Packing Problem
- Title not available (Why is that?)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- An analytical model for the container loading problem
- GRASP and path relinking for the max-min diversity problem
- Solving the variable size bin packing problem with discretized formulations
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Three-dimensional bin packing problem with variable bin height
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- A general purpose algorithm for three-dimensional packing
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Algorithms – ESA 2004
Cited In (13)
- The exact solutions of several types of container loading problems
- The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- Sharing loading costs for multi compartment vehicles
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- Determining the best shipper sizes for sending products to customers
- The multiple container loading problem with preference
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Uses Software
This page was built for publication: A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336709)
