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

Algorithm 3

Perform TSP operators.

(1) Randomly select city ci, and find its corresponding row in the information entropy matrix;

(2) Randomly select another city nci from the top m cities based on the values of information entropy;

(3) Perform reverse operator on city ci and city nci, and evaluate its fitness value rvslength;

(4) Perform swap operator on city ci and city nci, and evaluate its fitness value swplength;

(5) Perform insert operator on city ci and city nci, and evaluate its fitness value inslength;

(6) Select the best fitness value as the new solution from the three scheme;

(7) If

(8)

(9) Update the global best solution;