| Thomas Stutzle and Marco Dorigo. ACO Algorithms for the Traveling Salesman Problem. In K. Miettinen, M. Makela, P. Neittaanmaki, and J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science. Wiley, 1999. |
No context found.
T. Stutzle and M. Dorigo. ACO algorithms for the traveling salesman problem. In K. Miettinen, M. M. Makela, P. Neittaanmaki, and J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, pages 163{ 183. John Wiley & Sons, Chichester, UK, 1999.
....AS to achieve much better performance. These improved algorithms include elitist Ant System [3] Ant Colony System (ACS) 6] MAX MIN Ant System (MMAS) 19, 20] the rank based version of Ant System [1] and Best Worst Ant System [2] Typically, these algorithms have been tested again on the TSP [17] and have shown signi cantly better performance that AS in several applications. Only few other successful ant algorithms were proposed for tackling NP hard optimization problems that do not follow the rules of the ACO metaheuristic. These exceptions include Hybrid Ant System (HAS) proposed by ....
T. Stutzle and M. Dorigo. ACO algorithms for the traveling salesman problem. In K. Miettinen, M. M. Makela, P. Neittaanmaki, and J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, pages 163-183. John Wiley & Sons, Chichester, UK, 1999.
No context found.
Thomas Stutzle and Marco Dorigo. ACO Algorithms for the Traveling Salesman Problem. In K. Miettinen, M. Makela, P. Neittaanmaki, and J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science. Wiley, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC