Journal of Heuristics

, Volume 3, Issue 4, pp 299–304 | Cite as

Heuristic Solution of Open Bin Packing Problems

  • Ian P. Gent

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.

bin packing heuristics empirical study of algorithms benchmark problems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cheeseman, P., B. Kanefsky, and W. Taylor. (1991). "Where the Really Hard Problems Are," Proceedings of the 12th IJCAI, 331–337.Google Scholar
  2. 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.Google Scholar
  3. Falkenauer, E. (1996). "A Hybrid Grouping Genetic Algorithm for Bin Packing," Journal of Heuristics 2, 5–30.Google Scholar
  4. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to The Theory of NP-Completeness. W.H. Freeman.Google Scholar
  5. Gent, I., E. MacIntyre, P. Prosser, and T.Walsh. (1996). "The Constrainedness of Search." Proceedings of AAAI-96, 246–252.Google Scholar
  6. Gent, I. and T. Walsh. (1997). "From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules," Proceedings of IJCAI 97, in press.Google Scholar
  7. 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.Google Scholar
  8. Hooker, J.N. (1995). "Testing Heuristics: We Have it All Wrong," Journal of Heuristics 1, 33–42.Google Scholar
  9. 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).Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Ian P. Gent
    • 1
  1. 1.Department of Computer ScienceUniversity of StrathclydeGlasgowUnited Kingdom

Personalised recommendations