Algorithm 864

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 (Source:

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Eraşcu, Mădălina; Micota, Flavia; Zaharie, Daniela: Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking (2021)
  2. Gzara, Fatma; Elhedhli, Samir; Yildiz, Burak C.: The pallet loading problem: three-dimensional bin packing with practical constraints (2020)
  3. Fernandes Silva, Everton; Machado Toffolo, Túlio Angelo; Wauters, Tony: Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems (2019)
  4. Elhedhli, Samir; Gzara, Fatma; Yan, Yi Feng: A MIP-based slicing heuristic for three-dimensional bin packing (2017)
  5. Bortfeldt, Andreas; Wäscher, Gerhard: Constraints in container loading -- a state-of-the-art review (2013)
  6. Bortfeldt, Andreas: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (2012)
  7. He, Yaohua; Wu, Yong; De Souza, Robert: A global search framework for practical three-dimensional packing with variable carton orientations (2012)
  8. Miao, Lixin; Ruan, Qingfang; Woghiren, Kevin; Ruo, Qi: A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints (2012)
  9. Zhu, Wenbin; Qin, Hu; Lim, Andrew; Wang, Lei: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (2012)
  10. Zhu, Wenbin; Zhang, Zhaoyi; Oon, Wee-Chong; Lim, Andrew: Space defragmentation for packing problems (2012)
  11. Duhamel, Christophe; Lacomme, Philippe; Quilliot, Alain; Toussaint, Hélène: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (2011)
  12. Amossen, Rasmus R.; Pisinger, David: Multi-dimensional bin packing problems with guillotine constraints (2010)
  13. Bay, Maud; Crama, Yves; Langer, Yves; Rigo, Philippe: Space and time allocation in a shipyard assembly hall (2010)
  14. Fuellerer, Guenther; Doerner, Karl F.; Hartl, Richard F.; Iori, Manuel: Metaheuristics for vehicle routing problems with three-dimensional loading constraints (2010)
  15. Iori, Manuel; Martello, Silvano: Routing problems with loading constraints (2010)
  16. Parreño, F.; Alvarez-Valdes, R.; Oliveira, J. F.; Tamarit, J. M.: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (2010)
  17. Wu, Yong; Li, Wenkai; Goh, Mark; de Souza, Robert: Three-dimensional bin packing problem with variable bin height (2010)
  18. Egeblad, Jens; Pisinger, David: Heuristic approaches for the two- and three-dimensional knapsack packing problem (2009)
  19. Crainic, Teodor Gabriel; Perboli, Guido; Tadei, Roberto: Extreme point-based heuristics for three-dimensional bin packing (2008)
  20. Martello, Silvano; Pisinger, David; Vigo, Daniele; Den Boef, Edgar; Korst, Jan H. M.: Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. (2007) ioport

1 2 next