Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem

Algorithm 1

Minimum loading assignment rule.

Require:

   : The position of a city in the sequence

   : The current number of cities assigned to a salesman

   : The visiting sequence of cities

(1) 1

(2) while    do

(3)  1

(4) 

(5) 

(6) 

(7) end while

(8) while    do

(9) Select a salesman who could process the with the minimum objective value

(10) 

(11)  

(12)  

(13) end whie