Algoritma Optimasi Untuk Penyelesaian Travelling Salesman Problem

Wiyanti, Dian Tri

doi:10.26623/transformatika.v11i1.76

Cited by 8 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…From data that has been obtained based on the Google maps application, data is analyzed using the Greedy Algorithm. The Greedy algorithm is an algorithm that can determine the shortest route between each node to be traversed by continuously taking and adding to the route that has been passed [14]. The Greedy algorithm builds solutions in stages through a sequence that continues to evolve until the solution to the problem is found [15].…”

Section: Experiments Proceduresmentioning

confidence: 99%

Minimization of time distribution of ballots with Greedy algorithms in Jombang Regency

Dewi

Fauzia

2021

J. Nat. Scien. & Math. Res.

View full text Add to dashboard Cite

Travelling Salesman Problem is a problem faced by salesmen in distributing goods by passing all points exactly once. This problem is often encountered in life, not least in the distribution of election ballots from the Komisi Pemilihan Umum Daerah (KPUD) Jombang office to the sub-district office in Jombang Regency. Proper route determination can help to minimize the travelling time between places so that the risk of delaying ballot distribution can be avoided. In determining the solution of Traveling Salesman Problem, a Hamiltonian cycle is required. The Hamiltonian cycle is a closed trail that passes every point exactly one time. The Hamilton cycle can be formed by the Greedy Algorithm. The Greedy Algorithm can quickly determine the next point based on the smallest weight in the form of distance between points. From the problem of ballot distribution in Jombang, the starting point of the route is the office of Komisi Pemilihan Umum Daerah (KPUD) Jombang then through 21 sub-district offices and back to the Komisi Pemilihan Umum Daerah (KPUD) office Jombang. Based on the searching for solutions to minimize the distribution time of ballots in Jombang Regency with Greedy Algorithm, the total distance to pass all existing sub-district offices is 253.1 km with a travel time of 427 minutes or 7 hours 7 minutes.©2021 JNSMR UIN Walisongo. All rights reserved.

show abstract

Section: Experiments Proceduresmentioning

confidence: 99%

Minimization of time distribution of ballots with Greedy algorithms in Jombang Regency

Dewi

Fauzia

2021

J. Nat. Scien. & Math. Res.

View full text Add to dashboard Cite

show abstract

“…Dalam menyelesaikan permasalahan TSP terdapat beberapa algoritma yang digunakan, salah satunya adalah algoritma Greedy. Algoritma Greedy merupakan suatu metode yang digunakan untuk memecahkan permasalahan optimasi dimana setiap langkah akan memilh kota atau tempat yang belum dikunjungi, kota atau tempat yang belum dikunjungi dipilih berdasarkan jarak kota atau tempat mana yang terdekat dari kota atau tempat sebelumnya (Wijayanti, 2013). Berikut adalah cara perhitungan dengan menggunakan algoritma Greedy: 1.…”

Section: Travelling Salesman Problemunclassified

“…Berdasarkan definisi diatas, maka dapat disimpulkan bahwa persyaratan dalam menyelesaikan TSP yaitu (Wijayanti, 2013): 1. Tidak dapat melewati setiap kota lebih ataupun kurang dari satu kali 2.…”

Section: Travelling Salesman Problemunclassified

Implementasi Algoritma Greedy Untuk Menyelesaikan Travelling Salesman Problem di Distributor PT. Z

Usman

Oktiarso

2019

JIS

View full text Add to dashboard Cite

