TY - JOUR
T1 - The ACO/F-Race algorithm for combinatorial optimization under uncertainty
AU - Birattari, Mauro
AU - Balaprakash, Prasanna
AU - Dorigo, Marco
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
KW - Ant colony optimization
KW - Combinatorial optimization under uncertainty
UR - http://www.scopus.com/inward/record.url?scp=84888618661&partnerID=8YFLogxK
U2 - 10.1007/978-0-387-71921-4_10
DO - 10.1007/978-0-387-71921-4_10
M3 - Article
AN - SCOPUS:84888618661
SN - 1387-666X
VL - 39
SP - 189
EP - 203
JO - Operations Research/ Computer Science Interfaces Series
JF - Operations Research/ Computer Science Interfaces Series
ER -