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

Algorithm 2

The framework of DBSA.

(1) Read the TSP library and constructs the information entropy matrix;

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

(3) Initialize a population of N birds; each bird deals with a TSP path; evaluates the

length of TSP paths, i.e., the fitness values of birds;

(4) While

(5) If (t %) //foraging or keep vigilance

(6) For to N

(7) If rand

(8) Birds forage for food using Eq. (17)

(9) Else

(10) Birds keep vigilance using Eq. (18)

(11) End if

(12) Perform operator;

(13) End for

(14) Else //flying

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

(16) For to N

(17) If (i==producer)

(18) Birds flight using Eq. (19)

(19) Else

(20) Birds flight using Eq. (20)

(21) End if

(22) Perform operator;

(23) End for

(24) End if

(25) t++

(26) End While

(27) Output the global optimal solution;