2020
DOI: 10.1088/1742-6596/1566/1/012131
|View full text |Cite
|
Sign up to set email alerts
|

Analysis Effect of Tournament Selection on Genetic Algorithm Performance in Traveling Salesman Problem (TSP)

Abstract: This study discusses effect of tournament selection on the way individuals compete on the performance of Genetic Algorithms so which one tournament selection is most suitable for the Traveling Salesman Problem (TSP). One algorithm in solving TSP is Genetic Algorithm, which has 3 (three) main operators, namely selection, crossover, and mutation. Selection is one of the main operators in the Genetic Algorithm, where select the best individuals who can survive (the shortest travel route). Tournament selection com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 1 publication
0
4
0
Order By: Relevance
“…One of the strategies to increase genetic diversity is the use of a selection method that, although more likely to choose elements with higher fitness, allows the choice of elements with lower fitness. One of those is the tournament method (Prayudani et al, 2020), which also has the advantage of being simple to implement. Fifteen, among the 50 elements of the population, are chosen to generate the next generation through 15 tournaments.…”
Section: Methodsmentioning
confidence: 99%
“…One of the strategies to increase genetic diversity is the use of a selection method that, although more likely to choose elements with higher fitness, allows the choice of elements with lower fitness. One of those is the tournament method (Prayudani et al, 2020), which also has the advantage of being simple to implement. Fifteen, among the 50 elements of the population, are chosen to generate the next generation through 15 tournaments.…”
Section: Methodsmentioning
confidence: 99%
“…This method determines the best individual from a group of randomly selected individuals. Then the best individual is chosen as a parent for the next generation [20].…”
Section: Evaluate Fitness Valuementioning
confidence: 99%
“…Furthermore, BT selection makes perfect sense when solving unimodal problems [20,32,96]. In addition, BT selection with replacement is better in achieving the best solution quality with low computational time [20,[96][97][98][99]. Additionally, the correspondence of BT selection in the expected ftness distribution is proven [23,32].…”
Section: Literature Reviewmentioning
confidence: 99%