Hariyadi, Hariyadi and Putri, Mutira and Phong, Thanh Nguyen and Iswanto, Iswanto and Dadang, Sudrajad (2020) Traveling Salesman Problem Solution using Genetic Algorithm (Peeriview). Universitas Muhammadiyah Sumatera Barat.
![[img]](http://eprints.umsb.ac.id/style/images/fileicons/text.png) |
Text
Critical Review 1-digabungkan.pdf Download (888kB) |
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
| Item Type: | Other |
|---|---|
| Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering |
| Divisions: | Fakultas Teknik > Teknik Elektro |
| Depositing User: | Unnamed user with email repo@umsb.ac.id |
| Date Deposited: | 04 Feb 2021 04:19 |
| Last Modified: | 10 Feb 2021 07:21 |
| URI: | http://eprints.umsb.ac.id/id/eprint/7 |
Actions (login required)
 |
View Item |
