2008
DOI: 10.1016/j.pnsc.2008.03.028
|View full text |Cite
|
Sign up to set email alerts
|

An ant colony optimization method for generalized TSP problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
90
0
2

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 210 publications
(92 citation statements)
references
References 14 publications
0
90
0
2
Order By: Relevance
“…Other hands, in the later period of PSO, we should decrease ω to enhance the local search ability. 1 c and 2 c are two so called parameters to weigh the importance of self-cognitive and social-influence, so we should take bigger 2 c and smaller 1 c in early stage, which can enhance the diversity of the swarm. On the contrary, we should take bigger 1 c and smaller 2 c to enhance the local search ability and the convergence speed in the later period.…”
Section: B Self-adaptive Pso Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Other hands, in the later period of PSO, we should decrease ω to enhance the local search ability. 1 c and 2 c are two so called parameters to weigh the importance of self-cognitive and social-influence, so we should take bigger 2 c and smaller 1 c in early stage, which can enhance the diversity of the swarm. On the contrary, we should take bigger 1 c and smaller 2 c to enhance the local search ability and the convergence speed in the later period.…”
Section: B Self-adaptive Pso Algorithmmentioning
confidence: 99%
“…Traditional algorithms existed for TSP such as stage dynamic programming, linear programming solution, and greedy method will get into the "combinational explosion problem" with the increase of city number. In recent years, people proposed many intelligence optimization algorithms, such as GA, ACO [1], PSO, firefly algorithm (FA) [2], and cuckoo search algorithm (CSA) [3]. Though these algorithms cannot ensure to find the best solution, they decrease the solution space and increase the probability of explores the optima.…”
Section: Introductionmentioning
confidence: 99%
“…Updating: when more ants pass from the same route, the more amount of pheromone gets deposited and also it vanishes as time goes on. the pheromone evaporation are covered in [24]. The concern of ACO is sometimes trapping into a local minimum and memory limitations for large-size problems.…”
Section: Ant Colony Optimizationmentioning
confidence: 99%
“…According to the experimental results, the algorithm in the optimal solution accuracy and convergence speed was both improved. Foreign scholars Yang Jinhui (2008) [3] and others proposed an ant colony algorithm with variation process and local search. TSP problems could be solved well by using this improved ant colony algorithm.…”
Section: The Application Of Ant Colony Algorithm In Traveling Salesmamentioning
confidence: 99%