2009 5th International Conference on Wireless Communications, Networking and Mobile Computing 2009
DOI: 10.1109/wicom.2009.5301753
|View full text |Cite
|
Sign up to set email alerts
|

The Improvement of Ant Colony Algorithm and Its Application to TSP Problem

Abstract: The researches and applications on ant colony algorithm have made great progress in recent years. A number of results have proved the validity of the algorithm and its advantages in some fields. However, its basic shortcomings, which are long searching time and easily jumping into local optimal solution, have not been completely solved. This paper analyzes the reasons of stagnation and then introduces a new solution for avoiding stagnation, which includes the direct exchange of pheromone of some edges and dyna… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…Although traditional routing protocols have performed well in UASNs, they are limited by multiple constraints and a high computational complexity [33]. With the advance of artificial intelligence (AI), many intelligent algorithms have been developed for the routing protocol of UASNs, for example, the artificial fish swim algorithm (AFSA), simulated annealing algorithm (SAA), ant colony algorithm (ACA) [34], and Q-learning algorithm. Although these intelligent algorithms can determine the optimal solution through iteration, they still have the shortcoming of falling into the local optimum because of the long search time.…”
Section: Related Researchmentioning
confidence: 99%
“…Although traditional routing protocols have performed well in UASNs, they are limited by multiple constraints and a high computational complexity [33]. With the advance of artificial intelligence (AI), many intelligent algorithms have been developed for the routing protocol of UASNs, for example, the artificial fish swim algorithm (AFSA), simulated annealing algorithm (SAA), ant colony algorithm (ACA) [34], and Q-learning algorithm. Although these intelligent algorithms can determine the optimal solution through iteration, they still have the shortcoming of falling into the local optimum because of the long search time.…”
Section: Related Researchmentioning
confidence: 99%
“…Extract the data with fault characteristics and use the KNN method to judge the fault data in the next step. The KNN method judges the label type of unlabeled data according to the input labeled data [15] . Hereby, the three-phase current data of the inverter can still be input as three-dimensional data.…”
Section: Fault Feature Extractionmentioning
confidence: 99%