Home|Journals|Articles by Year Follow on Twitter| Subscribe to List

Directory for Medical Articles

Open Access

Review Article

JCR. 2020; 7(1): 56-61

Traveling Salesman Problem Solution using Genetic Algorithm

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

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

Full-text options

Full-text Article

Archives of Clinical and Experimental Surgery (ACES)


BiblioMed Home
Follow ScopeMed on Twitter
Author Tools
eJPort Journal Hosting
About BiblioMed
License Information
Terms & Conditions
Privacy Policy
Contact Us

The articles in Bibliomed are open access articles licensed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (https://creativecommons.org/licenses/by-nc-sa/4.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, provided the work is properly cited.
ScopeMed is a Database Service for Scientific Publications. Copyright ScopeMed Information Services.