zbMATH — the first resource for mathematics

The \(ACO/F-Race\) algorithm for combinatorial optimization under uncertainty. (English) Zbl 1173.90587
Doerner, Karl F. (ed.) et al., Metaheuristics. Progress in complex systems optimization. Papers presented at the 6th metaheuristics international conference, Wien, Austria, August 22–26, 2005. New York, NY: Springer (ISBN 978-0-387-71919-1/hbk). Operations Research/Computer Science Interfaces Series 39, 189-203 (2007).
Summary: 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.
For the entire collection see [Zbl 1130.90004].

90C59 Approximation methods and heuristics in mathematical programming
90C27 Combinatorial optimization