Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Jurnal Informatika

PENYELESAIAN TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA CHEAPEST INSERTION HEURISTICS DAN BASIS DATA Kusrini, Kusrini; Istiyanto, Jazi Eko
Jurnal Informatika Vol 8, No 2 (2007): NOVEMBER 2007
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (90.55 KB) | DOI: 10.9744/informatika.8.2.pp. 109-114

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.
Co-Authors A.A. Ketut Agung Cahyawan W ABADI Abdullah, Robi Wariyanto Afryansih, Nila Agus Harjoko Ahmad Yusuf Ahmad Zarkasih Aidina Ristyawan, Aidina Alva Hendi Muhammad Amborowati, Armadyahah Amir Fatah Andi Sunyoto Aninda Astuti Apriliyani, Aflahah Arief, M Rudyanto Arik Sofan Tohir Sofan Tohir, Arik Sofan Tohir Armadyah Amborowati B. R., Endah Christian Budi Andrianto, Christian Budi Dengen, Christin Nandari Destyanto, Febrian Dion Romodon Dwi Yuli Prasetyo Eldas Puspitarini, Eldas Elok Noor Farida, Elok Noor Emha Taufiq Lutfi, Emha Taufiq Emha Taufiq Luthfi EmhaTaufiq Lutfi, EmhaTaufiq Eri Sasmita Susanto Fatkhurohman, Ari Fauji Maulana Ramlan, Fauji Maulana Ferry Wahyu Wibowo Hanif Al Fatta Hasan, Nur Fitrianingsih Henderi . Ilkham, Sundari Jazi Eko Istiyanto JOKO PRAYITNO Kurniawan, Mei P Kusrini, Mashudi Laka, Beatus Mendelson Lasimin, Lasimin Luthfii, Emha Taufiq M. RUDYANTO ARIEF M. Suyanto, M. marhalim, marhalim MASRIYAH Muqorobin, Muqorobin Musthofa Galih Pradana NINIK TRI HARTANTI Nulngafan, Nulngafan Nurcahyo, Azriel Christian Nurmalasari, Maulidya Dwi Prastowo, Wahit Desta Profesi, Dwinda Etika Retantyo Wardoyo Rizqi Sukma Kharisma Safagi, Ardian Yuligar Samponu, Yohakim Benedictus Sarji, Sarji Setianto, Yuni Ambar Siti Rihastuti Sri Hartati Sudarmawan, Sudarmawan Sugihandono, Agus Suhardi Marli Sukasna, Sukasna Swardiana, I Wayan Pandu Veny Cahya Hardita wati, Vera Wauran, Alfrets Septy Wauran, Alfrets Septy Wicaksono, Kurniawan Winarto, Hendri Wira Dimuksa Yohanes Setyo Prabowo, Yohanes Setyo Yuli Astuti