Article Per Year (5 Year)
p-Index From 2019 - 2024
1.742
P-Index
This Author published in this journals
All Journal Perfecting a Video Game with Game Metrics Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai-Nilai Islami) Jurnal Pendidikan Matematika (Jupitek) Jurnal Kajian Matematika dan Aplikasinya Jurnal Pemantik
Sapti Wahyuningsih
Universitas Negeri Malang
Arts Humanities Computer Science & IT Economics, Econometrics & Finance Education Languange, Linguistic, Communication & Media Mathematics

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

Found 9 Documents
Search

 1 
ANALISA LOCAL SEARCH UNTUK PERBAIKAN SOLUSI VARIAN VRP PADA PERMASALAHAN OPTIMASI Sapti Wahyuningsih
Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai-Nilai Islami) Vol 1 No 1 (2017): Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai Islami )
Publisher : Mathematics Department

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (353.423 KB)

Abstract

Teori graf mempunyai medan aplikasi yang luas khususnya pada permasalahan optimasi. Permasalahan Vehicle Routing Problem (VRP) merupakan kajian dalam teori graf yang dapat diaplikasikan pada permasalahan optimasi. Multi Depot Vehicle Routing Problem (MDVRP), Vehicle Routing Problem with time window (VRPTW) dan gabungannya yaitu MDVRPTW merupakan varian VRP yang akan dianalisa perbaikan solusinya dengan strategi local search. Metode yang digunakan untuk menyelesaikan permasalahan varian VRP ini adalah algoritma self-developed, algoritma interchange descent dan algoritma exchange local search. Strategi penyelesaian varian VRP adalah: tahap inisialisasi, tahap pengembangan dan tahap optimalisasi. Pada tahap pengembangan perbaikan solusi dianalisa dengan local search. Hasil solusi akhir algoritma self developed lebih baik dibandingkan algoritma interchange descent. Algoritma interchange descent melakukan perbaikan inter route dan intra route mengakibatkan proses iterasi yang lama tetapi diperoleh kemungkinan solusi hasil perbaikan lebih banyak jika dibanding exchange local search. Penentuan total waktu tempuh dapat dilihat dari seberapa lama kendaraan melakukan perjalanan. Algoritma self developed menghasilkan total waktu tempuh kendaraan yang minimal dibandingkan dengan algoritma interchange descent. Analisa local search untuk perbaikan solusi MDVRP, VRPTW dan MDVRPTW berguna untuk identifikasi solusi terbaik pada implementasi permasalahan optimasi.
Sequential order vs random order in operators of variable neighborhood descent method Darmawan Satyananda; Sapti Wahyuningsih
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 2: April 2019
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v17i2.11789

Abstract

Many optimization problems require heuristic methods to solve the problem. Variable Neighborhood Search (VNS) is a metaheuristic form that systematically changes its “neighborhood” in search of solutions. One method in VNS is Variable Neighborhood Descent (VND), which performs a deterministic neighborhood change. The change of the neighborhood in VND can be done in a random and sequential order. This paper compares sequential and random neighborhood selection methods in solving Capacitated Vehicle Routing Problem (CVRP) problems. There are 6 intra-route neighborhood structures and 4 inter-route structures used. CVRP problems are taken from several dataset providers. The initial solution is formed by Sequential Insertion method. The experimental results show that the random selection of neighborhood operators can provide a more optimal route length (in 10 of 13 datasets used) than that of sequential selection (only better in 3 dataset). However, the random selection takes more iterations to reach convergent state than the sequential one. For sequential selection, determination of the neighborhood structure’s order affects the speed to the convergent state. Hence, a random selection in VND method is more preferable than sequential selection.
TWO PHASE HEURISTIC ALGORITHM (TPHA) PADA MULTIPLE TRAVELLING SALESMAN PROBLEM (MTSP) DAN IMPLEMENTASI PROGRAMNYA Rahma Try Iriani; Sapti Wahyuningsih; Darmawan Satyananda
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 1, No 1 (2020): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v1i12020p10-17

Abstract

Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) which involves several salesmen in making a trip to visit several customers. In this article, the Two-Phase Heuristic Algorithm (TPHA) is used to solve MTSP problems. The algorithm classifies customers into several regions using the K-Means algorithm, which will then find a route solution for each region using a genetic algorithm. The MTSP problems that were resolved using TPHA were implemented into the Borland Delphi 7.0 programming language. Application testing was conducted using 21, 32, and 46 point cases.
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.
ALGORITMA GENERAL VARIABLE NEIGHBORHOOD SEARCH PADA CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DAN IMPLEMENTASINYA Ulil Ilmi Fadila; Sapti Wahyuningsih; Darmawan Satyananda
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 3, No 1 (2022): January
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v3i12022p1-7

Abstract

