Distributed simulated annealing for composite stock cutting problem

The composite stock cutting problem is defined as allocating rectangular and irregular patterns onto a large composite stock sheet of finite dimensions in such a way that the resulting scrap will be minimized. In this paper, we propose distributed simulated annealing for this composite stock cutting problem. The new cost error tolerant scheme relaxes synchronization and does move generations asynchronously in a dynamically changed stream length to keep the convergence property of the sequential annealing. This paper also proposes the efficient data structures for pattern related information.