PENYELESAIAN TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA CHEAPEST INSERTION HEURISTICS DAN BASIS DATA

PENYELESAIAN TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA CHEAPEST INSERTION HEURISTICS DAN BASIS DATA

There are plenty well-known algorithms for solving Travelling Salesman Program (TSP), such as: Linear Programming (LP), Genetic Algorithm (GA), Nearest Neighbourhood Heuristic (NNH) and Cheapest Insertion Heuristic (CIH). This paper will talk about TSP implementation by using CIH algorithm. The writ...

Full description

Bibliographic Details
Main Authors: Kusrini Kusrini, Jazi Eko Istiyanto
Format: Article
Language:English
Published: Petra Christian University 2007-01-01
Series:Jurnal Informatika
Subjects:
TSP
cheapest
insertion
heuristics
database
Online Access:http://puslit2.petra.ac.id/ejournal/index.php/inf/article/view/16775

Internet

http://puslit2.petra.ac.id/ejournal/index.php/inf/article/view/16775

Similar Items