Claim Missing Document
Check
Articles

Found 37 Documents
Search

PENERAPAN MODEL INTEGER LINEAR PROGRAMMING DALAM OPTIMASI PENJADWALAN PERKULIAHAN SECARA OTOMATIS Wungguli, Djihad; Nurwan, Nurwan
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 14 No 3 (2020): BAREKENG: Jurnal Ilmu Matematika dan Terapan
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1001.471 KB) | DOI: 10.30598/barekengvol14iss3pp411-422

Abstract

Lectures scheduling is a difficult administrative task for universities. This happens because in lectures scheduling must combine the number of courses, approve the room, day and period, as well as teaching lecturers. The purpose of this article is to create an optimization model for courses scheduling using integer linear programming to minimize the level of dissatisfaction between lecturers and students. This model is applied to making a schedule in the Mathematics Study Program at Gorontalo State University. In this research, data and information collected about the scheduling of lectures as a basis for making models. There are 55 study groups scheduled in 4 rooms, 5 days and 12 time periods. Furthermore, the scheduling optimization model is made in the form of integer linear programming and is solved by LINGO 18.0 software. The result obtained from this study is a lecture schedule that is free of conflict. Lectures scheduling produced meets the requirements and requests for lecturers and students in the Mathematics Study Program. In addition, the resulting model can help the time needed to do the scheduling.
Penjadwalan Mata Pelajaran Menggunakan Metode Integer Linear Programming di SMA Negeri 1 Tilango Djafar, Fitria; Katili, Muhammad Rifai; Nasib, Salmun K; Nurwan, Nurwan; Wungguli, Djihad; Arsal, Armayani
Research in the Mathematical and Natural Sciences Vol. 4 No. 1 (2025): November 2024-April 2025
Publisher : Scimadly Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55657/rmns.v4i1.200

Abstract

Penjadwalan mata pelajaran secara optimal sangat penting untuk memastikan kelancaran kegiatan belajar dan mengajar. Di SMA Negeri 1 Tilango, penjadwalan yang dilakukan secara manual oleh pihak kurikulum cenderung memakan waktu yang cukup lama, sehingga sering terjadi bentrok antar mata pelajaran pada waktu yang bersamaan. Proses penjadwalan manual ini cukup sulit karena harus memenuhi semua aturan dan kebijakan sekolah yang berlaku. Untuk mengatasi tantangan tersebut, digunakan metode integer linear programming (ILP) yang dapat membantu menyusun jadwal mata pelajaran secara lebih efisien dan terstruktur. Penelitian ini bertujuan untuk menghasilkan jadwal mata pelajaran yang ideal dengan meminimalkan total bobot pelajaran, hari, dan waktu menggunakan metode ILP. Penyusunan jadwal diselesaikan dengan bantuan software Lingo 18.0. Hasil penelitian menunjukkan bahwa jadwal yang dihasilkan dengan metode ILP lebih optimal dibandingkan dengan penjadwalan manual, karena mampu memenuhi semua batasan dan kendala yang telah ditentukan oleh sekolah..
Pengelompokan Data Stunting di Indonesia Menggunakan Metode X-Means dan Agglomerative Hierarchical Clustering Wahab, Nur Dhea; Nasib, Salmun K.; Nurwan; Wungguli, Djihad; Yahya, Nisky Imansyah
Research in the Mathematical and Natural Sciences Vol. 4 No. 1 (2025): November 2024-April 2025
Publisher : Scimadly Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55657/rmns.v4i1.201

Abstract

Stunting is one of the serious problems that threaten the quality of human resources in Indonesia. This study aims to analyze the patterns and characteristics of stunting in Indonesia by applying the X-Means clustering method and Agglomerative Hierarchical Clustering (AHC). The X-Means method is used to determine the optimal number of clusters automatically by utilizing the Bayesian Information Criterion (BIC), while AHC forms a dendrogram to understand the multilevel structure of the clusters formed. Based on the analysis, the X-Means method produces three optimal clusters with the smallest BIC value of 651.9475, where cluster 1 consists of 17 provinces, cluster 2 includes 12 provinces, and cluster 3 includes 5 provinces. The AHC method with the Single Linkage approach also produced three optimal clusters, with cluster 1 covering 32 provinces, cluster 2 consisting of 1 province (West Nusa Tenggara), and cluster 3 covering 1 province (East Nusa Tenggara), as well as the highest Silhouette Index value of 0.28. The results show that both methods provide a comprehensive picture of stunting patterns in Indonesia, which can be used as a basis for designing more targeted intervention programs according to the characteristics of each cluster. This data-driven strategy is expected to increase policy effectiveness in reducing stunting in Indonesia.
Analysis Analisis Sistem Antrian dengan Model M/M/C dalam Meningkatkan Efektivitas Kinerja Sistem Ibrahim, Novita; K. Nasib, Salmun; Nuha, Agusyarif Rezka; Katili , Muh Rifai; Nurwan Nurwan; Wungguli , Djihad
Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa Vol. 3 No. 2 (2025): Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/algoritma.v3i2.431

