Genetic algorithm and simulated annealing applied to two dimensional non-guillotine rectangular cutting problems


Soke A., Bingul Z.

8th IASTED International Conference on Artificial Intelligence and Soft Computing, Marbella, İspanya, 1 - 03 Eylül 2004, ss.404-409 identifier identifier

  • Basıldığı Şehir: Marbella
  • Basıldığı Ülke: İspanya
  • Sayfa Sayıları: ss.404-409

Özet

In this paper, genetic algorithm (GA) and simulated annealing (SA) with improved bottom left (BL) algorithm were applied to two dimensional non-guillotine rectangular cutting problems. The performance and efficiency of these algorithms on several test problems [1] were compared based on the trim loss values of these test problems. These test problems are grouped into two categories: five different test problems consisting of 17 individual rectangular pieces and one test problem consisting of 29 individual rectangular pieces on a main object limited with 200x200 unit field which has zero trim loss value. The influences of the GA parameters (population sizes, mutation rates, crossover techniques) and the SA parameters (cooling schedules, neighborhood moves, the possible number of neighborhood moves, different temperature values) on the solutions of these problems were examined by varying these parameters. For considering all solutions of the test problems, the hybrid GA produces much better results than the hybrid SA.