Explorer agent algorithm

1. Initialize

set t:= 0

For every edge (i,j) set an initial value Tij(t) for trail intensity. Place m ants on the source node. [Generate new explorers at freq. ef] ]

2. Set s:= 1 { tabu list index)

for k:= 1 to m do

Place starting town of the kth

ant in tabuk(s).

3. Repeat until dest’n reached:

Set s := s + 1

for k:=1 to m do

Choose the node j to move to

with probability pijk (t)

Move the kth ant to node j.

Update explorer route cost:

rk = rk + c(i,j)

if (rk > rmax)

kill explorerk

Insert town j in tabuk(s).

At destination go to 4.

4. While s > 1

traverse edge (i,j)

T(i,j) = T(i,j) + pe

s := s - 1

5. At source node do:

if (pathe = pathBuffer * d)

create and send allocator

if t > Tmax

create and send allocator

Evaporation occurs concurrently with exploration

Previous slide

Next slide

Back to first slide

View graphic version