Abstract

Study This aim For analyze system queue at the Population and Registration Service Civil ( Disdukcapil) Bone Bolango Regency as well as apply the M/M/C (Multi Channel Single Phase ) queuing model optimizing performance system and upgrade effectiveness service to public . Arrival data visitors and time service collected for 5 days through observation . Analysis results show system applied queue moment This is the model (M/M/4 ): (FIFO/∞/∞) with level arrival visitors Poisson distribution , time service distribute Exponential , 4 counters service , discipline first-come first-served (FCFS) queues , as well source arrival and capacity queue No limited . Size performance the system in existing conditions shows time wait for the average visitor in system amounting to 26.4 minutes and time Wait in queue amounting to 44.4 minutes . For optimizing performance , research recommend application of the model (M/M/7 ) : (FIFO/∞/∞) with add amount counter service into 7 counters . In this model , level utility system (ρ) is below 50 % ie about 41%, which is considered effective Because enter in range level utility low (5%-10%). Application of the queuing model with 7 counters projected can shorten time wait for the average visitor in system to 18.42 minutes and time Wait in queue to 18 minutes . Findings This expected can increase effectiveness service and satisfaction public to service Disdukcapil Bone Bolango Regency.
Analysis of Optimal Portfolio Formation Using Multi-Objective Optimization Method and Nadir Compromise Programming Aliwu, Randa Resvitasari; Rahmi, Emli; Nuha, Agusyarif Rezka; Yahya, Lailany; Wungguli, Djihad; Arsal, Armayani
Jambura Journal of Mathematics Vol 7, No 1: February 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v7i1.29065

Abstract

A portfolio is a collection of financial assets in the stocks owned by a company or individual. An optimal portfolio is a selected portfolio that aligns with the investor's preferences, drawn from a set of efficient portfolios that have been formed. This research aims to create an optimal portfolio using the Multi-Objective Optimization method and the Nadir Compromise Programming (NCP) method. Additionally, Value at Risk (VaR) analysis is applied to determine the maximum risk an investor will bear for the portfolio. The data used consists of closing stock prices on the IDX30 Index from February 2022 to July 2023. The findings indicate that the optimization approach produces portfolios that align with investor risk-return preferences. The comparison of Multi-Objective Optimization and NCP methods provides insights into their effectiveness in portfolio selection. Furthermore, the VaR analysis helps investors understand potential risk levels, offering a comprehensive perspective on portfolio performance.
Analisis Sistem Antrian Model Multiple Channel-Single Phase untuk Mengoptimalkan Efektivitas Pelayanan Teller Bank Ulfania Liputo; Muhammad Rifai Katili; Djihad Wungguli
Griya Journal of Mathematics Education and Application Vol. 5 No. 1 (2025): Maret 2025
Publisher : Pendidikan Matematika FKIP Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/griya.v5i1.531

Abstract

Queues are commonly encountered in various activities or operations, particularly when available services cannot meet the existing demand. This study aims to analyze the queue system for teller services at Bank Syariah Indonesia (BSI) Gorontalo Branch. The research adopts a quantitative approach, applying the queuing method using the Multiple Channel-Single Phase model. Data analysis was conducted using the "POM-QM for Windows" software. The results indicate that with three tellers, the system’s utility factor reaches 73%, indicating that the tellers are operating very busy. A simulation was then conducted by increasing the number of tellers to four, which resulted in a lower utility value of 55% and a service effectiveness of 37%. This system is still considered efficient, ensuring optimal service performance.
Optimization of LightGBM Model with Bayesian Optimization for Malware Detection Kasim, Afrianto Pratama; Nasib, Salmun K.; Hasan, Isran K.; Wungguli, Djihad; Yahya, Nisky Imansyah
ILKOMNIKA Vol 7 No 1 (2025): Volume 7, Number 1, April 2025
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28926/ilkomnika.v7i1.722

Abstract

Cyberattacks through malware on Android devices continue to rise, making accurate detection crucial. This research optimizes the LightGBM model using Bayesian Optimization to enhance accuracy and efficiency in detecting Android malware. A feature selection mechanism based on Attention Mechanism is applied to select the most relevant features for classification. The dataset used comes from the Canadian Institute for Cybersecurity (CIC) and consists of 17,804 Android applications, with a balanced distribution between malware and normal applications. The dataset is split into ratios of 80%:20%, 75%:25%, and 70%:30%. Feature selection reduces the number of features from 9503 to 300, 500, and 1000. The LightGBM model is then optimized with Bayesian Optimization to fine-tune parameters such as learning rate, number of iterations, and maximum number of leaves. The model's performance is evaluated using accuracy, precision, and recall metrics. Experimental results show that the model achieves 96,99% accuracy, 97,30% precision, and 96,70% recall with an 80%:20% dataset split and 1000 features. The combination of Attention Mechanism and Bayesian Optimization effectively improves processing efficiency without compromising performance.
Implementasi Metode Bidirectional LSTM Dengan Word Embedding FastText Dalam Analisis Sentimen Ulasan Pengguna Aplikasi Maxim Wewengkang, Hanz Franklyn Bachruddin; Wungguli, Djihad; Yahya, Nisky Imansyah; Hasan, Isran K.; Abdussamad, Siti Nurmardia
Jurnal Riset Mahasiswa Matematika Vol 4, No 5 (2025): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v4i5.33358

