2019 3rd International Conference on Electrical, Telecommunication and Computer Engineering (ELTICOM) 2019
DOI: 10.1109/elticom47379.2019.8943832
|View full text |Cite
|
Sign up to set email alerts
|

The Combination of Ant Colony Optimization (ACO) and Tabu Search (TS) Algorithm to Solve the Traveling Salesman Problem (TSP)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(14 citation statements)
references
References 11 publications
0
13
0
Order By: Relevance
“…In these applications, the city nodes in the graph represent, for instance, customers, soldering points, or DNA fragments, and each city pair or the distance represents the traveling time duration or cost, or the measurement between DNA fragments. Corresponding algorithms for coping with TSP include reinforcement learning [50], simulated annealing [51], genetic algorithm [52], ant colony [53], tabu search [54], or some mixed ones [124][125][126].…”
Section: Traveling Salesman Problemmentioning
confidence: 99%
“…In these applications, the city nodes in the graph represent, for instance, customers, soldering points, or DNA fragments, and each city pair or the distance represents the traveling time duration or cost, or the measurement between DNA fragments. Corresponding algorithms for coping with TSP include reinforcement learning [50], simulated annealing [51], genetic algorithm [52], ant colony [53], tabu search [54], or some mixed ones [124][125][126].…”
Section: Traveling Salesman Problemmentioning
confidence: 99%
“…The closer the distance between the food, the less evaporation will occur, increasing the amount of pheromones. The more pheromones, the ants will follow the footprints [9]. The MPPT control flowchart using the ACO algorithm is shown in Figure 1.…”
Section: Mppt Simulation Using Aco and Pso Algorithmsmentioning
confidence: 99%
“…The ACO algorithm is a heuristic algorithm inspired by the actual foraging behavior of ant colony [41], and it is often used to tackle path planning problems in TSP model because of its strong robustness, easy implementation, and convenient combination with other algorithms to improve performance [42]. However, the traditional ACO algorithm only considers the pheromone in the current state and neglects the influence of pheromones in subsequent states.…”
Section: B Path Planning Algorithmmentioning
confidence: 99%