Vol.31, No.1, 2022, pp.429-448, doi:10.32604/iasc.2022.019330
OPEN ACCESS
ARTICLE
A Dynamic Adaptive Firefly Algorithm for Flexible Job Shop Scheduling
  • K. Gayathri Devi*, R. S. Mishra, A. K. Madan
Department of Mechanical Engineering, Delhi Technological University, Delhi, India
* Corresponding Author: K. Gayathri Devi. Email:
Received 10 April 2021; Accepted 06 June 2021; Issue published 03 September 2021
Abstract
An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires more computational effort to optimize the objectives with contradictory measures. This paper aims to address the FJSP problem with combined and contradictory objectives, like minimization of make-span, maximum workload, and total workload. This paper proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version of the classic Firefly Algorithm (FA) embedded with adaptive parameters to optimize the multi objectives concurrently. The proposed algorithm has adopted two adaptive strategies, i.e., an adaptive randomization parameter (α) and an effective heterogeneous update rule for fireflies. The adaptations proposed by this paper can help the optimization process to strike a balance between diversification and intensification. Further, an enhanced local search algorithm, Simulated Annealing (SA), is hybridized with Adaptive FA to explore the local solution space more efficiently. This paper has also attempted to solve FJSP by a rarely used integrated approach where assignment and sequencing are done simultaneously. Empirical simulations on benchmark instances demonstrate the efficacy of our proposed algorithms, thus providing a competitive edge over other nature-inspired algorithms to solve FJSP.
Keywords
Adaptive firefly algorithm; combined objective optimization; integrated approach; flexible job-shop scheduling problem
Cite This Article
Devi, K. G., Mishra, R. S., Madan, A. K. (2022). A Dynamic Adaptive Firefly Algorithm for Flexible Job Shop Scheduling. Intelligent Automation & Soft Computing, 31(1), 429–448.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.