• Citer

The ACO/F-Race algorithm for combinatorial optimization under uncertainty

par Birattari, Mauro ;Balaprakash, Prasanna ;Dorigo, Marco
Référence Operations research, computer science. Interface series, 39, page (189-203)
Publication Publié, 2007

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

The paper introduces ACO/F-Race, an algorithm for tackling combinatorial optimization problems under uncertainty. The algorithm is based on ant colony optimization and on F-Race. The latter is a general method for the comparison of a number of candidates and for the selection of the best one according to a given criterion. Some experimental results on the probabilistic traveling salesman problem are presented. © 2007 by Springer Science+Business Media, LLC.