Claim Missing Document
Check
Articles

Found 24 Documents
Search

PENERAPAN ALGORITMA PENGUINS SEARCH OPTIMIZATION (PeSOA) DAN ALGORITMA MIGRATING BIRDS OPTIMIZATION (MBO) PADA PERMASALAHAN KNAPSACK 0-1 Abdullah, Rinaldy Ahmad; Riski, Abduh; Kamsyakawuni, Ahmad
Majalah Ilmiah Matematika dan Statistika Vol 19 No 2 (2019): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v19i2.17270

Abstract

Every person would want maximum profit with as little as possible resources or capital. One example in everyday life is the problem of limited storage media but is required to get the maximum benefit. From this problem comes the term known as the knapsack problem. One of the problems with Knapsack is knapsack 0- 1, where knapsack 0-1 is a problem of storing goods where the item will be completely inserted or not at all. Completion of knapsack 0-1 problems can be helped using a metaheuristic algorithm. Metaheuristic algorithms include the Penguins Search Optimization (PeSOA) algorithm and the Migration Birds Optimization (MBO) algorithm. This study aims to determine the resolution of knapsack 0-1 problems using the Penguins Search Optimization (PeSOA) algorithm and the Migration Birds Optimization (MBO) algorithm and compare the optimal solutions obtained. This research method is divided into three main parts. First take data that includes the name of the item, the purchase price, the selling price and the weight of each item. The second is applying the Penguins Search Optimization (PeSOA) algorithm and the Migration Birds Optimization algorithm (MBO) on 0-1 knapsack problems. The third program is made to facilitate the calculation of data with the help of Matlab R2015b software. The results of this study found that both algorithms both reached the optimal solution, but the convergence and running time obtained were different. The Migrating Birds Optimization (MBO) algorithm is faster converging than the Penguins Search Optimization (PeSOA) algorithm to get the optimal solution. And also the Migrating Birds Optimization (MBO) algorithm has better running time than the Penguins Search Optimization (PeSOA) algorithm to achieve maximum iteration. Keywords: Whale optimization algorithm, multi knapsack 0-1 problem with multiple constraints.
PERBANDINGAN PLAYFAIR CIPHER DENGAN 3D PLAYFAIR CIPHER PADA PENGAMANAN CITRA Sukmawati, Rika Ayu; Riski, Abduh; Kamsyakawuni, Ahmad
Majalah Ilmiah Matematika dan Statistika Vol 21 No 1 (2021): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v21i1.23116

Abstract

The development of sending messages that are increasingly easy and sophisticated makes it easier for third parties to access or sabotage the contents of the message, so we need a science called cryptography to secure the message. This research is to secure the message on image encoding using Playfair Cipher and 3D Playfair Cipher. The process of encryption and decryption on Playfair Cipher uses two-letter pairs (bigram), while in 3D Playfair Cipher uses three-letter pairs (trigrams). The encryption process uses Playfair Cipher and 3D Playfair Cipher to produce a different image cipher with plain image visually. In the decryption process, the cipher image returns into the plain image using Playfair Cipher and 3D Playfair Cipher. Histogram analysis, NPCR, and UACI are used to see the difference between ordinary images and password images using Playfair Cipher and 3D Playfair Cipher. The average results of histogram analysis that shows safe based on research data are 14061,483 using 3D Playfair Cipher, the average NPCR results that show safe based on research data are 99.2% using Playfair Cipher, and the average UACI results showing safe based on research data is 29.1% using 3D Playfair Cipher. The results of the study indicate that the proposed method can be used to secure the message.
Optimasi Produksi Susu Dengan Algoritma Affine Scaling Pradjaningsih, Agustina; Nuranggraini, Laras Vegi; Riski, Abduh
Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai-Nilai Islami) Vol 4 No 1 (2022): Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai Islami)
Publisher : Mathematics Department

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Optimasi berhubungan erat dengan permasalahan dalam proses memaksimalkan keuntungan atau meminimalkan biaya. Penelitian ini menggunakan Algoritma Affine Scaling untuk memaksimalkan keuntungan. Algortima Affine Scaling dapat digunakan untuk permasalahan program linier yang memiliki variabel dan kendala yang banyak. Variabel keputusan yang digunakan pada penelitian ini adalah jenis produk terdiri dari susu originial, susu tiramisu, susu red velvet, susu coffe caramel, susu durian dan susu vanila late. Fungsi kendala yang digunakan terdiri dari kendala bahan baku, kendala biaya produksi, kendala waktu produksi dan kendala bahan pendukung. Pembentukan model program linier pada penelitian ini menggunakan algoritma Affine Scaling dan selanjutnya dilakukan simulasi program menggunakan software Matrix Laboratory (MATLAB). Penelitian ini menghasilkan bahwa algoritma Affine Scaling dapat diterapkan pada permasalahan kasus maksimasi optimasi Industri Susu Rembangan. Hal tersebut dibuktikan dengan terjadi peningkatan keuntungan Industri Susu Rembangan sebesar Rp 1.186.000.
Application of Fuzzy TOPSIS Method as a Decision Support System for Achievement Student Selection Anggoro, Vani Krismo; Riski, Abduh; Kamsyakawuni, Ahmad
Jurnal ILMU DASAR Vol 24 No 1 (2023)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/jid.v24i1.16792

