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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Journal |
| Language: | en |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://ur.aeu.edu.my/566/1/Implementasi%20Algoritma%20Cheapest%20Insertion%20Heuristic%20%28CIH%29%20dalam%20Penyelesaian%20Travelling%20Salesman%20Problem%20%28TSP%29.pdf http://ur.aeu.edu.my/566/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!