Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5128352 | Operations Research Letters | 2017 | 6 Pages |
Abstract
In this paper we study the behavior of a variant of the Max-Min Ant System algorithm when applied to a stochastic Linear Pseudo-Boolean Optimization problem. Previous related work is on a partial analysis of its performance on a different problem. Here, we carry out its complete performance analysis giving a bound on its average runtime using drift analysis. For the purpose, we give a new drift theorem and use it to analyze the algorithm when applied to our problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nassim Brahimi, Abdellah Salhi, Megdouda Ourbih-Tari,