The optimization of number of kanbans with genetic algorithms, simulated annealing and tabu search

Alabas C., Altiparmak F., Dengiz B.

2000 Congress on Evolutionary Computation (CEC2000), California, Amerika Birleşik Devletleri, 16 - 19 Temmuz 2000, ss.580-585 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/cec.2000.870349
  • Basıldığı Şehir: California
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayıları: ss.580-585
  • Gazi Üniversitesi Adresli: Hayır

Özet

In this paper, three simulation search heuristic procedures based on genetic algorithms, simulated annealing and tabu search were developed and compared both with respect to the best results achieved by each algorithm in a limited time span and their speed of convergence to the results for finding the optimum number of kanbans while minimizing cost in a Just in Time manufacturing system.