A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem

  • Authors:

  • Edmund K. Burke;Graham Kendall;Glenn Whitwell

  • Affiliations:

  • School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, United Kingdom;School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, United Kingdom;School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, United Kingdom

  • Venue:
  • INFORMS Journal on Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The best-fit heuristic is a simple yet powerful one-pass approach for the two-dimensional rectangular stock-cutting problem. It had achieved the best published results on a wide range of benchmark problems until the development of the approaches described in this paper. Here, we illustrate how improvements in solution quality can be achieved by the hybridisation of the best-fit heuristic together with simulated annealing and the bottom-left-fill algorithm. We compare and contrast the new hybrid approach with other approaches from the literature in terms of execution times and the quality of the solutions achieved. Using a range of standard benchmark problems from the literature, we demonstrate how the new approach achieves significantly better results than previously published methods on almost all of the problem instances. In addition, we provide results on 10 new benchmark problems to encourage further research and greater comparison between current and future methods.