Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bengtsson, B.E. (1982). “Packing Rectangular Pieces — A Heuristic Approach.” The Computer Journal 25, 353-357.
Berkey, J.O. and P.Y. Wang. (1987). “Two Dimensional Finite Bin Packing Algorithms.” Journal of the Operational Research Society 38, 423-429.
Chen, C.S., S.M. Lee, and Q.S. Shen. (1995). “An Analytical Model for the Container Loading Problem.” European Journal of Operational Research 80, 68-76.
Chung, F.K.R.,M.R. Garey, and D.S. Johnson. (1982). “On Packing Two-Dimensional Bins.” SIAM Journal of Algebraic and Discrete Methods 3, 66-76.
Dowsland, K.A. and W.B. Dowsland. (1992). “Packing Problems.” European Journal of Operational Research 56, 2-14.
Dyckhoff, H. and U. Finke. (1992). Cutting and Packing in Production and Distribution. Heidelberg: Physica Verlag.
Dyckhoff, H., G. Scheithauer, and J. Terno. (1997). “Cutting and Packing (C&P).” In M. Dell’Amico, F. Maffioli, and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization. Chichester: Wiley, pp. 393-413.
Frenk, J.B. and G.G. Galambos. (1987). “Hybrid Next-Fit Algorithm for the Two-Dimensional Rectangle Bin-Packing Problem.” Computing 39, 201-217.
Johnson, D.S. (1973). “Near-Optimal Bin Packing Algorithms.” Ph.D. Thesis, MIT, Cambridge, MA.
Lodi, A., S. Martello, and M. Monaci. (2002). “Two-Dimensional Packing Probles: A Survey.” European Journal of Operational Research 141, 241-252.
Lodi, A., S. Martello, and D. Vigo. (1998). “Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem.” In S. Voss, S. Martello, I.H. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer Academic, pp. 125-139.
Lodi, A., S. Martello, and D. Vigo. (1999a). “Approximation Algorithms for the Oriented Two-Dimensional Bin Packing Problem.” European Journal of Operational Research 112, 158-166.
Lodi, A., S. Martello, and D. Vigo. (1999b). “Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.” INFORMS Journal on Computing 11, 345-357.
Lodi, A., S. Martello, and D. Vigo. (2002a). “Heuristic Algorithms for the Three-Dimensional Bin Packing Problem.” European Journal of Operational Research 141, 410-420.
Lodi, A., S. Martello, and D. Vigo. (2002b). “Recent Advances on Two-Dimensional Bin Packing Problems.” Discrete Applied Mathematics 123, 379-396.
Lodi, A., S. Martello, and D. Vigo. (2004). “Models and Bounds for Two-Dimensional Level Packing Problems.” Journal of Combinatorial Optimization 8, 363-379.
Martello, S., D. Pisinger, and D. Vigo. (2000). “The Three-Dimensional Bin Packing Problem.” Operations Research 48, 256-267.
Martello, S. and D. Vigo. (1998). “Exact Solution of the Two-Dimensional Finite Bin Packing Problem.” Management Science 44, 388-399.
Pisinger, D., E. den Boef, J. Korst, S. Martello, and D. Vigo. (2001). “Robot-Packable and General Variants of the Three-Dimensional Bin Packing Problem.” Technical Report 01/05, DIKU, University of Copenhagen.
Scheithauer, G. (1991). “A Three-Dimensional Bin Packing Algorithm.” J. Inform. Process. Cybernet.27, 263-271.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lodi, A., Martello, S. & Vigo, D. TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. Ann Oper Res 131, 203–213 (2004). https://doi.org/10.1023/B:ANOR.0000039519.03572.08
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000039519.03572.08