Research Article
Annealing Ant Colony Optimization with Mutation Operator for Solving TSP
Algorithm 1
Pseudocode for ant system.
(1) begin | output: | (2) Create_Heuristic_Solution(Problem_Size); | (3) ; | (4) InitializePheromone(); | (5) while ( Stop_Condition()) do | (6) Candidates ; | (7) for ( To ) do | (8) ProbabilisticStepwiseConstruction(Pheromone, ProblemSize, , ); | (9) Cost(); | (10) if () then | (11) ; | (12) ; | (13) end | (14) Candidates ; | (15) end | (16) DecayPheromone (Pheromone, ); | (17) for () do | (18) UpdatePheromone (Pheromone, , ); | (19) end | (20) end | (21) return () | (22) end |
|