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

Authors

  • Kusrini Kusrini Staf Pegajar STMIK AMIKOM Yogyakarta
  • Jazi Eko Istiyanto Staf Pengajar Jurusan Fisika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Gadjah Mada

:

https://doi.org/10.9744/informatika.8.2.pp.%20109-114

Keywords:

TSP, cheapest, insertion, heuristics, database

Abstract

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 writer uses Borland Delphi 6 and Interbase 6 as tool for implementing TSP. CIH algorithm has been implemented successfully. By determining count of connected cities and distances between them, the traveled route and total route length to visit all cities in a cities network were obtained. However, this algorithm implementation has not yet be able to solve route searching if there are two cities have different load or there are 2 cities that is not connected. Abstract in Bahasa Indonesia : Ada banyak algoritma untuk memecahkan masalah Travelling Salesman Problem (TSP), diantaranya: Linear Programming (LP), Algoritma Genetik, Nearest Neighbourhood Heuristic (NNH) and Cheapest Insertion Heuristic (CIH). Makalah ini akan membahas tentang implementasi algoritma CIH untuk menyelesaikan TSP. Penulis menggunakan Borland Delphi 6 dan Interbase 6 sebagai tool dalam implementasi TSP. Algoritma CIH telah berhasil diimplementasikan. Dengan mengetahui jumlah kota yang terhubung dan jarak diantaranya, rute perjalanan dan total panjang rute untuk mengunjungi semua kota dalam jaringan dapat diketahui. Namun demikian, implementasi algoritma belum mampu menyelesaikan masalah pencarian rute jika ada 2 kota yang mimiliki bobot yang berbeda dengan melihat arahnya dan jika ada 2 buah kota yang tidak terhubung. Kata kunci: TSP, cheapest, insertion, heuristics, basis data.

Downloads

Published

2008-08-15

How to Cite

Kusrini, K., & Istiyanto, J. E. (2008). PENYELESAIAN TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA CHEAPEST INSERTION HEURISTICS DAN BASIS DATA. Jurnal Informatika, 8(2), pp. 109-114. https://doi.org/10.9744/informatika.8.2.pp. 109-114

Issue

Vol. 8 No. 2 (2007): NOVEMBER 2007

Section

Articles

License

Authors who publish with this journal agree to the following terms:


  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).