A Study of Simulated Annealing Algorithm for Solutions of Two Dimensional Non-Guillotine Cutting Problems

Soke A., BİNGÜL Z.

JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI, cilt.8, sa.1, ss.25-36, 2005 (ESCI) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 8 Sayı: 1
  • Basım Tarihi: 2005
  • Dergi Adı: JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.25-36
  • Anahtar Kelimeler: Simulated annealing algorithm, Improved bottom left algorithm, Cutting problems
  • Kocaeli Üniversitesi Adresli: Evet

Özet

In this study, a hybrid approach using both simulated annealing (SA) algorithm and improved bottom left (BL) algorithm for solution of the two dimensional non-guillotine cutting problems were developed. Five different test problems consisting of 17 individual rectangular pieces and a test problem consisting of 29 individual rectangular pieces were studied. In test problems, it is desired to place the pieces on a main piece limited with 200x200 unit field which has zero trim loss value. In this work, the influences of different parameters using in SA algorithm on solutions of cutting problems were investigated. Parameter group obtained from best result (Lundy and Mees cooling schedule, swap neighborhood move and number of inner loop:3) was found. Also trim loss values obtained from results of 17 and 29 pieces test problems were seen to change between 4% - 21% and 10% 17% respectively.