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 1 (2021): January" : 5 Documents clear
ESTIMASI MATEMATIS UNTUK JUMLAH PENGIRIMAN PAKET BARANG DI JNE MOJOKERTO DENGAN METODE DOUBLE EXPONENTIAL SMOOTHING Dwi Roudhotillah; Vita Kusumasari; Mochammad Hafiizh; Imam Supeno
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 1 (2021): January
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i12021p19-23

Abstract

The increasing number of package shipments of goods at JNE Mojokerto could highly affect the delays in time delivery. It is strongly necessary to mathematically estimate the number of package shipments of goods for the next month to prepare the resources that are needed by the company. The estimated number of deliveries is calculated by applying the Double Exponential Smoothing method. The monthly data obtained from January 2017 until December 2019 are used in that method, while the 4 months data from January 2020 until April 2020 are used to validated the estimation results. This result shows that the estimation for 4 months from January 2020 until April 2020 are 86421, 87787, 89154, and 90520 respectively. From the validation, the mean absolute percentage error 8%. 
KEUNGGULAN PENERAPAN FUZZY PADA PENYELESAIAN PENJADWALAN PROYEK Sapti Wahyuningsih; Aprilia Hamida Mashuri
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 1 (2021): January
Publisher : UNIVERSITAS NEGERI MALANG

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

Abstract

Project scheduling is an activity to determine the duration of each activity on the project so that the project can be completed in an optimal time. Network flow in the application of graph theory is the theoretical basis used to complete the project schedule. Some methods that can be used to complete scheduling are Gantt, CPM (Critical Path Method), PERT method (Project Evaluation and Review Technique), and fuzzy application. This article will examine the advantages of applying fuzzy after project scheduling. In the PERT and CPM methods, there are forward computation, backward computation, and float or slack calculations, while scheduling using fuzzy calculations is carried out in one step, namely, the calculation starts from the 'start' node. and move to the 'end. In the application of fuzzy, the degree of membership is discussed to model uncertainty so that the value of the probability of reaching the target is represented in the form of a curve so that the tolerance for project completion can be determined if something unplanned occurs, such as changes in weather/rain or other constraints. The final result of the analysis of fuzzy calculations can be obtained as the most likely value, namely the value with the degree of membership equal to 1 to be the solution in the search for the fastest completion time of a project.
PENENTUAN KELAY????AKAN CALON PENERIMA BANTUAN ????RTLH???? MENGGUNAKAN LOGIKA FUZZY MAMDANI DI DESA TANJUNG GLUGUR Moh. Ridwan; Dahliatul Hasanah
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 1 (2021): January
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i12021p1-4

Abstract

One of the strategies to increase the quality of basic facilities of residential districts based on livable house indicators is to repair the targetted houses using the RTLH (Rumah Tidak Layak Huni) grant. The nominees of the grant have been decided by the village officials subjectively by observing from the data of previous grants. The appropriateness of the nominees, however, must be reconsidered firmly in order to have the program done as purposed. The concept of Mamdani fuzzy logic can be used to determine the appropriateness of the candidates. The method used in this research is quantitative research by using secondary data collected by village officials of Tanjung Glugur. This research has one output variable, the appropriateness of the candidates, and four input variables: residential buildings, water needs, sanitation and waste management, and income. The Fuzzy numbers that are used are triangular and shoulder fuzzy sets, while for the defuzzification four methods are used, which are the Smallest of Maximum (SOM), Mean of Maximum (MOM), Bisector, and Centroid. By analyzing the data result, similar results are obtained from all four methods. There are 57 out of 76 candidates who are stated as successful.
ALGORITMA VARIABLE NEIGHBORHOOD DESCENT (VND) PADA VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICKUP (VRPSDP) DAN IMPLEMENTASINYA Yulio Christopher; Sapti Wahyuningsih; Darmawan Satyananda
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 1 (2021): January
Publisher : UNIVERSITAS NEGERI MALANG

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

Abstract

Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Routing Problem (VRP). VRPSDP has special constraints, namely requests and returns are carried out simultaneously. In this article we will use the Variable Neighborhood Descent (VND) algorithm to solve VRPSDP problems. There are two steps taken to use the VND algorithm on VRPSDP, namely finding an initial solution with the Insertion Heuristic algorithm and improving the position of the customer by using the neighborhood operator on the VND algorithm. The implementation of the VND algorithm on VRPSDP has been successfully made using the Borland Delphi 7.0 programming language. Inputs contained in the program are point position, distance between points, customer requests and returns and vehicle capacity. The output contained in the program in the form of routes that have been completed using an algorithm and output in the form of images of the final solution that has been obtained. Based on the results obtained, an example with 6 customers produces 3 routes with a total distance of 266 km, while an example with 10 customers produces 4 routes with a total distance of 100 km.
BEBERAPA KELAS GRAF RAMSEY MINIMAL UNTUK LINTASAN P_3 VERSUS P_5 Desi Rahmadani; Hilda Assiyatun; Mohammad Agung
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 1 (2021): January
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i12021p14-18

Abstract

In 1930, Frank Plumpton Ramsey has introduced Ramsey's theory, in his paper titled On a Problem of Formal Logic. This study became morepopular since Erdős and Szekeres applied Ramsey's theory to graph theory. Suppose given the graph F, G and H. The notation F → (G, H)  states thatfor any red-blue coloring of the edges of F implies F containing a red subgraph of G or a blue subgraph of H. The graph F is said to be the Ramsey graph for graph G versus H (pair G and H) if F → (G, H). Graph F is called Ramsey minimal graph for G versus H if  first, F → (G, H) and second, F satisfies the minimality property i.e. for each e ∈ E (F), then F-e ↛ (G, H). The class of all Ramsey (G, H) minimal graphs is denoted by (G, H). The class (G, H) is called Ramsey infinite or finite if  (G, H) is infinite or finite, respectively. The study about Ramsey minimal graph is still continuously being developed and examined, although in general it is not easy to characterize or determine the graphs included in the (G, H), especially if  (G, H) is an infinite Ramsey class. The characterization of graphs in (, ) has been obtained. However, the characterization of graphs in (, ), for every 3 ≤ m < n is still open. In this article, we will determine some infinite classes of Ramsey minimal graphs  for paths  versus . 

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