SISTEM TRACER PAKET PADA UNIT PROCESSING CENTER POS INDONESIA (PERSERO) MENGGUNAKAN METODE TRAVELLING SALES PERSON PROBLEM
| Main Authors: | Abdullah, Dahlan, Hardi, Richki |
|---|---|
| Format: | Article info application/pdf |
| Bahasa: | eng |
| Terbitan: |
Mulawarman University
, 2016
|
| Online Access: |
http://e-journals.unmul.ac.id/index.php/JIM/article/view/110 http://e-journals.unmul.ac.id/index.php/JIM/article/view/110/pdf |
Daftar Isi:
- Traveling salesperson problem-TSP problem is an optimization problem to find the optimal way for the traveling salesman who wants to visit several cities, and returned to the original departure city. TSP is a difficult problem when viewed from the point of computing. Several methods have been used to solve these problems but until now not been found mangkus algorithms to solve them. The easiest way to solve TSP is to try all possible routes and find the optimal route. However, at the time of the very practical now required to complete an algorithm that quickly so that the TSP solution obtained near optimal solutions.