Mathematical Problems in Engineering / 2015 / Article / Alg 2

Research Article

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

Algorithm 2

Main procedures of .
Population: A set of solutions
Generations: The maximum number of generations
: Probabilistic model
: Generation index
(1) Initialize Population
(2)
(3) Initialize
(5) while    do
(6) EvaluateFitness(Population) with minimum loading assignment rule
(7) Selection/Elitism(Population)
(8)  BuildingProbabilityModel(Selected Chromosomes)
(9) Self-Guided Crossover( )
(10)Self-Guided Mutation( )
(11)
(12) end while