Claim Missing Document
Check
Articles

OPTIMASI RUTE PENDISTRIBUSIAN BBM MENGGUNAKAN ALGORITMA TABU SEARCH DAN CHEAPEST INSERTION HEURISTIC Ulfa Is. Abdul; Muh. Rifai Katili; Djihad Wungguli
TRANSFORMASI Vol 7 No 1 (2023): TRANSFORMASI: Jurnal Pendidikan Matematika dan Matematika
Publisher : Pendidikan Matematika FMIPA Universitas PGRI Banyuwangi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36526/tr.v7i1.2325

Abstract

Distribution is an activity carried out on various types of transportation to carry out product marketing to various customers through planning by each company. In distribution, there needs to be systematic planning so as to minimize delays, one of which is the mileage factor. The purpose of this research is to optimize the optimal fuel distribution route at PT. Pertamina (Persero) Gorontalo VII Marketing Unit uses the heuristic method using the Tabu Search and Cheapest Insertion Heuristic algorithms and compares which algorithm is better which can be applied in determining the optimal fuel distribution route. The results showed that the Tabu Search algorithm was better at determining the optimal fuel distribution route with a total distance of 815.2 km, while the Cheapest Insertion Heuristic algorithm produced a total distance of 1039.7 km.
Algoritma Genetika Untuk Penjadwalan Karyawan Ira Stationary Kurniasari Abram; Novianita Achmad; Muhammad Rezky Friesta Payu; Nurwan Nurwan; Djihad Wungguli; Asriadi Asriadi
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 11 Issue 1 June 2023
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v11i1.17364

Abstract

Employee scheduling is an activity plan for time sharing that contains a schedule for carrying out planned activities in the form of a table. This study aims to create an employee schedule model using a Genetic Algorithm, which is a heuristic method inspired by the process of natural selection, the strong will survive and reproduce, the stages of the Genetic Algorithm are population initialization, fitness value, selection, crossover, and mutation. The study results show an optimal model consisting of at most two shifts with a maximum of two holidays a week and not consecutively.
Utilizing the Welch-Powell Algorithm and the IDO (Incident Degree Ordering) Algorithm in Traffic Light Settings Latif, Sintia Abdul; Nurwan; K. Hasan, Isran; Achmad, Novianita; Wungguli, Djihad; Nashar, La Ode
Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam Vol. 21 No. 1 (2024): Sainmatika : Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam
Publisher : Universitas PGRI Palembang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31851/sainmatika.v21i1.9630

Abstract

The road junction needs some help with the timing of traffic lights. One method for optimizing crossroads traffic light settings is using a graph approach that applies a vertex coloring algorithm. The Welch-Powell and IDO (Incident Degree Ordering) algorithms are used to solve this problem. This case study covers two crossroads, namely: the crossroads of Prof. Dr. H.B. Jassin, Jenderal Sudirman Street, and the crossroads of Prof. Dr. H.B. Jassin, Palma, Sarini Abdullah Street. The result showed that the Welch-Powell and IDO algorithms used for vertex coloring produced XG=3 chromatic numbers for Prof. Dr. H.B Jassin, Jenderal Sudirman Street, and XG=4 for Prof. Dr. H.B Jassin, Palma, and Sarini Abdullah Street. New data shows that green-light efficiency increases by 23.85% and red-light efficiency decreases by 19.26% for crossroads of three, and new data at crossroads of four shows that data in the field is more effective than new data.
Analisis Sensitivitas Model Linear Programming dalam Optimalisasi Penjualan Produk di Toko Anggrek Plastik Wakiden, Yuliyani; Wungguli, Djihad; Achmad, Novianita; Abbas, Nurhayati
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 12 Issue 1 June 2024
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/euler.v12i1.21625

Abstract

Optimizing sales at plastic orchid shops is an important matter to maximize profit by optimizing to get profit. The linear programming method is one of the operations research techniques to solve optimization problems using linear equations to find the optimal solution by taking into account the constraints which exists. In addition, a sensitivity analysis was carried out to determine the impact parameter changes in the constraints and objectives function that affect changes in production system performance in an effort to gain profits. Based on the linear programming model, the results of profit optimization are obtained Rp.419428,60 with variable values x4 = 60, x7 = 50, x8 = 26,28571. For the sensitivity analysis of the objective function, the values of DeltaC_1, DeltaC2 and DeltaC3 are obtained, it can be seen that the lower limit = 1167 and the upper limit = 4667.193. and for Analysis The sensitivity of the constrain function obtained by the NRK value has seven no constraints active and three active constraints.
PERBANDINGAN METODE LVQ DAN BACKPROPAGATION UNTUK KLASIFIKASI STATUS GIZI ANAK DI KECAMATAN SANGKUP Alamri, Fahima; Ningsih, Setia; Djakaria, Ismail; Wungguli, Djihad; K. Hasan, Isran
Jurnal Gaussian Vol 12, No 3 (2023): Jurnal Gaussian
Publisher : Department of Statistics, Faculty of Science and Mathematics, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/j.gauss.12.3.314-321

Abstract

The problem of children nutrition isi still a problem in various regions in Indonesia. Poor or poor nutrition of children is influenced by several factors, namely insufficient food intake and infectious diseases. Undernutrition or poor nutrition can be known from the nutritional status assessment obtained from classifying the nutrional status of children. Classification is a part of data mining that is often used to classify data based on certain data or variables. This study aims to compare the classification of the nutritional status of children using data mining with the learning vector quantization (LVQ) and backpropagation methods. Test were carried out using a comparasion ratio of training and testing data, namely 75% and 25%. From the research results, LVQ is superior with an accuracy of 95.12% and backpropagation of 80.49%.
On The Rainbow Connection Of Middle Graph Of Firecracker Graphs (F_(n,4)) Rahim, Delvira Masita; Nurwan, Nurwan; Yahya, Nisky Imansyah; Wungguli, Djihad; Arsal, Armayani
JMEA : Journal of Mathematics Education and Application Vol 4, No 1 (2025): Februari
Publisher : JMEA : Journal of Mathematics Education and Application

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30596/jmea.v4i1.22686

Abstract

Coloring in graph theory includes various approaches, one of which is rainbow coloring which is closely related to the concept of rainbow connected numbers which refers to the least number of colors needed to color the edges in a graph so that every two vertices connected in a rainbow path have the same color and is denoted by rc(G). Rainbow coloring can be studied in several forms of graph development, one of which is the middle graph. All types of graphs, both simple and complex, can be represented as a middle graph. A middle graph is a graph whose vertices are obtained from the vertices and edges of graph G and is denoted by V (M(G)) = V (G)∪(G). Two points in a middle graph are considered adjacent if and only if they are adjacent edges in G or one of the points is adjacent to an edge of G. In this research, we discuss the number rc(G) on the middle graph of firecracker graph (F_(n,4))  with n ≥ 2. Based on the research results, we obtain the rainbow connected number theorem on the middle graph of firecrackers graph rc(M(F_(n,4))) = 3n + 2 for n ≥ 2.
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.