Abstract

Achievement student selection aims to appreciate students who have achieved an achievement, both in the academic and non-academic fields. This activity is carried out in stages, starting from departments, faculties, and universities, to the national level. In the selection process, several criteria were used: GPA, scientific work, presentation, English, and achievements were featured and involved several juries to avoid subjectivity in the assessment. This study aims to get the best results from the decision support system in Achievement student election in the Mathematics Department of Jember University. Therefore, we need the fuzzy TOPSIS method to avoid and minimize problems and to make multi-criteria decision-making easier. This study's ranking results were obtained from the fuzzy TOPSIS method and standardized assessment method (based on higher education guidelines). From the four candidates who participated in this selection, the two methods give different results in the last two ranks. The fuzzy TOPSIS method ranking shows the results sequentially for candidates B, C, A, and D. In contrast, and the standardized assessment method ranking shows the results sequentially for candidates B, C, D, and A. This difference is caused by the value of the criteria factor and the weight of the candidate criteria, but the fuzzy TOPSIS method is simpler than the standardized assessment method. So that it can be recommended for the next period achievement student election at the department, faculty, or university level.
Implementasi Algoritma Reversed Vigenere Encryption pada Pengamanan Citra Santoso, Ahmad Rico; Riski, Abduh; Kamsyakawuni, Ahmad
BERKALA SAINSTEK Vol 6 No 2 (2018)
Publisher : Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/bst.v6i2.9224

Abstract

Pengamanan data atau informasi penting dilakukan untuk mencegah bocornya suatu pesan atau informasi kepada orang yang tidak berhak menerima. Pengamanan suatu data dapat dilakukan dengan menggunakan suatu teknik penyandian yang dinamakan dengan kriptografi. Pada penelitian ini, data yang digunakan adalah pesan/informasi berupa citra RGB sebanyak 10 buah citra. Pesan atau informasi pada penelitian disandikan menggunakan algoritma Reversed Vigenere Encryption. Tujuan dari penyandian citra RGB ini adalah untuk mengetahui bagaimana langkah-langkah enkripsi dan dekripsi serta hasil keamanan dari penyandian citra terhadap serangan-serangan kriptoanalisis. Adapun metode yang digunakan untuk menganalisis hasil enkripsi adalah anilisis histogram dan analisis diferensial. Hasil dari proses enkripsi dan dekripsi citra dapat dilakukan dengan baik namun masih menghasilkan cipherimage yang membentuk sebagian pola dari citra asli sehingga mudah ditebak oleh seseorang. Pada analisis histogram nilai-nilai pixels dari cipherimage belum menyebar secara merata sehingga hasil dari enkripsi citra masih memiliki ketahanan yang lemah terhadap serangan-serangan kriptoanalisis tipe statistik. Pada analisis diferensial, nilai NPCR menghasilkan nilai 100% yang berarti setiap pixels pada citra asli berubah bentuk secara total. Kata Kunci: Kriptografi, Citra RGB, Reversed Vigenere Encryption.
Snack Production Planning Strategy using Goal Programming Method Umama, Nadya; Pradjaningsih, Agustina; Riski, Abduh
BERKALA SAINSTEK Vol 12 No 1 (2024)
Publisher : Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/bst.v12i1.45345

Abstract

UD Surya Snack Banyuwangi is one of the Banyuwangi snack shops that produces several kinds of snacks such as dry sponge cake, Bagiak, sato, sale, and others. Production at the factory is closely related to meeting market demand. Therefore, factories must carry out production planning so that they can produce products in sufficient quantities to meet market demand. Production planning involves making decisions regarding the number of products produced, resource allocation, and setting up the production process to achieve effectiveness and efficiency in the process. The article based on this research aims to obtain optimization values in production planning to meet market demand using the Goal Programming method. Goal Programming is a method that aims to minimize deviations from all goals by adjusting decision variables to achieve conformity with the specified goals. This research was carried out by direct observation at UD Surya Snack which was in direct contact with the factory owner. The data and information used in this research include production volume, production value, profits, production costs, and labor costs in one month. The data was then modeled using the Goal Programming method to determine decision variables, constraint functions, and objective functions and solved with the help of Excel Solver. The results obtained show that the application of Goal Programming in UD. Surya Snack production planning shows optimal values. The total profit earned was IDR 17.078.000 in one month after deducting production costs and labor costs. The deviation values of all constraints that must be minimized in the objective function have been met.
Perbaikan Citra Inframerah dengan Metode Divide-Conquer dan Metode Histogram Equalization Kaesardi, Dinda Septika; Riski, Abduh; Kamsyakawuni, Ahmad
BERKALA SAINSTEK Vol 6 No 2 (2018)
Publisher : Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/bst.v6i2.9226

Abstract

