A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
type: Item
instance of: scholarly article
title: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
zbMATH Open document ID: 1201.90176
author: José Fernando Oliveira
author: Francisco Parreño
author: Ramón Alvarez-Valdes
author: José Manuel Tamarit
published in: Annals of Operations Research
publication date: 2010-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5826009
zbMATH Keywords: cutting
zbMATH Keywords: packing
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: GRASP
zbMATH Keywords: VND
describes a project that uses: TSPACK
describes a project that uses: Packlib2
describes a project that uses: OR-Library
describes a project that uses: Algorithm 864
describes a project that uses: TSpack
MaRDI profile type: Publication
full work available at URL: s10479-008-0449-4
OpenAlex ID: W2035260387
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Loading plates with non-identical items
cites work: New lower bounds for the three-dimensional finite bin packing problem
cites work: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
cites work: The two-dimensional finite bin packing problem. II: New lower and upper bounds
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: A general framework for bounds for higher-dimensional orthogonal packing problems.
cites work: PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Q4828421
cites work: Approximation algorithm for the oriented two-dimensional bin packing problem
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: TSpack: A unified tabu search code for multi-dimensional bin packing problems
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: A set-covering-based heuristic approach for bin-packing problems
cites work: A maximal-space algorithm for the container loading problem
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
cites work: Q4452897
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S10479-008-0449-4
description: scientific article; zbMATH DE number 5826009