Abstract
The tradeoff between the speed and quality of the solutions obtained by various construction and local search algorithms for the elementary bin packing problem (BPP) are analyzed to obtain useful information for designing algorithms for real-world problems that can be modeled as BPPs. On the basis of intensive computational experiments, we observe that the framework of a solution (i.e., a part of a solution consisting of large items or items with tight constraints) should be constructed in the early stages of a local search. New local search algorithms are proposed as empirical support for the observation.
Similar content being viewed by others
References
Bentley, J.J. (1992). “Fast Algorithms for Geometric Traveling Salesman Problems.” ORSA Journal of Computing 4, 387–411.
Carvalho, V. (1999). “Exact Solution of Bin-Packing Problems Using Column Generation and Branch-and-Bound.” Annals of Operations Research 86, 629–659.
Chiang, W.-C. (1998). “The Application of a Tabu Search Metaheuristic to the Assembly Line Balancing Problem.” Annals of Operations Research 77, 209–227.
Coffman, E.G., M.R. Garey, and D.S. Johnson. (1997). “Approximation Algorithms for Bin Packing: A Survey.” In D.S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems. PWS Publishing Company.
Falkenauer, E. (1994). “A Hybrid Grouping Genetic Algorithm for Bin Packing.” Journal of Heuristics 2, 5–30.
Falkenauer, E. (1998a). “On Method Overfitting.” Journal of Heuristics 4, 281–287.
Falkenauer, E. (1998b). Genetic Algorithms and Grouping Problems, New York: John Wiley & Sons Ltd.
Falkenauer, E. and A. Delchambre. (1992). “A Genetic Algorithm for Bin Packing and Line Balancing.” In Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1186–1192.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability—A Guide to the Theory of NP-Completeness. W.H. Freeman.
Gent, I.P. (1998). “Heuristic Solution of Open Bin Packing Problems.” Journal of Heuristics 3, 299–304.
Gent, I.P. (1999). “A Response to ‘On Method Overfitting.” Journal of Heuristics 5, 109–111.
Gent, I.P. and T. Walsh. (1998). “Analysis of Heuristics for Number Partitioning.” Computational Intelligence 14, 430–451.
Hogg, T. and C.P. Williams. (1994). “The Hardest Constraint Problems: A Double Phase Transition.” Artificial Intelligence 69, 359–377.
Jansen, K. (1998). “An Approximation Scheme for Bin Packing with Conflicts.” In Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, pp. 35–46.
Johnson, D.S. (1973). “Near-Optimal Bin Packing Algorithms.” Ph.D. Thesis, Massachusetts Institute of Technology, Department of Mathematics, Cambridge.
Kämpke, T. (1988). “Simulated Annealing: Use of a New Tool in Bin Packing.” Annals of Operations Research 16, 327–332.
Karmarker, N. and R.M. Karp. (1982). “An Efficient Approximation Scheme for the One-Dimensional Bin Packing Problem.” In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 312–320.
Okano, H. (2002). “A Scanline-Based Algorithm for the 2D Free-Form Bin Packing Problem.” Journal of Operations Research Society of Japan 45, 145–161.
Okano, H., S. Misono, and K. Iwano. (1999). “New TSP Construction Heuristics and Their Relationships to the 2-Opt.” Journal of Heuristics 5, 71–88.
Osogami, T. (1998). “Approaches to 3D Free-Form Cutting and Packing Problems and Their Applications: A Survey.” IBM Research Report, RT0285.
Racer, M. (1994). “A Robust Heuristic for the Generalized Assignment Problem.” Annals of Operations Research 50, 487–503.
Reeves, C.R. (1996). “Hybrid Genetic Algorithms for Bin-Packing and Related Problems.” Annals of Operations Research 63, 371–396.
Yagiura, M., T. Yamaguchi, and T. Ibaraki. (1999). “A Variable Depth Search Algorithm for the Generalized Assignment Problem.” In S. Voss, S. Martello, I.H. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer Academic Publishers.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Osogami, T., Okano, H. Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics. Journal of Heuristics 9, 29–49 (2003). https://doi.org/10.1023/A:1021837611236
Issue Date:
DOI: https://doi.org/10.1023/A:1021837611236