Ants easily solve stochastic shortest path problems
Benjamin Doerr, Ashish R. Hota, Timo Kötzing · 2012
The first rigorous theoretical analysis (Horoba, Sudholt (GECCO 2010)) of an ant colony optimizer for the stochastic shortest path problem suggests that ant system experience significant difficulties when the input data is prone to noise. In this work, we propose a slightly different ant optimizer to deal with noise.