Title: | Robustness of Ant Colony Optimization to Noise |
Author(s): | Friedrich T; Kotzing T; Krejca MS; Sutton AM; |
Address: | "Hasso Plattner Institute, University of Potsdam, Potsdam, Germany friedrich@hpi.de. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany timo.koetzing@hpi.de. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany martin.krejca@hpi.de. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany andrew.sutton@hpi.de" |
ISSN/ISBN: | 1530-9304 (Electronic) 1063-6560 (Linking) |
Abstract: | "Recently, ant colony optimization (ACO) algorithms have proven to be efficient in uncertain environments, such as noisy or dynamically changing fitness functions. Most of these analyses have focused on combinatorial problems such as path finding. We rigorously analyze an ACO algorithm optimizing linear pseudo-Boolean functions under additive posterior noise. We study noise distributions whose tails decay exponentially fast, including the classical case of additive Gaussian noise. Without noise, the classical [Formula: see text] EA outperforms any ACO algorithm, with smaller [Formula: see text] being better; however, in the case of large noise, the [Formula: see text] EA fails, even for high values of [Formula: see text] (which are known to help against small noise). In this article, we show that ACO is able to deal with arbitrarily large noise in a graceful manner; that is, as long as the evaporation factor [Formula: see text] is small enough, dependent on the variance [Formula: see text] of the noise and the dimension n of the search space, optimization will be successful. We also briefly consider the case of prior noise and prove that ACO can also efficiently optimize linear functions under this noise model" |
Keywords: | "Algorithms Animals Ants/*physiology Models, Theoretical *Noise Pheromones/physiology Ant colony optimization Noisy Fitness Run time analysis Theory;" |
Notes: | "MedlineFriedrich, Tobias Kotzing, Timo Krejca, Martin S Sutton, Andrew M eng 2016/03/02 Evol Comput. 2016 Summer; 24(2):237-54. doi: 10.1162/EVCO_a_00178. Epub 2016 Feb 29" |