Perancangan Distribusi Hasil Produk Textil dengan Rute Terdekat dengan Algoritma Greedy

Alvin Cahyo Wibowo(1*), Alz Danny Wowor(2),

(1) Universitas Kristen Satya Wacana, Indonesia
(2) Universitas Kristen Satya Wacana, Indonesia
(*) Corresponding Author

Abstract


Delivery is one of the keys to a business because if there is no delivery, the work or flow of a business will be disrupted. The textile industry is one of many industries that really need delivery services with the closest route in order to save time. Greedy algorithm is an algorithm that is heuristic and its logical sequence is arranged based on problem solving steps that are arranged systematically. This study aims to design the distribution of textile products with the closest route using the Greedy Algorithm with a case study of CV. Karya Cahaya Lestari with the benefit of speeding up delivery times and helping drivers to save travel time. The final result of designing the distribution of textile products is in the form of a graph, specifically the Directed Graph, a map like the one in the picture basically only shows interconnected points, with a certain distance at each point..

Full Text:

PDF

References


Sania , N. N., Implementasi Rencana Perjalanan Wisata Di Kota Bogor Menggunakan Algoritma Greedy Berbasis Website. Jurnal Ilmiah Teknologi DAN Rekayasa Volume 24 No. 2 Agustus 2019.

Afandi, M., Aplikasi Android Untuk Pencarian Rute Terdekat Mini Market Mengunakan Metode Floyd-Warshall Berbasis Gis (Studi Kasus DI Kecamatan Taman), Ubiquitous: Computers AND ITS Applications Journal, Vol. 2, No.1, Juni 2019, 51-56.

Purnia, D. S., Pencarian Rute Terpendek Perjalanan Promosi Marketing Menggunakan Algoritma Genetika Dan Algoritma Greedy., Informatika Vol. 3, September 2016: 299 – 313.

Fera, M., Program Dinamis Pada Penentuan Rute Kendaraan Dengan Time Windows., Jurnal Gantang. September 2018; Iii(2): 135 – 141 P-Issn. 2503-0671 E-Issn. 2548-5547.

Supriana, I. W., Pencarian Rute Terbaik Untuk Distribusi Bank Sampah Menggunakan Travelling Salesman Problem (Tsp) Studi Kasus Kota Denpasar., Jurnal Teknologi Informasi DAN Komputer.

Anonim. (N.D.)., Sejarah DAN Proses Produksi Tekstil.Retrieved From Greelane.Com: Https://Www.Greelane.Com/Id/Sastra/Sejarah–Budaya/History-Of-Textile- Production1991659.

Oktaviana ,S ., Algoritma Greedy UNTUK Optimalisasi Ruangan DALAM Penyusunan Jadwal Perkuliahan. Jurusan Teknik Informatika DAN Komputer Politeknik Negeri Jakarta Indonesia.

Juniar ,A ., Penerapan Algoritma Greedy PADA Penjadwalan Produksi Single-Stage DENGAN Parallel Machine DI Industri Konveksi. Jurusan Sistem Informasi, Sekolah Tinggi Manajemen Industri – Kementerian Perindustrian..

Munir, R ., Diklat Kuliah: Strategi Algoritma. Penerbit Itb, Bandung.




DOI: http://dx.doi.org/10.30645/j-sakti.v7i1.592

Refbacks

  • There are currently no refbacks.


J-SAKTI (Jurnal Sains Komputer & Informatika)
Published Papers Indexed/Abstracted By:

Jumlah Kunjungan :

View My Stats