Siti Maslihah
UIN Walisongo Semarang

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

Penyelesaian Integer Knapsack Problem Menggunakan Algoritma Greedy, Dynamic Programming, Brute Force dan Genetic Muhammad Abdurrahman Rois; Siti Maslihah; Budi Cahyono
Telematika Vol 12, No 2: Agustus (2019)
Publisher : Universitas Amikom Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (89.088 KB) | DOI: 10.35671/telematika.v12i2.841

Abstract

Integer knapsack problem adalah masalah yang ada pada riset operasi di bab program bilangan bulat, dimana bertujuan untuk memaksimalkan total nilai barang ke tempat yang diinginkan dengan memiliki batasan tertentu. Keputusannya ada 2 yaitu 1 (diambil) dan 0 (tidak diambil). Data yang digunakan untuk input merupakan data hasil wawancara dengan J&T Express drop point Ngaliyan, dan penelitian ini terbagi menjadi beberapa penjelasan yaitu (1) Integer knapsack problem, (2) Penyelesaian integer knapsack problem menggunakan algoritma greedy, dynamic programming, brute force, genetic dan implementasi keempat algoritma tersebut pada software MATLAB v2017a berbasis GUI, (3) Membandingkan keempat algoritma dalam hal solusi dan waktu komputasi yang optimal. Hasil penelitian ini menghasilkan kesimpulan bahwa algoritma yang efektif dan efisien digunakan untuk data skala kecil ataupun besar adalah algoritma dynamic programming. Penelitian ini juga dapat memberikan wawasan tentang penyelesaian alternatif untuk memecahkan integer knapsack problem.ABSTRACTInteger knapsack problem is a problem that exists in operating research in integer program chapters, which aims to maximize the total value of goods to the desired place by having certain limitations. The decision is 2, namely 1 (taken) and 0 (not taken). The data used for input is data from interviews with J&T Express drop point Ngaliyan and this research is divided into several explanations, namely (1) Integer knapsack problem, (2) Completion of integer knapsack problems using greedy algorithms, dynamic programming, brute force, genetics and implementation of these four algorithms in GUI based MATLAB v2017a software, (3) Comparing the four algorithms in terms of solutions and optimal computing time. The results of this study conclude that an effective and efficient algorithm used for small or large scale data is a dynamic programming algorithm. This study can also provide insight into alternative solutions to solve integer knapsack problems. 
PROGRAM DINAMIK UNTUK PENDISTRIBUSIAN KOMODITI KERUPUK ‘9 BERLIAN’ WATES Siti Maslihah
At-Taqaddum Volume 10, Nomor 1, Tahun 2018
Publisher : Quality Assurance Institute (LPM) State Islamic University Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/at.v10i1.2541

Abstract

Distribution is one aspect of marketing. Distribution is an activity that bridges between producers and consumers. If the product fails in distribution then the consumer has the opportunity to switch to another similar product. Profits earned by a manufacturer is influenced by several factors, one of which is the distribution. An area may not necessarily generate maximum profits if distribution power is propagated in the region. Profit analysis based on the distribution of distributor power needs to be done appropriately, such an analysis technique is called a dynamic program.The purpose of this study is to determine the number of salespeople from small business '9 Berlian' crackers in Wates, amounting to 9 people distributor / sales. Its operational area is Semarang with details of the Boja-Cups, Ngaliyan-Mangkang, Central Semarang and East Semarang. The result of research based on the average selling of crackers 9 Berlian during the last three months shows the exact distribution that is in the Cangkiran-Boja region as many as 5 sales people, Ngaliyan-Mangkang area as much as none, Central Semarang area as many as 4 sales and East Semarang no . There is a 7.26% difference in the benefit of using a dynamic program of sales placements as usual (2 2 2 3).==================================================Distribusi merupakan salah satu aspek dari pemasaran. Distribusi merupakan kegiatan yang menjembatani antara produsen dengan konsumen. Jika produk tersebut gagal dalam pendistribusian maka konsumen berpeluang untuk beralih ke produk lain yang sejenis. Keuntungan yang didapatkan oleh seorang produsen dipengaruhi oleh beberapa factor, salah satunya adalah pendistribusian. Suatu wilayah belum tentu menghasilkan keuntungan yang maksimum jika tenaga distribusi diperbanyak di wilayah tersebut. Analisis keuntungan berdasarkan pembagian tenaga distributor perlu dilakukan secara tepat, teknik analisis seperti ini disebut program dinamik.Tujuan dari penelitian ini adalah untuk menentukan banyaknya tenaga penjual dari usaha kecil kerupuk ‘9 Berlian’ di Wates yang berjumlah 9 orang distributor/ sales. Wilayah operasinya yaitu Semarang dengan rincian  Cangkiran-Boja, Ngaliyan-Mangkang, Semarang Tengah dan Semarang Timur. Hasil penelitian berdasarkan rata-rata penjualan kerupuk 9 Berlian selama tiga bulan terakhir menunjukkan pendistribusian yang tepat yaitu di wilayah Cangkiran-Boja sebanyak 5 orang sales, wilayah Ngaliyan-Mangkang sebanyak tidak ada, wilayah Semarang Tengah sebanyak 4 orang sales dan wilayah Semarang Timur tidak ada. Terdapat selisih keuntungan sebesar 7.26% lebih baik menggunakan program dinamik dari penempatan sales seperti biasa (2 2 2 3).
Prediksi Jumlah Pengunjung Semarang Zoo dengan Metode Fuzzy Time Series Muhammad Marzuqi; Mohammad Tafrikan; Siti Maslihah
Zeta - Math Journal Vol 7 No 1 (2022): Desember 2021 - Mei 2022
Publisher : Universitas Islam Madura

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31102/zeta.2022.7.1.19-27

Abstract

Forecasting is a very important element in making decisions to deal with uncertain situations. The purpose of this study is to determine the results of forecasting using the fuzzy time series method so that it can be used as a basis for the Semarang Zoo management in planning development. This study uses secondary data from PT Taman Satwa Semarang. Data on the number of visitors to the Semarang Zoo from January 2017 to December 2021. The steps in this research are formulating problems, collecting data, analyzing data, and drawing conclusions. The calculation technique is carried out in two ways, namely manually and using the RStudio application. The result of this research is that the prediction results for January 2022 are 34,640 for manual calculations and 34,430 for calculations using the Rstudio application. While the MAPE test results obtained 14.15% for manual calculations and 15.082% for calculations using the Rstudio application. . Keywords: forecasting, fuzzy time series, number of visitors