Algorithm 864

swMATH ID: 5045
Software Authors: Silvano Martello; David Pisinger; Daniele Vigo; Edgar Den Boef; Jan Korst
Description: Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem We consider the problem of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult to solve in practice. We characterize relevant subclasses of packing and present an algorithm which is able to solve moderately large instances to optimality. Extensive computational experiments compare the algorithm for the three-dimensional bin packing when solving general orthogonal packings and when restricted to robot packing
Homepage: http://dl.acm.org/citation.cfm?id=1206047
Keywords: optimization; DISCRETE – Optimization with discrete variables
Related Software: Ts2pack; VRP; CPLEX; TSpack; fitdistrplus; Zephyrus2; KeY-ABS; OptiMathSAT; vZ; SACO; SYMBA; z3; 2DCPackGen; ABACUS; CVRPSP; TSPLIB; OR-Library; TSPACK; Packlib2; COMET
Cited in: 21 Publications

Citations by Year