Penyelesaian Capacitated Vechile Routing Problem Dengan Menggunakan Algoritma Sweep Untuk Penentuan Rute Distribusi Koran : Studi Kasus

Saraswati, Rizky; Sutopo, Wahyudi; Hisjam, Muhammad

doi:10.9744/pemasaran.11.2.41-44

Cited by 14 publications

(22 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Penentuan rute distribusi pada umumnya dilakukan dengan mempertimbangkan beberapa hal. Beberapa penelitian terkait pengembangan rute untuk meminimalkan jarak dan meminimalkan biaya antara lain dilakukan oleh [2]-[12] Diantara penelitian-penelitian tersebut yang mencoba menerapkan algoritma Sweep diantaranya adalah (Cahyaningsih et al, 2015;Dondo & Cerdá, 2013;Saraswati et al, 2017).…”

Section: Pendahuluanunclassified

Penerapan Algoritma Sweep Dalam Perencanaan Pendistribusian Produk Roti di Wilayah Kota Yogyakarta

Nugroho

Yatmoko

2021

JRI

View full text Add to dashboard Cite

Tujuan dari penelitian ini adalah untuk membuat solusi baru untuk distribusi produk Sari Roti di CV Jogja Transport. CV Jogja Transport mengantarkan produk roti baru dan mengambil produk-produk yang tidak terjual akan diganti dengan produk-produk baru. CV Jogja Transport memiliki empat karyawan yang melayani sebagai distribusi produk Sari Roti di kota Yogyakarta. Mereka memiliki sistem kerja bergulir dengan jam kerja mulai pukul 06.00 WIB hingga 12.00 WIB. Terbatasnya kapasitas kendaraan dan waktu pengiriman yang disarankan menyebabkan pengiriman tidak sesuai dengan rencana. Dalam tulisan ini, kami menunjukkan aplikasi dari Algoritma Sapu untuk menghasilkan rute distribusi baru. Pertimbangkan aturan distribusi dan sumber daya; Algoritma Sapu mencoba membawa cluster distribusi baru dan tugas penjualan. Solusi ini mengurangi jarak dari gudang CV Jogja Transport ke setiap lokasi toko yang 115,39 Km menjadi 64,3 Km. Solusi ini juga mengurangi waktu pengiriman dari 1143,49 menit menjadi 1032,11 menit. Pengurangan jarak dan biaya juga akan mengurangi 56,48% biaya distribusi dari Rp.56.539 menjadi Rp. 31.717.

show abstract

Section: Pendahuluanunclassified

Penerapan Algoritma Sweep Dalam Perencanaan Pendistribusian Produk Roti di Wilayah Kota Yogyakarta

Nugroho

Yatmoko

2021

JRI

View full text Add to dashboard Cite

show abstract

“…Permintaan total dalam satu cluster mungkin akan melebihi kapasitas kendaraan, karenanya beberapa pangkalan dimasukkan ke cluster berikutnya. Tahap kedua yaitu dengan menentukan urutan rute dari setiap cluster menggunakan Algoritma Nearest Neighbour [6].…”

Section: Algoritma Sweepunclassified

Penyelesaian Multiple Trip Heterogeneous Fix Fleet Vehicle Routing Problem (MTHFFVRP) Menggunakan Algoritma Sweep untuk Mendapatkan Optimasi Rute Distribusi LPG 3 kg di PT. Gending Gemilang

Tjaja

Saiful

2021

jrh

View full text Add to dashboard Cite

ABSTRAKDistibusi merupakan suatu kegiatan menyalurkan produk dari satu tempat ke tempat lainnya. PT. Gending Gemilang merupakan suatu perusahaan yang bergerak dibidang distributor Liquefied Petroleum Gas (LPG) 3 kg, setiap harinya perusahaan diharuskan untuk memenuhi permintaan ke 29 pangkalan yang dimiliki perusahaan. Perusahaan memiliki 2 jenis armada yaitu truk sebanyak 4 unit dan L300 sebanyak 3 unit dengan kapasitas setiap jenis armada berbeda beda dan setiap pangkalan memiliki alamat yang berbeda sehingga permasalahan penentuan rute masuk kedalam Multiple Trips Heterogeneous Fix Fleet Routing Problem (MTHFFVRP). Salah satu penentuan rute yang mampu meminimumkan ongkos pengirimanan adalah dengan menggunakan algoritma sweep, algoritma ini bekerja dengan cara melakukan proses clustering berdasarkan urutan sudut polar setiap pangkalan, pada penelitian ini jenis algoritma sweep yang digunakan adalah backward sweep sehingga untuk pembuatan cluster dimulai dari pangkalan yang memiliki sudut polar terbesar menuju pangkalan yang memliki sudut polar terkecil. Dari hasil penelitian menunjukan pembuatan rute menggunakan algoritma sweep mampu melakukan penghematan secara signifikan terhadap rute perusahaan saat iniKata kunci: Distribusi, Vehicle Routing Problem, Multiple Trips Heterogenous Fix Fleet Routing Problem (MTHFFVRP), Algoritma sweep ABSTRACTDistribution is an activity to distribute products from one place to another. PT. Gending Gemilang is a company engaged in the distribution of 3 kg of liquefied petroleum gas or it can be called (LPG) 3 kg, every day the company is required to fulfill requests from 29 bases owned by the company. The company has 2 types of fleets, namely 4 unit trucks and 3 unit L300 with different capacities for each type of fleet and each base has a different address so that the problem of determining routes enters the Multiple Trips Heterogeneous Fix Fleet Routing Problem (MTHFFVRP). Determination to minimize the shipping cost of the route used is the sweep algorithm, this algorithm works to carry out the clustering process based on the order of the polar angles of each base, in this study the type of sweep algorithm used is backward sweep so that clustering starts from the base with the largest polar angle towards the base that has the smallest polar angle. The research results show that route creation using the sweep algorithm is able to make significant savings on current company routesKeywords: Distribution; Vehicle Routing Problem; Multiple Trips Heterogenous Fix Fleet Routing Problem (MTHFFVRP); Sweep Algorithm

show abstract

“…Data collection method used in this research is observation which is conducted by using data of the research done by Saraswati et al (2017), or it can be considered as secondary data.…”

Section: Data Collectionmentioning

confidence: 99%

“…It means that the news search and compilation process is conducted before the production process is carried out. It is because product delivery is carried out at 03.00 until 08.00 using limited transportation (Saraswati, et al 2017). Therefore, it needs solution for Capacitated Vehicle Routing Problem, which is a problem in determining distribution route to some depots/agents with the start and endpoints of the distribution are the same.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, it needs solution for Capacitated Vehicle Routing Problem, which is a problem in determining distribution route to some depots/agents with the start and endpoints of the distribution are the same. In the previous research discussed by Saraswati et al(2017) stated that the solution which uses sweep algorithm in determining distribution route with results obtained from two routes is in accordance to the cluster with a total time of 5 hours 55 minutes, and it is also in accordance with the time windows policy applied daily by Solopos.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Determining Newspaper Distribution Routes using Cheapest Insertion Heuristic Algorithm with Sweep Clustering: A Case Study

Proceedings of the International Conference on Industrial Engineering and Operations Management

View full text Add to dashboard Cite

PT Aksara Solopos is a newspaper publishing company with daily distribution. One of the problems that often occur in the Newspaper Industry is the delay in the delivery of newspapers to customers. In this study, the solution to the Capacitated Vehicle Routing Problem was solved using the Cheapest Insertion Heuristic algorithm and the sweep algorithm on the daily distribution. The sweep algorithm is a two-stage algorithm, the first stage consists of customer clustering in which the initial clustering is done by connecting the points in one cluster based on the maximum capacity of the vehicle, and the second stage is forming routes for each cluster. The Cheapest Insertion Heuristic Algorithm is an Insertion algorithm in which each additional auxiliary point to be inserted into the subtour has the minimum insertion weight. Data collection uses historical data aka secondary data, does not make direct observations due to the COVID-19 pandemic. The research only focuses on the distribution of newsagents in the Kartasura-Klaten-Sragen area and does not consider the rate of return. The addition of data that assumes the number of agents is 2, geographic coordinate data, namely latitude and longitude from the agent's location using Google Maps, and distance matrix data between agents and PT Aksara Solopos. Based on the distance traveled for each route that has been obtained, the three travel times is less than 5 hours of newspaper delivery. So that it is in accordance with the company's time windows policy.

show abstract

Penyelesaian Capacitated Vechile Routing Problem Dengan Menggunakan Algoritma Sweep Untuk Penentuan Rute Distribusi Koran : Studi Kasus

Cited by 14 publications

References 0 publications

Penerapan Algoritma Sweep Dalam Perencanaan Pendistribusian Produk Roti di Wilayah Kota Yogyakarta

Penerapan Algoritma Sweep Dalam Perencanaan Pendistribusian Produk Roti di Wilayah Kota Yogyakarta

Penyelesaian Multiple Trip Heterogeneous Fix Fleet Vehicle Routing Problem (MTHFFVRP) Menggunakan Algoritma Sweep untuk Mendapatkan Optimasi Rute Distribusi LPG 3 kg di PT. Gending Gemilang

Determining Newspaper Distribution Routes using Cheapest Insertion Heuristic Algorithm with Sweep Clustering: A Case Study

Contact Info

Product

Resources

About