Intensification and diversification strategies in ant colony system

Marcus Randall, Elliot Tonkcs

Research output: Contribution to journalArticleResearchpeer-review

6 Citations (Scopus)

Abstract

The ant colony optimisation class of meta-heuristics simulate the ability of ant colonies to determine shortest paths to food. In this paper, we investigate strategies for achieving a balance between intensification and diversification search phases apart from that implicit in the algorithm itself. This is achieved by continually varying the sensitivity with which ants(agents) perceive pheromone trails. This has the effect of allowing the ants to both refine the search in promising regions and to escape explored areas of the search space. We examine four strategies using the well-known travelling salesman problem. The results indicate that while the explicit intensification/diversification schemes occasionally outperform the standard ant colony optimisation, the algorithm's inherent intensification/diversification characteristics are often sufficient to and good quality solutions.

Original languageEnglish
JournalComplexity International
Volume9
Publication statusPublished - 1 Dec 2002

Fingerprint

Traveling salesman problem

Cite this

@article{752b3ee3a63f41b8b93abddcb41ebaac,
title = "Intensification and diversification strategies in ant colony system",
abstract = "The ant colony optimisation class of meta-heuristics simulate the ability of ant colonies to determine shortest paths to food. In this paper, we investigate strategies for achieving a balance between intensification and diversification search phases apart from that implicit in the algorithm itself. This is achieved by continually varying the sensitivity with which ants(agents) perceive pheromone trails. This has the effect of allowing the ants to both refine the search in promising regions and to escape explored areas of the search space. We examine four strategies using the well-known travelling salesman problem. The results indicate that while the explicit intensification/diversification schemes occasionally outperform the standard ant colony optimisation, the algorithm's inherent intensification/diversification characteristics are often sufficient to and good quality solutions.",
author = "Marcus Randall and Elliot Tonkcs",
year = "2002",
month = "12",
day = "1",
language = "English",
volume = "9",
journal = "Complexity International",
issn = "1320-0682",
publisher = "Charles Sturt University",

}

Intensification and diversification strategies in ant colony system. / Randall, Marcus; Tonkcs, Elliot.

In: Complexity International, Vol. 9, 01.12.2002.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Intensification and diversification strategies in ant colony system

AU - Randall, Marcus

AU - Tonkcs, Elliot

PY - 2002/12/1

Y1 - 2002/12/1

N2 - The ant colony optimisation class of meta-heuristics simulate the ability of ant colonies to determine shortest paths to food. In this paper, we investigate strategies for achieving a balance between intensification and diversification search phases apart from that implicit in the algorithm itself. This is achieved by continually varying the sensitivity with which ants(agents) perceive pheromone trails. This has the effect of allowing the ants to both refine the search in promising regions and to escape explored areas of the search space. We examine four strategies using the well-known travelling salesman problem. The results indicate that while the explicit intensification/diversification schemes occasionally outperform the standard ant colony optimisation, the algorithm's inherent intensification/diversification characteristics are often sufficient to and good quality solutions.

AB - The ant colony optimisation class of meta-heuristics simulate the ability of ant colonies to determine shortest paths to food. In this paper, we investigate strategies for achieving a balance between intensification and diversification search phases apart from that implicit in the algorithm itself. This is achieved by continually varying the sensitivity with which ants(agents) perceive pheromone trails. This has the effect of allowing the ants to both refine the search in promising regions and to escape explored areas of the search space. We examine four strategies using the well-known travelling salesman problem. The results indicate that while the explicit intensification/diversification schemes occasionally outperform the standard ant colony optimisation, the algorithm's inherent intensification/diversification characteristics are often sufficient to and good quality solutions.

UR - http://www.scopus.com/inward/record.url?scp=19744381617&partnerID=8YFLogxK

M3 - Article

VL - 9

JO - Complexity International

JF - Complexity International

SN - 1320-0682

ER -