Research Article
Mathematical Modeling and Discrete Firefly Algorithm to Optimize Scheduling Problem with Release Date, Sequence-Dependent Setup Time, and Periodic Maintenance
Algorithm 1
Classic Firefly Algorithm (FA).
Parameter Initialization for the algorithm & define the objective function ) | |
Generation of the initial population . | |
while i ≤ number of fireflies do | |
Evaluation of the light intensity | |
i++; | |
End | |
while x ≤ Maximum number of iterations do | |
i← 1; | |
while i ≤ number of fireflies do | |
j← 1; | |
while j ≤ number of fireflies do | |
if | |
Calculate the distance between two fireflies | |
Firefly with less luminous moves to the brighter once | |
Attractiveness varies with distance r via ; | |
Evaluation of the light intensities of new solutions and update the light | |
intensity; | |
j++; | |
End | |
Rank the fireflies and obtain the current best; | |
i++; | |
End | |
x ++; | |
end |