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: | Rio Guntur, Utomo, Dian Sa'adillah, Maylawati, Cecep Nurul, Alam |
---|---|
Format: | Journal |
Language: | English |
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!
|
Similar Items
-
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
by: Md Rais, Helmi, et al.
Published: (2007) -
WEB Application for Cheapest Bus Ticket in Malaysia
by: Aldahoun, Jamil Yousef Jamil
Published: (2010) -
Ant colony system with heuristic function for the travelling salesman problem
by: Alobaedy, Mustafa Muwafak, et al.
Published: (2013) -
Bio-ethanol production from sugar cane by product with cheapest strain
by: Kabbashi, Nassereldeen Ahmed, et al.
Published: (2012) -
Study on genetic algorithm and heuristic method for solving traveling salesman problem
by: Sze , San Nah
Published: (2004)