Permutation flow shop scheduling problem (PFSP) is an NP-complete problem with a wide range of applications in many real-world applications. Social spider optimization (SSO) is a swarm intelligence algorithm proposed for continuous optimization problems. Recently, SSO has received increased interest in the field of combinatorial optimization as well. For this reason, in this paper, SSO algorithm is proposed to solve the PFSP with make span minimization. The proposed algorithm has been tested on 141 well-known benchmark instances and compared against six other conventional and best-so-far metaheuristics. The obtained results show that SSO outperforms some of the compared works although they are hybrid methods.
Metaheuristic Optimization Flow Shop Scheduling Social Spider swarm intelligence
Birincil Dil | İngilizce |
---|---|
Konular | Yapay Zeka |
Bölüm | Research Articles |
Yazarlar | |
Yayımlanma Tarihi | 15 Aralık 2021 |
Gönderilme Tarihi | 22 Ekim 2021 |
Yayımlandığı Sayı | Yıl 2021 Cilt: 2 Sayı: 2 |
This work is licensed under a Creative Commons Attribution 4.0 International License.