CCTV (Closed Circuit Television) atau kamera pengawas yang berbasis inframerah banyak dijumpai di tempat-tempat umum seperti persimpangan jalan, perkantoran, pertokoan, dll. Inframerah merupakan suatu radiasi elektromagnetik yang di dalam kamera CCTV berfungsi untuk mengadaptasi gambar dalam keadaan kurang cahaya menjadi terlihat oleh mata dalam mode grayscale. Namun, citra inframerah ini mengalami sedikit derau (noise), kurang tajam, kabur, dsb. Sehingga diperlukan suatu proses perbaikan citra. Penelitian ini akan membahas perbandingan metode Histogram Equalization dan Divide-Conquer, kemudian kedua citra hasil dibandingkan berdasarkan visual dan Liniear Index of Fuzziness. Berdasarkan hasil penelitian, metode Divide-Conquer menghasilkan kualitas citra yang lebih baik secara visual ataupun dengan Linear Index of Fuzziness dibanding dengan Histogram Equalization. Jika dengan dibandingkan dengan citra asli, kedua metode menghasilkan citra yang lebih baik. Namun, hasil citra Histogram Equalization lebih terang sehingga ada beberapa detail citra yang hilang. Kata Kunci: Perbaikan citra, citra inframerah, Histogram Equalization, Divide-Conquer, Linear Index of Fuzziness.
IMPLEMENTASI METODE GOAL PROGRAMMING UNTUK OPTIMASI OLAHAN INDUSTRI KERIPIK PISANG Pradjaningsih, Agustina; Dwidayanti, Frisca Puji; Riski, Abduh
JURNAL REKAYASA SISTEM INDUSTRI Vol 10 No 1 (2024): November 2024
Publisher : Universitas Putera Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33884/jrsi.v10i1.9255

Abstract

The production of chips, especially bananas, is the focus of the AROMA company in Lumajang. This business faces challenges in optimizing the use of raw materials to achieve maximum production. This challenge impacts production costs and profits, so proper production planning is needed. The goal programming method will be applied to handle this optimization problem involving various goals. This method aims to minimize deviations from each goal that has been set. The goal programming process involves identifying decision variables, goal constraints, and goal functions. The decision variables in this study included various flavors of banana chips such as chocolate, strawberry, durian, sweet, salty, chocolate-coated, and lime. Optimization problems are solved with LINDO software. The research results show that the production of banana chips can be optimized by increasing the output of lime-flavored banana chips by 200 packs. The optimization results also show total production costs of IDR 12,585,600 and profits of IDR 8,250,400.  
Penerapan Goal Programming untuk Optimalisasi Penjadwalan Jam Kerja Satuan Pengamanan Pradjaningsih, Agustina; Rohmatul Aulia, Indriyani; Riski, Abduh
Journal of Applied Informatics and Computing Vol. 7 No. 1 (2023): July 2023
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v7i1.5322

Abstract

One common challenge in security system management is the scheduling of security guards' work. Proper work scheduling is essential to prevent physical and psychological fatigue, which can negatively impact their performance. The scheduling process is influenced by factors such as the number of security personnel and the shift arrangements. This study aims to apply the goal programming method to optimize the scheduling of security guards. The research utilizes LINGO 17.0 software for assistance. The research process includes problem identification, data collection, determination of variables and parameters, formulation of goal programming models, solving these models using LINGO 17.0 software, analysis of the results, and the compilation of work schedules for security guards. The study's findings indicate that the established constraints have been met, and the number of working hours and days off for security guards has been optimized, resulting in an efficient schedule.
The Goal Programming Method: Minimizing Expenses and Maximizing Assets for Optimizing the Financial Statements of Bank Syariah Indonesia Pradjaningsih, Agustina; Sukma Lailatul Fadillah; Riski, Abduh
RANGE: Jurnal Pendidikan Matematika Vol. 7 No. 1 (2025): Range Juli 2025
Publisher : Pendidikan Matematika UNIMOR

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32938/jpm.v7i1.9102

Abstract

Every company, including banks, prepares financial reports as a source of information regarding a company's performance and financial position. Economic reports have five essential elements: assets, liabilities, equity, income, and expenses. Each bank has several goals; to achieve the goal, a method is needed that can solve problems with several objectives.  This study aims to apply the Goal Programming (GP) method to solve several financial goals simultaneously and analyze solutions to optimize financial reports at Bank Syariah Indonesia (BSI). Goal Programming is a multi-objective optimization technique that allows decision-makers to balance conflicting goals by prioritizing deviations from predetermined targets. This study uses GP to model BSI's financial constraints and objectives: maximizing assets, minimizing liabilities, maximizing equity, maximizing income, and minimizing expenses. The solution for the GP model is calculated using Lingo software. So far, BSI has never used the Goal Programming Method to optimize financial statements, offering a new analytical framework for the bank's decision-making process.he study results show that Bank BSI's financial reports for 2019 to 2022 have been optimal by implementing the GP method and the assistance of Lingo software. This is indicated by all deviations being successfully minimized and achieving the target. The minimized expenses are IDR 68.012.380 million, and the maximized assets are IDR 1.018.471.648 million.