2012 IEEE Congress on Evolutionary Computation 2012
DOI: 10.1109/cec.2012.6252923
|View full text |Cite
|
Sign up to set email alerts
|

Improving exploration in Ant Colony Optimisation with antennation

Abstract: Ant Colony Optimisation (ACO) algorithms use two heuristics to solve computational problems: one long-term (pheromone) and the other short-term (local heuristic). This paper details the development of antennation, a mid-term heuristic based on an analogous process in real ants. This is incorporated into ACO for the Travelling Salesman Problem (TSP). Antennation involves sharing information of the previous paths taken by ants, including information gained from previous meetings. Antennation was added to the Ant… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 27 publications
0
7
0
Order By: Relevance
“…This, in turn, produces locally optimal solutions and hence overall performance is suboptimal. To deal with this problem, some direct communication mechanisms between entities have been studied [31,9]. For example, in [31] a direct communication for ACO algorithms in which near ants can exchange information is proposed.…”
Section: Discussionmentioning
confidence: 99%
“…This, in turn, produces locally optimal solutions and hence overall performance is suboptimal. To deal with this problem, some direct communication mechanisms between entities have been studied [31,9]. For example, in [31] a direct communication for ACO algorithms in which near ants can exchange information is proposed.…”
Section: Discussionmentioning
confidence: 99%
“…EACS algorithm consists of three main elements which are probabilistic decision rule, local pheromone update and global pheromone update. The purpose of the local pheromone update is to make the most visited sensor node less attractive to the following ants as well as encouraging the exploration of other sensor nodes [26]. This approach can prevent the hotspot problem on certain sensor nodes and increase the network lifetime of WSN.…”
Section: Enhanced Ant Colony Optimization For Wireless Sensor Networkmentioning
confidence: 99%
“…[46]) or phenomena such as stridulation, whereby individual ants can use sound signals to communicate with other ants, for example to recruit them for a specific task [282]. This alteration in the environment has the effect of influencing the subsequent behaviour of other members of the group.…”
Section: Ant Algorithmsmentioning
confidence: 99%
“…While good choices for α and β are problemspecific, parameters of 2 and −2 respectively are not unusual [46]. Examining the form of this arc choice rule, if the term β = 0, then (9.3) effectively reduces to (9.2) and only pheromone information is used in determining the ants' movements.…”
Section: Constructing Protosolutionsmentioning
confidence: 99%
See 1 more Smart Citation