Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian  Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)

Abrori, Muchammad; Setiyani, Rike Nur

doi:10.14421/fourier.2015.42.93-111

Cited by 7 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Ada banyak metode yang telah diajukan oleh peneliti-peneliti sebelumnya terkait penemuan solusi dari masalah TSP yang sukses diaplikasikan untuk kasus-kasus tertentu. Diantaranya metode heuristik dengan teknik Tetangga Terdekat dan minimum spanning tree (Karkory & Abudalmola, 2013), algoritma Best-First Search (Abrori & Setiyani, 2015), dan sebagainya. Permasalahan dalam penelitian ini juga dikategorikan pada Travelling Salesman Problem.…”

Section: Pendahuluanunclassified

Rute Terpendek Untuk Pengangkutan Sampah Dengan Pendekatan Lintasan Hamilton

Rozi

Multahadah

2021

MTK

View full text Add to dashboard Cite

This research is related to the route of picking up the waste which done by janitors in housing complex of Aur Duri Indah Rt.14 Jambi considering the condition of that housing which have some crossroads, such that janitors take the same road twice which seems inefficient in terms of time and fuel consumption. This research is aimed to identify scientifically about the shortest and more efficient route which should be taken by janitors. This problem is considered as optimization problem through graph modelling. To check the efficient route, the existence of Hamiltonian Path of the graph is identified by using Depth-First Search method, and so is the shortest path. It is found that there are 39 Hamiltonian paths and the shortest path has total distance of 793.8 meter. By the existence of the shortest Hamiltonian Path, it is confirmed that janitors in housing complex of Aur Duri Indah Rt.14 can travel each road once with total distance is about 793.8 meter.

show abstract

Section: Pendahuluanunclassified

Rute Terpendek Untuk Pengangkutan Sampah Dengan Pendekatan Lintasan Hamilton

Rozi

Multahadah

2021

MTK

View full text Add to dashboard Cite

show abstract

“…Metode ini memiliki kelebihan yaitu lebih detail dalam melacak node yang tersebar, sehingga dapat aplikasi bisa dikembangkan untuk membuat tingkatan terhadap pelacakan. [11]Metode heuristik adalah suatu metode pendekatan dalam pencarian untuk menemukan optimasi [12]. Menurut [10] kata heuristic berasal dari bahasa Yunani yang berati mencari atau menemukan.…”

Section: Pendahuluanunclassified

“…Path merupakan komponen dari suatu graf. Graf secara teori artinya kumpulan simpul-simpul yang dihubungkan dengan garis [12].…”

Section: Pendahuluanunclassified

Algoritma Generate and Test Untuk Optimalisasi Masalah Rute Perjalanan

2021

View full text Add to dashboard Cite

The common of urban city problem is a traffic jam, and it is heavily affect the public transportation service quality. Many cities in tropical countries suffer of heavy traffic jam due to the populaition of motorbike. According to Central Java Province Government, in 2014 the population of motorcycle is 439.418 units with the ownership ratio at 0.75 unit/person. Solo is one of typical middle size city in Central Java, Indonesia. Solo suffers from traffic jam in particular time of the day and it affect the quality of service of batik solo as the mass transportation service in Surakarta. This research would like to help the community get the optimal travel route with the fastest time, especially at the busiest times. The method used is Generate and Test algorithm. This method is a combination of Depth First Search and Backtracking. This research is conducted to get information about the influence of traffic volume, service road level and traffic jam level toward the time needed for Batik Solo Trans to find the optimal route. There is a route that been selected to be the most optimal route by considering the factors that influence it and the algorithm applied

show abstract

“…Menurut pendapat [9] menjelaskan bahwa Algoritma Hill Climbing mampu menyelesaikan permasalahan kasus karena motode Algoritma Hill Climbing ini memiliki berbagai macam variasi sehingga mampu memproses part dengan tujuan mendapatkan hasil akhir berupa goal melalui pencarian heuristik Menurut [10], Hasil penelitian yang dikemungkakan Algoritma simple hill climbing mampu menyelesaikan permasalahan yang terjadi dilihat dari jarak terdekat. Tujuan utama pencarian ini adalah memberi petunjuk untuk mempermudah menyelesaikan perhitungan jarul terpendek untuk mengefesiakan tenaga dan waktu [11]. Untuk aplikasi tipikal seperti masalah jalur terpendek, fungsi evaluasi akan akurat karena memperhitungkan jarak atau nilai absolut.…”

Section: Pendahuluanunclassified

Game Edukasi Pembelajaran Menghitung Susunan Angka Pada Puzzle-8 Menggunakan Metode Steepest Ascent Hill Climbing

M¹

2021

bits

View full text Add to dashboard Cite

Learning games are games that are very much in the interest of preschool children today in carrying out activities because basically, this game playing uses the term play while learning, this game is very useful in brain development for preschool children to increase thinking data in sharpening the brain, this game consists of 8 sequences of numbers that are not sequentially arranged into consecutive numbers to become Puzzled -8 guided by the concept of the rules in the algorithm. The problem, in this case, is the children's lack of interest in learning to count and compile numbers because it is difficult to understand. With the learning game, the aim of this research is to help early childhood children in calculating the sequence of numbers that are usually difficult to understand. This game can be used as a game arena but contains elements of learning and compiling puzzle numbers 8. The method used uses the Ascent Hill Climbing Algorithm which is the process of The work of this algorithm that can produce a regular array of numbers by using the concept of shifting the value of numbers according to the existing rules in the Steepest Ascent Hill Climbing Method algorithm.

show abstract

Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)

Cited by 7 publications

References 0 publications

Rute Terpendek Untuk Pengangkutan Sampah Dengan Pendekatan Lintasan Hamilton

Rute Terpendek Untuk Pengangkutan Sampah Dengan Pendekatan Lintasan Hamilton

Algoritma Generate and Test Untuk Optimalisasi Masalah Rute Perjalanan

Game Edukasi Pembelajaran Menghitung Susunan Angka Pada Puzzle-8 Menggunakan Metode Steepest Ascent Hill Climbing

Contact Info

Product

Resources

About