Comparison of stochastic and approximation algorithms for one-dimensional cutting problems


Bingul Z. , Oysu C.

ADVANCES IN INTELLIGENT COMPUTING, PT 1, PROCEEDINGS, cilt.3644, ss.976-985, 2005 (SCI İndekslerine Giren Dergi) identifier

  • Cilt numarası: 3644
  • Basım Tarihi: 2005
  • Dergi Adı: ADVANCES IN INTELLIGENT COMPUTING, PT 1, PROCEEDINGS
  • Sayfa Sayıları: ss.976-985

Özet

The paper deals with the new algorithm development and comparison of three one-dimensional stock cutting algorithms regarding trim loss. Three possible types of problems used in this study are identified as easy, medium and hard. Approximate method is developed which enables a comparison of solutions of all three types of problems and of the other two stochastic methods. The other two algorithms employed here are Genetic Algorithms (GA) with Improved Bottom-Left (BL) and Simulated Annealing (SA) with Improved BL. Two examples of method implementation for comparison of three algorithms are presented. The approximate method produced the best solutions for easy and medium cutting problems. However, GA works very well in hard problems because of its global search ability.