Evolutionary Computing (EC) and Ant Colony Optimization (ACO) apply stochastic searching, parallel investigation as well as autocatalitic process (or stigmergy) to solve optimization problems. This paper concentrates on the Traveling Salesman Problem (TSP) solved by evolutionary and ACO algorithms. We consider the sets of parameters and operators which influence the acting of these algorithms. Two algorithmic structures emphasizing the selection problem are discussed. We describe experiments performed for different instances of TSP problems. The comparison concludes that evolution, which is exploited especially in evolutionary algorithms, can also be observed in the performance of the ACO approach.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.