Abstract

Aplikasi transportasi online kini menjadi bagian penting dalam kehidupan masyarakat Indonesia. Maxim, sebagai salah satu penyedia layanan, perlu memahami persepsi pengguna untuk meningkatkan kualitas layanannya. Penelitian ini menerapkan metode Bidirectional Long Short-Term Memory (BiLSTM) untuk melakukan klasifikasi sentimen terhadap ulasan pengguna aplikasi Maxim di Google Play Store. Untuk memperkuat representasi kata, digunakan word embedding FastText yang mampu menangkap informasi sub-kata secara lebih baik. Data penelitian diperoleh melalui scraping menggunakan package google-play-scraper pada Python. Model BiLSTM yang dilatih dengan konfigurasi hyperparameter optimal berhasil mengklasifikasikan sentimen ulasan secara efektif, dengan hasil accuracy 94%, precision 96%, recall 95%, dan f1-score 95%. Hasil ini menunjukkan bahwa kombinasi BiLSTM dan FastText mampu mendeteksi sentimen positif dan negatif secara akurat dan seimbang, serta relevan untuk mendukung evaluasi kualitas layanan berbasis opini pengguna.
Pemanfaatan Pelabelan Harmonis Graf Ular S_n Dalam Kriptografi Polialfabetik Tahir, Fauzia D.; Katili, Muh Rifai; Yahya, Nisky Imansyah; Wungguli, Djihad; Asriadi; Nurwan; Armayani Arsal
Jurnal Derivat: Jurnal Matematika dan Pendidikan Matematika Vol. 12 No. 2 (2025): Jurnal Derivat (Agustus 2025)
Publisher : Pendidikan Matematika Universitas PGRI Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31316/j.derivat.v12i2.7815

Abstract

This research discusses harmonious labeling on the snake graph  and its application in polyalphabetic cryptography. A harmonious labeling is an injective function from the set of vertices to the set of integers modulo , defined as . This function induces an edge labeling function . For each edge connecting vertices  and , the edge label is given by , producing distinct edge labels. This study presents the construction process of harmonious labeling on the snake graph , where  and . The results show that the snake graph satisfies the conditions for being harmoniously labeled since each edge receives a unique label. The vertex set of  is defined as  and the edge set as  The harmonious labeling on this graph is then applied in cryptography, particularly in forming a cipher table used as a key in the polyalphabetic encryption and decryption process. This approach enhances cryptographic security, as a single plaintext letter can be transformed into various ciphertext possibilities, thereby increasing encryption strength and complicating message decryption attempts by unauthorized parties.  Keywords: harmonious labeling, snake graph, cryptography, polyalphabetic cipher
Penerapan Ensemble K-modes Pada Pengelompokkan Kelurahan di Kota Gorontalo Berdasarkan Kecanduan Game Online Remaja Taufik, Mohamad Alfiransyah; Achmad, Novianita; Abdussamad, Siti Nurmardia; Wungguli, Djihad; Yahya, Nisky Imansyah
Griya Journal of Mathematics Education and Application Vol. 5 No. 2 (2025): Juni 2025
Publisher : Pendidikan Matematika FKIP Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/griya.v5i2.633

Abstract

The swift advancement of digital technology has resulted in a heightened frequency of online game usage among teenagers, raising concerns about potential addiction. This study aims to cluster urban villages in Gorontalo City based on the characteristics of online game addiction in adolescents, to support the formulation of more effective preventive policies. The method used is ensemble clustering with K-modes algorithm approach, which is effective for mixed numeric and categorical data. Data were obtained through a survey of adolescents aged 10-24 years in all urban villages, including indicators of lack of attention from close people, self-control, lack of activities, stress or depression, social environment, parenting, length of time playing online games, frequency of playing online games and many favorite online games. The clustering results obtained 3 optimum clusters, where cluster 1 consists of 7 neighborhoods, cluster 2 consists of 17 neighborhoods and cluster 3 consists of 26 neighborhoods. Cluster 1 is a group of neighborhoods with a low risk and addiction level, cluster 2 with a moderate tendency, and cluster 3 with a high tendency.