Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)
Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph. Departing from a certain initial city, a salesman had to visit (n-1) another city exactly...
Gardado en:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Department of Informatics, UIN Sunan Gunung Djati Bandung
2018-06-01
|
| Series: | JOIN: Jurnal Online Informatika |
| Assuntos: | |
| Acceso en liña: | http://join.if.uinsgd.ac.id/index.php/join/article/view/218 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|