Abstract
Benchmark problems should be hard. I report on the solution of the five open benchmark problems introduced by Falkenauer in this journal for testing bin packing problems. Since the solutions were found either by hand or by using very simple heuristic methods, these problems would appear to be easy. In four cases I give improved packings to refute conjectures that previously reported packings were optimal, and I give a proof that the fifth conjecture was correct. In some cases this led to implemented heuristic methods which produced better solutions than those reported by Falkenauer and up to 10,000 times faster. Future experimenters should be careful to perform tests on problems that can reasonably be regarded as hard.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cheeseman, P., B. Kanefsky, and W. Taylor. (1991). "Where the Really Hard Problems Are," Proceedings of the 12th IJCAI, 331–337.
Coffman, Jr., E., M. Garey, and D. Johnson. (1997). "Approximation Algorithms for Bin Packing: A Survey," Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 46–93.
Falkenauer, E. (1996). "A Hybrid Grouping Genetic Algorithm for Bin Packing," Journal of Heuristics 2, 5–30.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to The Theory of NP-Completeness. W.H. Freeman.
Gent, I., E. MacIntyre, P. Prosser, and T.Walsh. (1996). "The Constrainedness of Search." Proceedings of AAAI-96, 246–252.
Gent, I. and T. Walsh. (1997). "From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules," Proceedings of IJCAI 97, in press.
Hogg, T., B. Huberman, and C. Williams (eds.). (1996). Artificial Intelligence, vol. 81. Elsevier. Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity.
Hooker, J.N. (1995). "Testing Heuristics: We Have it All Wrong," Journal of Heuristics 1, 33–42.
Martello, S. and P. Toth. (1990). "Lower Bounds and Reduction Procedures for The Bin Packing Problem," Discrete Applied Mathematics 22, 59–70. Cited by (Falkenauer 1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gent, I.P. Heuristic Solution of Open Bin Packing Problems. Journal of Heuristics 3, 299–304 (1998). https://doi.org/10.1023/A:1009678411503
Issue Date:
DOI: https://doi.org/10.1023/A:1009678411503