Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem
Systems · 26.04.2023 · 11 (5) · 221
DOI: 10.3390/systems11050221 ↗Kurz gefasst
Fachartikel in der Zeitschrift Systems, online erschienen am 26.04.2023. Verfasst von Iqbal Hayat und 6 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Permutation flow-shop scheduling is the strategy that ensures the processing of jobs on each subsequent machine in the exact same order while optimizing an objective, which generally is the minimization of makespan. Because of its NP-Complete nature, a substantial portion of the literature has mainly focused on computational efficiency and the development of different AI-based hybrid techniques. Particle Swarm Optimization (PSO) has also been frequently used for this purpose in the recent past. Following the trend and to further explore the optimizing capabilities of PSO, first, a standard PSO was developed during this research, then the same PSO was hybridized with Variable Neighborhood Search (PSO-VNS) and later on with Simulated Annealing (PSO-VNS-SA) to handle Permutation Flow-Shop Scheduling Problems (PFSP). The effect of hybridization was validated through an internal comparison based on the results of 120 different instances devised by Taillard with variable problem sizes. Moreover, further comparison with other reported hybrid metaheuristics has proved that the hybrid PSO (HPSO) developed during this research performed exceedingly well. A smaller value of 0.48 of ARPD (Average Relative Performance Difference) for the algorithm is evidence of its robust nature and significantly improved performance in optimizing the makespan as compared to other algorithms.
Zitieren
APA
Hayat, I., Tariq, A., Shahzad, W., Masud, M., Ahmed, S., Ali, M. U., & Zafar, A. (2023). Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem. Systems, 11(5), 221. https://doi.org/10.3390/systems11050221
Vancouver
Hayat I, Tariq A, Shahzad W, Masud M, Ahmed S, Ali MU, et al. Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem. Systems. 2023;11(5):221. doi:10.3390/systems11050221
BibTeX
@article{Hayat2023,
author = {Hayat, Iqbal and Tariq, Adnan and Shahzad, Waseem and Masud, Manzar and Ahmed, Shahzad and Ali, Muhammad Umair and Zafar, Amad},
title = {Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem},
journal = {Systems},
year = {2023},
volume = {11},
number = {5},
pages = {221},
doi = {10.3390/systems11050221}
}
EUVIMED