ISSN 2394-5125
 

Review Article 


Traveling Salesman Problem Solution using Genetic Algorithm

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat.

Abstract
Artificial intelligence is significantly increased with technological advancements. It can be seen in many applications of artificial intelligence in technological development. Many artificial intelligence technologies solve cases. One of the problems that can be solved by artificial intelligence is the Traveling Salesman Problem. In the Traveling Salesman Program, a salesperson must travel to several destinations with optimal mileage. For a small amount of destination, the optimum distance can be reached with a minimum distance. However, in more extensive cases, the optimum distance can be obtained with a very minimal distance in the search process. The genetic algorithm can find the optimum distance by regenerating each population so that it produces the minimum value. This value is not the minimum value in all points, but it can be the optimum global value. By applying the science of artificial intelligence in the case of Traveling Salesman Problem, the amount of mileage will be optimized.

Key words: artificial intelligence, TSP, shortest path, optimum


 
ARTICLE TOOLS
Abstract
PDF Fulltext
How to cite this articleHow to cite this article
Citation Tools
Related Records
 Articles by Hariyadi
Articles by Putri Mutira
Articles by Phong Thanh Nguyen
Articles by Iswanto Iswanto
Articles by Dadang Sudrajat
on Google
on Google Scholar


How to Cite this Article
Pubmed Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. Traveling Salesman Problem Solution using Genetic Algorithm. JCR. 2020; 7(1): 56-61. doi:10.22159/jcr.07.01.10


Web Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. Traveling Salesman Problem Solution using Genetic Algorithm. http://www.jcreview.com/?mno=302645133 [Access: May 30, 2021]. doi:10.22159/jcr.07.01.10


AMA (American Medical Association) Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. Traveling Salesman Problem Solution using Genetic Algorithm. JCR. 2020; 7(1): 56-61. doi:10.22159/jcr.07.01.10



Vancouver/ICMJE Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. Traveling Salesman Problem Solution using Genetic Algorithm. JCR. (2020), [cited May 30, 2021]; 7(1): 56-61. doi:10.22159/jcr.07.01.10



Harvard Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat (2020) Traveling Salesman Problem Solution using Genetic Algorithm. JCR, 7 (1), 56-61. doi:10.22159/jcr.07.01.10



Turabian Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. 2020. Traveling Salesman Problem Solution using Genetic Algorithm. Journal of Critical Reviews, 7 (1), 56-61. doi:10.22159/jcr.07.01.10



Chicago Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. "Traveling Salesman Problem Solution using Genetic Algorithm." Journal of Critical Reviews 7 (2020), 56-61. doi:10.22159/jcr.07.01.10



MLA (The Modern Language Association) Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat. "Traveling Salesman Problem Solution using Genetic Algorithm." Journal of Critical Reviews 7.1 (2020), 56-61. Print. doi:10.22159/jcr.07.01.10



APA (American Psychological Association) Style

Hariyadi, Putri Mutira, Phong Thanh Nguyen, Iswanto Iswanto, Dadang Sudrajat (2020) Traveling Salesman Problem Solution using Genetic Algorithm. Journal of Critical Reviews, 7 (1), 56-61. doi:10.22159/jcr.07.01.10