AbstrakDepartemen logistik merupakan departemen yang memegang peran penting dalam perusahaan karena bertugas untuk menyalurkan barang ke konsumen. PT. Z merupakan perusahaan distributor produk -produk obat dan barang kebutuhan sehari-hari menghadapi permasalahan rute distribusi dalam menyalurkan produk obat dan barang kebutuhan sehari hari . Penyelesaian masalah yang dihadapi oleh PT. X adalah menggunakan Travelling S alesman Problem dengan pendekatan algoritma Greedy untuk mendapatkan rute distribusi terpendek.. Hasil dari rancangan rute distribusi baru menghasilkan bahwa rayon Tangerang Kota memiliki total waktu pengiriman 6 jam 44 menit, rayon Bumi Serpong Damai 6 jam 38 menit, rayon Ciledug 5 jam 21 menit, rayon Pamulang, Bintaro, Ciputat 5 jam 01 menit, rayon Curug, Cikupa, Balaraja 5 jam 41 menit, dan rayon Seluruh Rumah Sakit 6 jam 50 menit. Hasil dari perancangan rute baru juga menyebabkan perubahan terhadap biaya distribusi yaitu perubahan pada biaya penggunaan bahan bakar minyak yang lebih kecil dari sebelumnya. AbstractA logistic department is the most important part in a company becau se its service, distributing product to customer. PT. Z is a pharmaceutical and daily product distributor which have distribution routing problem in Tangerang Area. The Travelling Salesman Problem with Greedy Algorithm is used to solve the distribution routing problem. The aim of using Travelling Salesman Problem with Greedy Algorithm is to find the shortest route in distributing goods in Tangerang Area. The result of the research is new distribution route which is shorter than before. The result is the shorten time for each distribution routes which are for Tangerang Kota Area became 6 hours 44 minutes, Bumi Serpong Damai area became 6 hours and 38 minutes, Ciledug area became 5 hours and 21 minutes, Pamulang, Bintaro and Ciputat area became 5 hours and 01 minutes, Curug, Cikupa, Balaraja area became 5 hours and 41 minutes and Hospitals in Tangerang became 6 hours and 50 minutes. The result also reduce distribution cost especially in fuel cost.

show abstract

“…Algoritma CIH dikombinasikan dengan basis data yang digunakan sebagai penyimpanan data proses sehingga pengambilan informasi jarak minimal dari beberapa alternatif yang ada dapat dilakukan dengan mudah yaitu dengan menggunakan query (Lutfi, 2008). Konsep CIH sendiri memiliki algoritma sebagai berikut : (Wiyanti, 2013) 1. Penelusuran, dimulai dari sebuah kota pertama yang dihubungkan dengan kota terakhir.…”

Section: Algoritma Cheapest Insertion Heuristicunclassified

Optimasi Rute Sales Coverage Menggunakan Algoritma Cheapest Insertion Heuristic Dan Layanan Google Maps Api

Yulianto

Setiawan

2018

internal

View full text Add to dashboard Cite

Traveling Salesman Problem (TSP) is one of the distribution issues which is long discussed in the optimization review, where the review problem is how a salesman visits the entire travel route within the coverage area and returns to the starting point of departure with the rule that no destination should be visited more than once. PT. Panjunan is a company engaged in the products distribution of various principles. Currently the managing process of customer location data at the company is still not maximal due to the absence of calculations in every daily visit routes so it impact on the effectiveness of time. In addition, the absence of visualization of real customer data on the field leads to the error distribution and marketing of goods which is uneven, not on target and impact on the decline in sales value. One of the techniques used to accelerate the search solutions of TSP problems is to use an insertion algorithm, or also called the Cheapest Insertion Heuristic (CIH) algorithm. The discussion of this research is to study and apply CIH algorithm in determining the optimization of daily sales traffic route with the aim of this research is to make daily trip route optimization program by applying Cheapest Insertion Heuristics algorithm and provide real customer data visualization on original map in the field as analysis material for operational team and management by utilizing Google Maps API service. System development method used in this research using waterfall model with implementation tools is laravel framework and mySQL as DBMS.

show abstract

Algoritma Optimasi Untuk Penyelesaian Travelling Salesman Problem

Cited by 8 publications

References 0 publications

Minimization of time distribution of ballots with Greedy algorithms in Jombang Regency

Minimization of time distribution of ballots with Greedy algorithms in Jombang Regency

Implementasi Algoritma Greedy Untuk Menyelesaikan Travelling Salesman Problem di Distributor PT. Z

Optimasi Rute Sales Coverage Menggunakan Algoritma Cheapest Insertion Heuristic Dan Layanan Google Maps Api

Contact Info

Product

Resources

About