Article Per Year (5 Year)
p-Index From 2020 - 2025
5.194
P-Index
This Author published in this journals
All Journal Jurnal Gaussian JURNAL DERIVAT: JURNAL MATEMATIKA DAN PENDIDIKAN MATEMATIKA Journal of Mathematics Education and Application (JMEA) Jurnal Sains Matematika dan Statistika AKSIOMA BAREKENG: Jurnal Ilmu Matematika dan Terapan Limits: Journal of Mathematics and Its Applications Teorema: Teori dan Riset Matematika Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam Jambura Journal of Mathematics Transformasi : Jurnal Pendidikan Matematika dan Matematika ILKOMNIKA: Journal of Computer Science and Applied Informatics Jambura Journal of Mathematics Education JAMBURA JOURNAL OF PROBABILITY AND STATISTICS Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi Griya Journal of Mathematics Education and Application JES-MAT (Jurnal Edukasi dan Sains Matematika) MATHunesa: Jurnal Ilmiah Matematika Research in the Mathematical and Natural Sciences Milang Journal of Mathematics and Its Applications Jurnal Riset Mahasiswa Matematika Euclid Jurnal Ilmiah Ekonomi dan Manajemen Algoritma: Jurnal Matematika, Ilmu Pengetahuan Alam, Kebumian dan Angkasa Limits: Journal of Mathematics and Its Applications
Djihad Wungguli
Universitas Negeri Gorontalo
Agriculture, Biological Sciences & Forestry Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Energy Engineering Environmental Science Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

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

Found 37 Documents
Search

 1   2   3   4 
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.
Analisis Sensitivitas Model Goal Programming Pada Optimasi Produksi Roti Menggunakan Metode Branch and Bound Rindawati Ahmad; Muhammad Rifai Katili; Sri Lestari Mahmud; Djihad Wungguli; La Ode Nashar
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 11 Issue 2 December 2023
Publisher : Universitas Negeri Gorontalo

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

Abstract

Sya'qila Bakery is a manufacturing industry that produces bread in five flavor variants. The planning carried out by Sya'qila Bakery in the bread production process is considered suboptimal due to the limitation in the quantity of production for each flavor variant, resulting in occasional shortages of raw materials. Additionally, the order production process requires a long total completion time (makespan), resulting in delays in production completion (meaning tardiness). This research aims to optimize the total completion time, the average lateness, the use of raw materials, and production revenue. In this research, the Goal Programming model is utilized with the Branch and Bound method. The analysis results with the Goal Programming model using the Branch and Bound method obtain an optimal solution, which includes an excess of 36 minutes in total completion time (makespan), an excess of 6 minutes in average lateness (mean tardiness), no excess in the availability of raw materials, and zero sales revenue shortfall. Sensitivity analysis results indicate that bread production at Sya'qila Bakery will remain optimal if changes occur in the production completion time, production delay time, and raw material availability, as long as these changes remain within their tolerance limits.
Implementasi Algoritma Random Forest dengan Forward Selection untuk Klasifikasi Indeks Pembangunan Manusia Tiara Posangi; Lailany Yahya; Djihad Wungguli
Jambura Journal of Probability and Statistics Vol 4, No 2 (2023): Jambura Journal Of Probability and Statistics
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjps.v4i2.18460

Abstract

Development is essentially a process of continuous change carried out to achieve better living condition. So that the benchmark for the success of a development is seen in its human development. 3 The basic dimensions that form human development are long and healthy life, knowledge, and a decent life. The indicators that represent the three dimensions are summarized in a single value, namely the Human Development Index (IPM). In 2021 the HDI figure in Indonesia is 72.29, which means it is high. However, due to the diverse geographical location of regions in Indonesia, this also influences the HDI rate in each region in Indonesia, so this study uses the Random Forest Algorithm to obtain accurate results from the HDI classification and uses Forward Selection to determine features that influence the classification. The results of the study show that the features that influence the classification are per capita spending, expected length of schooling, life expectancy, and average length of schooling, and get a final accuracy of 80%.
ANALISIS PERPINDAHAN MEREK DAN STRATEGI PEMASARAN UMKM MENGGUNAKAN METODE RANTAI MARKOV DAN TEORI PERMAINAN Karmila Mokoginta; Salmun K. Nasib; Ismail Djakaria; Djihad Wungguli
MATHunesa: Jurnal Ilmiah Matematika Vol. 12 No. 1 (2024)
Publisher : Universitas Negeri Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26740/mathunesa.v12n1.p57-66

Abstract

