
158 High Performance Programming for Soft Computing
7.4 Elitist AS: An Extension of AS
With an Elitist Strategy (Marco Dorigo 2004), there is a reinforcement to the
arcs belonging to the best tour found since the beginning of the algorithm
which is denoted as T
bs
(best–so–far tour), and it is applied with a feedback
to the best–so–far tour, and it consists in additional pheromone deposited
by an additional ant called best–so–far ant.
The additional reinforcement of tour T
bs
is achieved by adding a
parameter e/C
bs
to its arcs, where e is a parameter that defi nes the weight
given to the best–so–far tour, and C
bs
is its length, see Eq. (7.4.1),
߬
՚߬ ...