98 Firefly Algorithm (FFA)
• Step 1 (Initialization): Set the number of colonies/subpopulation each with its
own fireflies on an individual threads and define the communication time; i.e., for
every 100 iterations.
• Step 2 (Execution): Run firefly optimization on individual threads.
• Step 3 (Communication): Sort agents in individual threads according to their
attractiveness and divide them into two groups. Every subpopulation exchanges
half its agents with another subpopulation.
After that, sub-colonies are replaced with a new population and search process is con-
tinued.
5.2.5 FFA for constrained problems
A version of FFA to handle optimization problems with constraints is proposed in [11].
The constrained problem is transformed into an unconstrained one ...