Usaha mikro, kecil dan menyengah (UMKM) merupakan kegiatan usaha yang mampu memperluas lapangan kerja dan memberikan pelayanan ekonomi yang luas pada masyarakat. Di provinsi Gorontalo, UMKM berkembang semakin pesat. Banyaknya pilihan UMKM berdampak pada tingkat keinginan konsumen terhadap suatu produk sehingga konsumen berpeluang untuk melakukan perpindahan merek. Dalam mengatasi masalah perpindahan merek, para pelaku UMKM harus memilih strategi pemasaran yang tepat, sehingga dapat mempertahankan dan meningkatkan minat pelanggan. Tujuan penelitian ini adalah untuk menganalisis perpindahan pelanggan dan strategi pemasaran UMKM di Temu Social Space Gorontalo menggunakan metode rantai markov dan teori permainan. UMKM yang dimaksud adalah Drinking Of You (DOY), Mhimhithaitea dan Sruput. Hasil penelitian menunjukkan perpindahan pelanggan dari Drinking Of You (DOY) ke Mhimhithaitea sebesar 0,143, Mhimhithaitea ke Drinking Of You (DOY) sebesar 0,120, Drinking Of You (DOY) ke Sruput sebesar 0,032, Sruput ke Drinking Of You (DOY) sebesar 0,167, Mhimhithaitea ke Sruput sebesar 0,200, Sruput ke Mhimhithaitea sebesar 0,250. Sementara itu, strategi pemasaran optimal Drinking Of You (DOY) adalah promosi dan kualitas rasa. Strategi pemasaran optimal Mhimhithaitea adalah harga, kualitas rasa dan pelayanan. Strategi pemasaran optimal Sruput adalah kualitas rasa dan kemasan.
Sifat Fundamental Pada Granum Eulerian Suaib A Siraj; Asriadi Asriadi; Djihad Wungguli; Hasan S. Panigoro; Nurwan Nurwan; Nisky Imansyah Yahya
Limits: Journal of Mathematics and Its Applications Vol 21, No 2 (2024)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v21i2.20164

Abstract

Mathematical analysis has several important connections with graph theory. Although initially, they may seem like two separate branches of mathematics, there are relationship between them in several aspects, such as graphs as mathematical objects that can be analyzed using concepts from analytic mathematics. In graph theory, one often studies distance, connectivity, and paths within a graph. These can be further analyzed using analytic mathematics, such as in the structure of natural numbers. Literature studies on graph theory, especially Eulerian graphs, are interesting to explore. An Eulerian path in a graph G is a path that includes every edge of graph G exactly once. An Eulerian path is called closed if it starts and ends at the same vertex. The concept of granum theory as a generalization of undirected graphs on number structures provides a rigorous approach to graph theory and demonstrates some fundamental properties of undirected graph generalization. The focus of this study is to introduce the connectivity properties of Eulerian granum. The granum G(e,M) is called connected if for every u,v ∈ M with u ≠ v there exists a path subgranumG^' (e,M^' )⊆ G(e,M)  where u,v ∈ M^' and is called an Eulerian granum if there exists a surjective mapping ϕ∶ [∥E(G(e,M))∥ + 1]→ M such that e(ϕ(n),ϕ(n+1))=1 for every n ∈ [‖E(G(e,M))‖]. This property provides a deeper understanding of the structure and characteristics of Eulerian granum, which have not been fully comprehended until now.
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.
Co-Authors Agusyarif Rezka Nuha Alamri, Fahima Aliwu, Randa Resvitasari Armayani Arsal Asriadi Asriadi B. P. SILALAHI Daud, Sriwati M. Djafar, Fitria Fenly B Mohamad Ghivahri Sidik Mokoagow Harmain, Ismail Saputra R. Hasan S. Panigoro Hasan S. Panigoro Ibrahim, Novita Isa, Jefri N. Ismail Djakaria Isran K Hasan K. Hasan, Isran K. Nasib, Salmun Karina Anselia Mamonto Karmila Mokoginta Kasim, Afrianto Pratama Kintan Sakinah Kaluku Kurniasari Abram La Ode Nashar Lailany Yahya Latif, Sintia Abdul Lindrawati Abdjul Loleh, Linda Purnama Sari Muhammad Rezky F. Payu Muhammad Rifai Katili Ningsih, Setia Nisky I. Yahya NISKY IMANSYAH YAHYA Novianita Achmad Nteseo, Sutriany Nurhayati Abbas Nurwan NURWAN NURWAN Nurwan Nurwan Nurwan, Nurwan Pakaya, Desya Neydi Putri Rahim, Delvira Masita Rahmi, Emli Resmawan Resmawan Rindawati Ahmad S. GURITMAN Safrudin Ismail Salmun K. Nasib Siti Nurmardia Abdussamad Sri Lestari Mahmud Sri Maryam Mohungo Stella Junus Suaib A Siraj Suaib A. Siraj Sutriany Nteseo Tahir, Fauzia D. Taufik, Mohamad Alfiransyah Tiara Posangi Ulfa Is. Abdul Ulfania Liputo Wahab, Nur Dhea Wahdania A.T. Ja’a Wakiden, Yuliyani Wewengkang, Hanz Franklyn Bachruddin Windra Tahir