Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems

ARIK O. A.

Evolutionary Intelligence, cilt.13, ss.415-425, 2019 (ESCI, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 13
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1007/s12065-019-00305-7
  • Dergi Adı: Evolutionary Intelligence
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus
  • Sayfa Sayıları: ss.415-425
  • Anahtar Kelimeler: Artificial bee colony, Genetic algorithm, Simulated annealing, Earliness, tardiness, Parallel machine, Scheduling
  • Erciyes Üniversitesi Adresli: Evet

Özet

This paper investigates unrelated parallel machine scheduling problems where the objectives are to minimize total weighted sum of earliness/tardiness costs. Three different metaheuristic algorithms are compared with others to determine what kind (swarm intelligence based, evolutionary or single solution) of metaheuristics is effective to solve these problems. In this study, artificial bee colony (ABC), genetic algorithm and simulated annealing algorithm are chosen as swarm intelligence based algorithm, evolutionary algorithm and single solution algorithm. All proposed algorithms are created without modification in order to determine effectiveness of these metaheuristics. Experimental results show that ABC outperforms its opponents in view of solution quality as swarm intelligence based metaheuristic algorithm.