The ACO/F-RACE Algorithm for Combinatorial Optimization under Uncertainty

info:eu-repo/semantics/publishe

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

Abstract 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