R.A. Zaitar and H. Hiyassat (Jordan)
Ant Colony, Genetic Algorithm and Traveling SalesmanProblem.
In this paper we propose a new approach towards the relationship between the ACO parameters suggested by Dorigo et al. [1], we propose the usage of the standard genetic algorithm in optimizing the ACO parameters, the algorithm is applied on the classical travelling salesman problem, and we test this algorithm on deferent set of cities. The results found are similar to the results found by Dorigo. . We found that that the average value of (the relative importance of trail ) to be equal to 1.5729 and (the visibility ) to be equal to 1.3896 while we found that the value of the trial persistence to be equal to 0.52. We found that all the parameters are independent of number of cities.
Important Links:
Go Back
