Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

Algorithm 1

Basic bat algorithm (BA).

Begin

                            Initialization. Set the generation counter ; Initialize the population of bats

                             randomly and each bat corresponding to a potential solution to the given problems;

                            define loudnes , pulse frequency and the initial velocities   ;

                            set pulse rate .

           While the termination criterion is not satisfied or   do

                             Generate new solutions by adjusting frequency, and updating velocities and location

                             Solutions (2),

                            if (rand ) then

                                  Select a solution among the best solutions;

                                  Generate a location solution around the selected best solution

                            endif

                                  Generate a new solution by flying randomly

                            if (rand &&

                                  Accept the new solution

                                  Increase and reduce

                           endif

                                  Rank the bats and the find the current best

                                   ;

           endwhile

                                  Post-processing the results and visualization.

end.