Discrete Bird Swarm Algorithm Based on Information Entropy Matrix for Traveling Salesman Problem

Algorithm 1

Framework of the BSA.

(1) Initialize the parameter values of N, M, FQ, P;

(2) Initialize a population of birds and evaluate the individuals’ fitness value.

(3) While

(4) If ( %)

(5) For to

(6) If rand

(7) Birds forage for food using Eq. (1)

(8) Else

(9) Birds keep vigilance using Eq. (2)

(10) End if

(11) End for

(12) Else

(13) Divide the swarm into two parts: producers and scroungers.

(14) For to

(15) If (==producer)

(16) Birds flight using Eq. (5) //producer

(17) Else

(18) Birds flight using Eq. (6) //scrounger

(19) End if

(20) End for

(21) End if

(22) Evaluate the fitness value of the new solution;

(23) If

(24) = ;

(25) Update the global optimal solution;

(26) t++

(27) End While

(28) Output the global optimal solution;