The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is one of the variants of the Vehicle Routing Problem (VRP), which is the problem of determining the optimal route from the depot to the consumer which is located spread out with different requests. In CVRPTW problem solving considers capacity and time constraints. Determining the optimal route can reduce costs and energy spent during the distribution process. The General Variable Neighborhood Search (GVNS) algorithm can be applied to the CVRPTW problem. The GVNS algorithm is an improvement on the VNS algorithm using RVND. The GVNS algorithm starts with finding the initial solution, continues with perturbation, and then the repair procedure is carried out. Perturbation and improvements to the GVNS algorithm are performed repeatedly according to the predetermined IterMax. The GVNS algorithm for CVRPTW will be implemented using the Borland Delphi 7.0 programming language. The product in the form of this application can be used more practically to solve CVRPTW problems using the GVNS algorithm.Keywords: Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), General Variable Neighborhood Search (GVNS) Algorithm, Randomized Variable Neighborhood Descent (RVND)
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.
PENGGUNAAN MODEL RASCH UNTUK ANALISIS INSTRUMEN TES PADA MATA KULIAH MATEMATIKA AKTUARIA Azizah Azizah; Sapti Wahyuningsih
Jurnal Pendidikan Matematika (JUPITEK) Vol 3 No 1 (2020): Jurnal Pendidikan Matematika (JUPITEK)
Publisher : Program Studi Pendidikan Matematika FKIP Universitas Pattimura

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (345.292 KB) | DOI: 10.30598/jupitekvol3iss1pp45-50

Abstract

This research was conducted to analyze the test instruments used to measure the ability of students in actuarial mathematics courses in mathematics department, State University of Malang. Participants in this course consist of 40 students. The form of questions given were multiple choice questions totaling 50 items related to the premium calculation material on life insurance. The Rasch model is used to get fit items. This analysis is carried out with the help of Winsteps software. From the Winsteps program output, 25 items were obtained fit to the Rasch model with an average MNSQ Outfit score for person and item 0.98 and 0.98, respectively. While the Outfit ZSTD value for person and item are 0 and -0.01 respectively. While the reliability of the instrument stated in alpha cronbach is 0.85
ALGORITMA GRAVITIONAL EMULATION LOCAL SEARCH PADA CVRP DAN IMPLEMENTASINYA Febri Nur Azis; Sapti Wahyuningsih; Darmawan Satyananda
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 3, No 1 (2022): January
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v3i12022p23-29

Abstract

Permasalahan optimalisasi distribusi dapat dipecahkan dengan menggunakan algoritma pada varian Vehicle Routing Problem (VRP). Salah satu varian dari VRP adalah Capacitated Vehicle Routing Problem (CVRP) yaitu dengan tambahan kendala kapasitas kendaraan yang identik. Algoritma Gravitational Emulation Local Search (GELS) dapat digunakan untuk menentukan solusi CVRP. Algorima GELS merupakan gabungan dari algoritma genetika dan local search (best improvement local search). Pada artikel ini dibahas langkah algoritma dan diimplementasikan ke dalam computer menggunakan aplikasi Borland Delphi 7.  Input program berupa ukuran populasi, probabilitas crossover, probabilitas mutasi, maksimum iterasi, kapasitas kendaraan, banyaknya titik, dan permintaan setiap customer. Output berupa hasil rute dengan jarak yang ditempuh serta divisualisasi rutenya dengan gambar graph. .Diberikan contoh penyelesaian permasalahan dengan contoh 7 titik terdiri dari satu depot dan enam customer. Hasil tampilan program berupa matrik bobot titik, permintaan, dan hasil berupa rute optimal. Aplikasi program GELS pada CVRP secara praktis dapat digunakan untuk penyelesaian optimasi distribusi.
PELATIHAN GURU SEKOLAH DASAR DALAM PENGINTEGRASIAN GAMIFIKASI KE TAHAP-TAHAP PEMBELAJARAN MATEMATIKA Anita Dewi Utami; Puguh Darmawan; Sapti Wahyuningsih; Abd Qohar
Jurnal Pemantik Vol. 2 No. 1 (2023): Januari - Juni
Publisher : Rafandha Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1048.319 KB) | DOI: 10.56587/pemantik.v2i1.43

Abstract

Gamification is one strategy that can be applied to develop students' interest in learning mathematics. The aim of this training is to introduce gamification to elementary school teachers in learning mathematics, to introduce teaching modules (MA) to elementary teachers who have not yet implemented the independent curriculum, and to train teachers to be able to integrate elements of gamification into MA. This training was held at SD N Penanggungan, Malang City. The training was held on November 20, 2022. The training participants were twenty teachers at SD N Penanggungan. The training was carried out using discussion and question and answer techniques. After that, the presenters accompany the teacher to practice the theory learned by making MA integrated with gamification. The result of this training is that teachers can develop MA that is integrated with gamification. In addition, the teacher is also able to recognize the characteristics of gamification and MA stages that are in accordance with the gamification.
Co-Authors Anita Dewi Utami Aprilia Hamida Mashuri Azizah Azizah Darmawan Satyananda Febri Nur Azis Puguh Darmawan Qohar, Abd. Rahma Try Iriani Ulil Ilmi Fadila Yulio Christopher