RT Journal Article
SR Electronic
T1 Traveling Salesman Problem Solution using Genetic Algorithm
JF JCR
JO Journal of Critical Reviews
FD Advanced Scientific Research
SP 56
OP 61
DO 10.22159/jcr.07.01.10
VO 7
IS 1
A1 Hariyadi
A1 Putri Mutira
A1 Phong Thanh Nguyen
A1 Iswanto Iswanto
A1 Dadang Sudrajat
YR 2020
UL http://www.jcreview.com/?mno=302645133
AB 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.