Tspack: a unified tabu search code for multi-dimensional bin packing problems. We present a computer code that implements a general Tabu Search technique for the solution of two- and three-dimensional bin packing problems, as well as virtually any of their variants requiring the minimization of the number of bins. The user is only requested to provide a procedure that gives an approximate solution to the actual variant to be solved.

References in zbMATH (referenced in 10 articles )

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

  1. Iori, Manuel; de Lima, Vinícius L.; Martello, Silvano; Miyazawa, Flávio K.; Monaci, Michele: Exact solution techniques for two-dimensional cutting and packing (2021)
  2. Zudio, Anderson; da Silva Costa, Daniel Henrique; Masquio, Bruno Porto; Coelho, Igor M.; Pinto, Paulo Eustáquio Duarte: BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem (2018)
  3. Furian, Nikolaus; Vössner, Siegfried: A hybrid algorithm for constrained order packing (2014)
  4. Bortfeldt, Andreas; Wäscher, Gerhard: Constraints in container loading -- a state-of-the-art review (2013)
  5. Furian, Nikolaus; Vössner, Siegfried: Constrained order packing: comparison of heuristic approaches for a new bin packing problem (2013)
  6. Mack, Daniel; Bortfeldt, Andreas: A heuristic for solving large bin packing problems in two and three dimensions (2012)
  7. 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)
  8. Crainic, Teodor Gabriel; Perboli, Guido; Tadei, Roberto: TS(^2)PACK: A two-level tabu search for the three-dimensional bin packing problem (2009)
  9. Attanasio, Andrea; Fuduli, Antonio; Ghiani, Gianpaolo; Triki, Chefi: Integrated shipment dispatching and packing problems: a case study (2007)
  10. Lodi, Andrea; Martello, Silvano; Vigo, Daniele: TSpack: A unified tabu search code for multi-dimensional bin packing problems (2004)