OPTIMASI KEUNTUNGAN PRODUK KERIPIK SINGKONG MENGGUNAKAN METODE BRANCH AND BOUND DAN ALGORITMA GENETIKA PADA GNP SNACK

Authors

  • Sarif Hasan Universitas Teknologi Yogyakarta
  • Yohanes Anton Nugroho Universitas Teknologi Yogyakarta

DOI:

https://doi.org/10.12928/si.v18i1.13299

Keywords:

Benefits Optimization, branch and bound, genetical algorithm

Abstract

GNP Snack company has problems in making raw material inventories which are sometimes not enough for 0.5 tons of cassava chips to fulfill demand. This will affect the production process carried out every day. Production needs per day 1 - 1.5 tons of production of cassava chips. The company benefits of GNP Snack are not optimal because it only produces an average profit per month of Rp. 2,000,000 therefore the right formula is needed to overcome this problem using the Branch and Bound Method and the Genetic Algebra Method. The calculation results from the branch and bound method show an increase in profits in December 2018 of Rp. 2,018,992 to Rp. 2,531,467 or a 25% increase, in January 2019 amounting to Rp. 2,247,488 to Rp. 4.247.620 or an increase of 89%, and in February 2019 Rp. 1,290,661 to Rp. 1,299,020 or experiencing a 1% increase and the results of calculations using the genetic algorithm method show an increase in profits in December 2018 of Rp. 2,018,992 to Rp. 2,555,477 or a 27% increase, in January 2019 Rp. 2,247,488 to Rp. 2,655,551 or an increase of 18%, and in February 2019 Rp. 1,290,661 to Rp. 2,810,316 or 118% increase.

References

Alfandianto, Alex., Yohanes A N., Widya S. (2017). Optimasi Penjadwalan Produksi Menggunakan Pendekatan Algoritma Genetika Di Pt Pertani (Persero) Cabang D.I. Yogyakarta. Jurnal DISPROTEK, 8(2).

Anthony, Robert N., & Govindarajan, V. (2014). Management Control System. New York: McGraw Hill.

Basuki, Ahmad. (2003). Algoritma Genetika, Suatu Alternatif Penyelesaian Permasalahan Searching, Optimasi dan Machine Learning. Surabaya: PENTS ITS.

Berlianty, I., & Arifin, M. (2010). Teknik – Teknik Optimasi Heuristik. Yogyakarta: Graha Ilmu.

Fitrianur, K N., Reksan Regasari M P., & Satrio A W. (2018). Optimasi Peningkatan Laba Produksi Abon dengan Menggunakan Algoritma Genetika (Studi Kasus UKM Poklahsar Berkah Lumintu – Tulungagung). Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, 2(5), 1883-1893.

Gen, M., & Cheng, R. (2000). Genetic Algorithms and Engineering Optimization. New York: John Wiley & Sons Inc.

Hoque, M S., Abdul, M., & Abu Naser, B. (2012). An Implementation Of Intrusion Detection System Using Genetic Algorithm. International Journal of Network Security & Its Applications (IJNSA), 4(2).

Kusumadewi, S. (2003). Artificial Intelelligenci (Teknik dan Aplikasinya). Yogyakarta: Graha Ilmu.

Marantika, E., Heru, H.A., Muhammad, N.A., Rizal, F., Robiyana., Ryan, A.A., & Mohammad, A. (2017). Penerapan Metode Branch And Bound (B&B) Dalam Menentukan Keuntungan Maksimum Penjualan Tempe. Seminar Nasional Pendidikan Matematika 2017.

Novianti, L., Eka, S., & Nurul, H. (2017). Sistem Optimalisasi Perencanaan Pemesanan Produk Untuk Meningkatkan Profitabilitas Perusahaan Menggunakan Algoritma Branch And Bound. Jurnal Elletronika Tugas Akhir Mahasiswa.

Paramu, Hadi. (2006). Dasar-dasar Pemograman Linier. Jember: Jember University Press.

Pattawala, A.A. (2013). Analisis dan Usulan Rute Optimum dengan Menggunakan Algoritma Generate and Test di PT. Agronesia Divisi AMDK (Agroplas). Jurnal Integra, 3(1).

Rao, S.S. (2009). Engineering optimization : Theory and practice, fourth ediition. USA: John Wiley & Sons Inc.

Riyani, W.R. (2013). Penentuan Jalur Terpendek pada Pelayanan Agen Travel Khusus Pengantaran Wilayah Semarang Berbasis SIG dengan Algoritma Branch and Bound. Jurnal Masyarakat Informatika.

Sagita, D.A., & Eminugroho, R.S. (2018). Optimasi Produksi Air Mineral Kemasan Menggunakan Pemrograman Nonlinear Dengan Mengaplikasikan Algoritma Branch And Bound Pada Pt. Mitra Tirta Buwana. Jurnal Matematika, 7(2).

Samaher., & Wayan, F.M. (2015). Penerapan Algoritma Genetika Untuk Memaksimalkan Laba Produksi Jilbab. Journal of Environmental Engineering & Sustainable Technology, 2(1), 06-11.

Srinavas, B., & Ganesan. (2015). Method For Solving Branch-And-Bound Technique For Assignment Problems Using Triangular And Trapezoidalfuzzy Numbers. International Journal in Management and Social Science, 03(03), 2321-1784.

Suprayogi, D. A. dan Mahmudy, W. F. (2014). Penerapan Algoritma Genetika Traveling Salesman Problem with Time Window: Studi Kasus Rute Antar Jemput Laundry. Program Teknologi Informasi dan Ilmu Komputer UB.

Winston, W.L. (2000). Operation Research: Applications and Algorithms. Edisi keempat. Canada: Thomson

Downloads

Published

2020-05-01

Issue

Vol. 18 No. 1: April 2020

Section

Operational Research System Modeling

License

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