Back to Search
Start Over
A comparative analysis of SAMP-Jaya and simple Jaya algorithms for PFSSP (permutation flow shop scheduling problems).
- Source :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications; Aug2023, Vol. 27 Issue 15, p10759-10776, 18p
- Publication Year :
- 2023
-
Abstract
- In this study, the permutation flow shop scheduling problem with makespan criteria is investigated, and two algorithms, Jaya and SAMP-Jaya, are proposed. Jaya is a simple and effective meta-heuristic optimization technique that has been successfully applied in various engineering problems, while SAMP-Jaya is a modified version of Jaya that uses a multi-population approach. Both algorithms are parameter-less, and the ANOVA experiment is used to identify the significant control parameters. The population size is found to be the most crucial parameter for improving solution quality. The performance of Jaya and SAMP-Jaya is compared to the exact solution and the genetic algorithm, demonstrating the superiority of the proposed algorithms. The computational results confirm that the suggested optimization techniques are effective in terms of solution quality. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14327643
- Volume :
- 27
- Issue :
- 15
- Database :
- Complementary Index
- Journal :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 164373807
- Full Text :
- https://doi.org/10.1007/s00500-023-08261-2