cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Vita Kusumasari
Contact Email
jkma.journal@um.ac.id
Phone
-
Journal Mail Official
jkma.journal@um.ac.id
Editorial Address
Department of Mathematics, Universitas Negeri Malang Jln. Semarang 5, Malang Postal Code: 65145 (Gedung O7)
Location
Kota malang,
Jawa timur
INDONESIA
Jurnal Kajian Matematika dan Aplikasinya
Published by Universitas Negeri Malang
ISSN : -     EISSN : 27227650     DOI : -
Core Subject : Education,
Mathematics
The aim of this journal publication is to disseminate research results and new theories that have been achieved in the area of mathematics. Jurnal Kajian Matematika dan Aplikasinya (JKMA) particularly focuses on the main issues in the development of the sciences of mathematics, in the fields of algebra, analysis, applied mathematics, combinatorics, computational sciences, geometry, and statistics.
Arjuna Subject : Matematika - Matematika (Lain-Lain)
Articles 5 Documents
 1 
Search results for , issue "Vol 2, No 2 (2021): July" : 5 Documents clear
ANALISIS DINAMIK MODEL MANGSA PEMANGSA DENGAN FUNGSI RESPON MICHAELIS MENTEN DAN PEMANENAN Kridha Pusawidjayanti
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 2 (2021): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i22021p1-6

Abstract

The Predator-Prey model is an interesting study because it involves an ecosystem of two species that can provide benefits to human life. The purpose of this study was to determine the stability at the equilibrium points of the predator-prey model and the response function of Michaelis Menten and harvesting. This research method is a literature collection method that begins with the construction of the model, finds the equilibrium points, gets stability at the equilibrium points, then confirms the analytical result using numerical simulations. The predator-prey model with harvest assumptions and Michaelis Menten’s response function gets three equilibrium points, namely E_1, E_2, and E_3. E_1 and E_2 are asymptotically stable under certain conditions, while E_3 is unstable.
PEMODELAN KLAIM ASURANSI MENGGUNAKAN PENDEKATAN BAYESIAN DAN MARKOV CHAIN MONTE CARLO Azizah Azizah
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 2 (2021): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i22021p7-13

Abstract

The determination of the correct prediction of claims frequency and claims severity is very important in the insurance business to determine the outstanding claims reserve which should be prepared by an insurance company. One approach which may be used to predict a future value is the Bayesian approach. This approach combines the sample and the prior information The information is used to construct the posterior distribution and to determine the estimate of the parameters. However, in this approach, integrations of functions with high dimensions are often encountered. In this Thesis, a Markov Chain Monte Carlo (MCMC) simulation is used using the Gibbs Sampling algorithm to solve the problem. The MCMC simulation uses ergodic chain property in Markov Chain. In Ergodic Markov Chain, a stationary distribution, which is the target distribution, is obtained. The MCMC simulation is applied in Hierarchical Poisson Model. The OpenBUGS software is used to carry out the tasks. The MCMC simulation in Hierarchical Poisson Model can predict the claims frequency.
PENERAPAN ALGORITMA EXPECTATION-MAXIMIZATION (EM) DALAM MENGELOMPOKKAN POPULARITAS OBJEK WISATA DI MALANG RAYA BERDASARKAN INDIKATOR BANYAK PENGUNJUNG Nur Atikah; Swasono Rahardjo; Trianingsih Eni Lestari; Lucky Tri Oktoviana
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 2 (2021): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i22021p14-20

Abstract

The Malang Raya Area is one of the tourist destinations in East Java..Batu City is an area of Malang Raya which is visited by many for sightseeing. Given the development of tourism in Malang Raya, it is necessary to classify the popularity of tourist objects so that they can be used as a reference in policymaking by the tourism office and tourism object managers. In this study, the Expectation Maximation (EM) algorithm is used to determine the clustering of tourist objects in Malang Raya using data on the number of visitors. The results of grouping the popularity of leading tourist attractions in Malang Raya based on the number of visitors are divided into 5 groups, namely: Group 1: Selecta; Group 2: Balekambang, Wendit Baths, and Brawijaya Souvenir Tour; Group 3: Transport Museum, Coban Rondo, Animal Museum, Jatim Park, BNS, Picking Apples “Makmur Abadi and Agro Wonosari Tea Plantation; Group 4: Kusuma Agro Wisata, Kampoeng Kidz, Cangar Hot Springs, Eco Green Park, Predator Fun Park, Coban Rais Tourism Area, Mount Banyak, Mahajaya T-Shirt & Souvenirs, Ngliyep and Selorejo Dam; Group 5: “Dammadhipa Arama” Temple, “Kaliwatu” Rafting, Batu Rafting, Coban Talun Tourism Wana, Tirta Nirwana Baths, Songgoriti Natural Hot Springs, Wonderland Waterpark, Friends of Water Rafting, Independent Apple Picking, Apple Agro Stone, Tourism Village.
BASIS UNTUK SKEMA ASOSIASI GRUP MATRIKS ATAS Z3 Nur Hamid; Cahyu Guswita; Saiful Islam; M. Faiz Nailun Ni'am
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 2 (2021): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i22021p21-25

Abstract

Some combinatorial problems in Mathematics can be studied via association scheme. By this scheme, algebra structure called Bose-Mesner algebra can be obtained. In this article, we show the explicit forms of the idempotent primitive of an association scheme for the group of order 48. Keywords: Association scheme, idempotent primitif
STUDI ALGORITMA IGVNS, ALGORITMA GVNS, DAN ALGORITMA ABC PADA MULTIPLE TRIP VEHICLE ROUTING PROBLEM (MTVRP) Nurul Faridhatul Aini; Vita Kusumasari; Desi Rahmadani
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 2 (2021): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i22021p26-31

Abstract

The Multiple Trip Vehicle Routing Problem (MTVRP) is one of the VRP variants with vehicle capacity constraints, and the limited number of vehicles allows each vehicle to distribute more than one route so as to minimize the number of vehicles used. The algorithm used in this study is the Improved General Variable Neighborhood Search (IGVNS) algorithm. The IGVNS algorithm is a hybrid between the GVNS algorithm and the VNS algorithm. The calculation results of the IGVNS algorithm will be compared with the GVNS algorithm and the ABC algorithm. The main stages of the IGVNS and GVNS algorithms are initial solution formation, perturbation, and solution improvement. The main stages of the ABC algorithm are initialization, solution improvement and optimization. Based on manual calculations using 8 points, the ABC algorithm produces a distance of 86 km and a service time of 1.47 hours, the GVNS algorithm produces a distance of 80 km and a service time of 1.37 hours, the IGVNS algorithm produces a distance of 79 km and service time is 1.35 hours. Based on one example of the ABC algorithm, the calculation solution using the IGVNS algorithm shows more optimal results. Based on the results of parameter testing, the  parameter affects the calculation results, that is the greater the  value, the more optimal the resulting solution. While the  parameter does not affect the calculation results because it shows constant results in two successive iterations carried out.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue Vol 3, No 2 (2022): July Vol 3, No 1 (2022): January Vol 2, No 2 (2021): July Vol 2, No 1 (2021): January Vol 1, No 1 (2020): July