2018
DOI: 10.32672/jnkti.v1i2.770
|View full text |Cite
|
Sign up to set email alerts
|

Pengaruh Inisialisasi Populasi Random Search Pada Algoritma Berevolusi Dalam Optimasi Travelling Salesman Problem (Tsp)

Abstract: <p>Traveling Salesman Problem (TSP) is a problem where each initial route of departure and return path between regions remains the same. The problem with TSP is how to get the optimum results to get the shortest path that will be passed, to solve TSP problems, one way can be by using evolved algorithms. Evolution Algorithm (AE) is a method that uses natural selection as the main idea in solving a particular problem. This algorithm is implemented through computer simulations starting from the individual p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…However, this algorithm has the disadvantage that it is trapped into a local optimum, the FA parameter is set unchanged during iteration and does not remember the history of each situation in each iteration [13]. Then research on the random search algorithm conducted by Fitiyani, et al regarding the effect of initializing the random search population on the evolved algorithm in optimizing the Traveling Salesman Problem (TSP) [14]. Using data on the effect of changes in fitness and diversity scores at each point of the path, it was then initialized with a generation number of 100 in each experiment.…”
Section: Introductionmentioning
confidence: 99%
“…However, this algorithm has the disadvantage that it is trapped into a local optimum, the FA parameter is set unchanged during iteration and does not remember the history of each situation in each iteration [13]. Then research on the random search algorithm conducted by Fitiyani, et al regarding the effect of initializing the random search population on the evolved algorithm in optimizing the Traveling Salesman Problem (TSP) [14]. Using data on the effect of changes in fitness and diversity scores at each point of the path, it was then initialized with a generation number of 100 in each experiment.…”
Section: Introductionmentioning
confidence: 99%