OPTIMASI BIAYA DISTRIBUSI UMKM SEMPRONG AMOUNDY MENGGUNAKAN TRAVELING SALESMAN PROBLEM

Millati Haniifatunnisa, Syifa Maulia, Maya Widyastiti

Abstract


Production strategy planning needs to be considered for all UMKM in Indonesia. Fierce business competition requires micro business actors to think about developing the right production strategy so that they can generate optimal profits. Planning is not only intended for production profits, but it is also necessary in planning product distribution from the initial location to other locations. Amoundy's semprong cake factory is an UMKM located in the Karawang region that has the opportunity to develop and compete. Optimizing everything related to production must be done, one of which is minimizing the distribution costs of shipping products. By using the Traveling Salesman Problem method, it is found that the route that can be used by the factory to send goods is the Amoundy semprong cake factory - Karawang souvenir outlet - Erik shop - Bontot Delajaya shop - Denpasar shop - Aneka shop - Amoundy semprong factory with a total distance of 13 km with the cost of fuel transportation per liter of Rp. 15,000, so the cost that needs to be incurred by the factory for product distribution is Rp. 195,000.

Keywords


Optimation, Product distribution, Travelling Salesman Problem

References


Kemenkeu.go.id. 2023. Wamenkeu: Potensi Pertumbuhan Ekonomi Indonesia Tahun 2024 Capai 5,2%. https://www.kemenkeu.go.id/informasi-publik/publikasi/berita-utama/Potensi-Pertumbuhan-Ekonomi-Capai-5,2 [diakses 20 Januari 2024]

Sugiri, D. 2020. Menyelamatkan Usaha Mikro, Kecil dan Menengah dari Dampak Pandemi Covid-19. Fokus Bisnis Media Pengkaj. Manaj. dan Akuntan,. 19(1):76 – 86.

Prasetyo, S.B. 2008. AnalisisEfisiensi Distribusi Pemasaran Produk Dengan Metode Data Evelopment Analysis (DEA). J. Penelit Ilmu Tek. 8(2): 120 – 128.

Nofatiyassari, R. Sari, R.P. 2021. Optimasi Jumlah Produksi dan Biaya Distribusi UMKM Semprong Amoundy Menggunakan Metode Simpleks dan Algoritma Greedy. Jurnal Media Teknik & Sistem Industri. 5(1): 9 – 16.

Ong, R. 2019. Maksimalkan Keuntungan Pada Usaha Dagang Martabak Sucipto Menggunakan Metode Simpleks dan POM-QM. J.Ris. Komput. 4(4): 434 – 441

Setyorini, I. 2021. Penentuan Jalur Pengiriman Pesanan Menggunakan Metode Travelling Salesman Problem (TSP) dengan Algoritma Heuristik di KPRI sehat RS Margono Soekaharo Ourwokerto. FUSIOMA (Fundamental Scientific Journal of Mathematics). 1(1): 14 – 18.

Babel, L. 2020. New Heuristic Algorithms for the Dubins Travelling Salesman Problem. Journal of Heuristic, 503-530.

Leksono, A. 2009. Algoritma ant Colony Optimization (ACO) untuk menyelesaikan Travelling Salesman Problem (TSP). Skripsi. Universitas Diponegoro, Semarang.

Sukarmawati, Y. Nahry. Hartono, D.M. 2013. Optimasi rute Pengumpulan Sampah di Kawasan Perumahan Pesona Khayangan dengan Model Penyelesaian Travelling Salesman Problem. Jurnal Transportasi. 13(1): 1 – 8.


Full Text: PDF

DOI: 10.33751/interval.v4i2.11654 Abstract views : 27 views : 10

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.