2020
DOI: 10.37418/amsj.9.6.70
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Ant Colony Algorithm Based on Levy Flight Distribution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…In ACO, a complete tour is formed for the first ant before initiating the tour for the second ant. At the inception of the algorithm, the initial pheromones deposited on the connections are set to a small value, such as τ 0 > 0 [73].…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In ACO, a complete tour is formed for the first ant before initiating the tour for the second ant. At the inception of the algorithm, the initial pheromones deposited on the connections are set to a small value, such as τ 0 > 0 [73].…”
Section: Methodsmentioning
confidence: 99%
“…Consequently, the pheromone on all connections evaporates, as defined by Equation (44). This process of reducing the number of pheromones on all possible paths is referred to as local updating [73]. τij()t+1badbreak=()1ξ0.33emτij()t$$\begin{equation}{\tau }_{ij} \left( {t + 1} \right) = \left( {1 - \xi } \right)\ {\tau }_{ij}\left( t \right)\end{equation}$$where ξ is the pheromone evaporation factor.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation