A tabu search algorithm for a two-dimensional non-guillotine cutting problem

Abstract

In this paper we study the two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and inserting blocks of pieces have been defined. Intensification and diversification procedures, based on long-term memory, have been included. The computational results on large sets of test instances show that the algorithm is very efficient for a wide range of packing and cutting problems.

DOI: 10.1016/j.ejor.2005.11.068

Extracted Key Phrases

12 Figures and Tables

Cite this paper

@article{AlvarezValds2007ATS, title={A tabu search algorithm for a two-dimensional non-guillotine cutting problem}, author={Ram{\'o}n Alvarez-Vald{\'e}s and Francisco Parre{\~n}o and Jos{\'e} Manuel Tamarit}, journal={European Journal of Operational Research}, year={2007}, volume={183}, pages={1167-1182} }