| Steps . |
|---|
| Start: |
| Set pheromone pathways and parameters in motion; |
| Generate a random m ant (solution) population; |
| Choose the optimal position according to the target function for every individual ant; |
| Get the finest search ant; |
| Restore the trail of the pheromone; |
| Check if the end is true; |
| End; |
| Steps . |
|---|
| Start: |
| Set pheromone pathways and parameters in motion; |
| Generate a random m ant (solution) population; |
| Choose the optimal position according to the target function for every individual ant; |
| Get the finest search ant; |
| Restore the trail of the pheromone; |
| Check if the end is true; |
| End; |
| Steps . |
|---|
| Start: |
| Set pheromone pathways and parameters in motion; |
| Generate a random m ant (solution) population; |
| Choose the optimal position according to the target function for every individual ant; |
| Get the finest search ant; |
| Restore the trail of the pheromone; |
| Check if the end is true; |
| End; |
| Steps . |
|---|
| Start: |
| Set pheromone pathways and parameters in motion; |
| Generate a random m ant (solution) population; |
| Choose the optimal position according to the target function for every individual ant; |
| Get the finest search ant; |
| Restore the trail of the pheromone; |
| Check if the end is true; |
| End; |
This PDF is available to Subscribers Only
View Article Abstract & Purchase OptionsFor full access to this pdf, sign in to an existing account, or purchase an annual subscription.
