Dergiler / Journal of Soft Computing and Artificial Intelligence / 2021 / Cilt: 2 - Sayı: 2

Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem

Sayfa
85–97
Yayın Tarihi
2021-12-15
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

The obtained results show that SSO outperforms some of the compared works although they are hybrid methods.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Permutation flow shop scheduling problem (PFSP) is an NP-complete problem with a wide range of applications in many real-world applications.
📊
Temel Bulgular & Veri:Recently, SSO has received increased interest in the field of combinatorial optimization as well.
💡
Sonuç & Katkı:The obtained results show that SSO outperforms some of the compared works although they are hybrid methods.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Metaheuristic · Optimization · Flow Shop Scheduling

Abstract

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.

🔖

Bu Makaleye Atıf Yap

KURDI, M. (2021). Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem. Journal of Soft Computing and Artificial Intelligence, Cilt: 2 - Sayı: 2, 85–97. https://ajindex.com/articles/779572

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (13)

  1. V. Fernandez-Viagas, R. Ruiz, J. M. Framinan, “A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation”, Eur. J. Oper. Res., vol. 257, no. 3, pp. 707-721, Mar. 2017
  2. Q. Lin, L. Gao, X. Li, C. Zhang, ”A hybrid backtracking search algorithm for permutation flow-shop scheduling problem”, Comput. Ind. Eng., vol. 85, pp. 437-446, July. 2015
  3. N. A. Alawad, B. H. Abed-alguni, ”Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem”, J Supercomput, pp. 1-22, July. 2021
  4. P. Wu, Q. Yang, W. Chen, B. Mao, H. Yu, ”An Improved Genetic-Shuffled Frog-Leaping Algorithm for Permutation Flowshop Scheduling”, Complexity, 2020
  5. L. Libralesso, P. A. Focke, A Secardin, V. Jost, “Iterative beam search algorithms for the permutation flowshop”, arXiv preprint arXiv, Sep. 2020
  6. C. Y. Hsu, P. C. Chang, M. H. Chen, “A linkage mining in block-based evolutionary algorithm for permutation flowshop scheduling problem”, Comput. Ind. Eng., vol. 83, pp. 159-171, May. 2015
  7. F. Zhao, J. Zhang, J. Wang, C. Zhang, “A shuffled complex evolution algorithm with opposition-based learning for a permutation flow shop scheduling problem”, Int. J. Computer Integr. Manuf., vol. 28, no. 11, pp. 1220-1235, Oct. 2015
  8. M. Kurdi, ”A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem”, Appl. Soft Comput., vol. 94, Sept. 2020
  9. M. Bessedik, F. B. S. Tayeb, H. Cheurfi, A. Bliz, ”An immunity-based hybrid genetic algorithms for permutation flowshop scheduling problems”, Int. J. Adv. Manuf. Syst., vol. 85. no 9-12, pp. 2459-2469, Aug. 2016
  10. F. B. S. Tayeb, M. Bessedik, M. Benbouzid, M. Benbouzid, H. Cheurfi, A. Blizak, “Research on Permutation Flow-shop Scheduling Problem based on Improved Genetic Immune Algorithm with vaccinated offspring”, Procedia Comput. Sci., vol. 112, pp. 427-436, 2017
  11. F. Zhao, Y. Liu, Z. Shao, X. Jiang, C. Zhang, J. Wang, “A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem”, Int. J. Computer Integr. Manuf., vol. 29, no. 9, pp. 962-981, 2016
  12. Ö. Tosun, M. K. Marichelvam, “Hybrid bat algorithm for flow shop scheduling problems”, Int. J. Math. Oper., vol. 9, no. 1, pp. 125-138, 2016
  13. S. Deb, Z. Tian, S. Fong, R. Tang, R. Wong, N. Dey, “Solving permutation flow-shop scheduli