15-01-2013, 02:09 PM
Algorithm parameters
Algorithm.ppt (Size: 208.5 KB / Downloads: 22)
ALGORITHM
Each ant located at city i hops to a city j selected among the cities that have not yet been visited according to the probability.
d(i,j) :attractiveness, d(i,j) is the function which is chosen to the inverse of the cost.
t(i,j) :the trail level t(i,j) of the move, indicating the amount of pheromone trail on edge (i,j)
Jk(i): et of cities that have not yet been visited by ant k in city i
Pk(i,j): Probability that ant k in city i will go to city j
Once a tour has been completed (i.e. each city has been visited exactly once by the ant) pheromone evaporation the edges are calculated and then each ant deposits pheromone on the complete tour by a quantity which is calculated by the following formula: