Article Per Year (5 Year)
p-Index From 2019 - 2024
1.434
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 Karinov Jurnal Sistem Komputer & Kecerdasan Buatan Jurnal Kajian Matematika dan Aplikasinya
Darmawan Satyananda
Universitas Negeri Malang
Arts Humanities Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Mathematics Social Sciences

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

Found 8 Documents
Search

 1 
Google Map API service for VRP Solving Application Satyananda, Darmawan
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 (366.923 KB)

Abstract

Computer program application was widely used to solve VRP (Vehicle Routing Problem) cases. In general, the graph used was mainly to model the problem, instead of depicted actual geographic condition. This modeling was inadequate to give comprehensive information to the users, particulary information related to real distance and real route. Google Map provided geographic data in the form of API (Application Programming Interface) that could be accessed by a computer program. Some of services provided were to display map, to access geographical data, distance of some places in distance matrix form, route from selected source to selected destination, and some more. This article studied developing web-based application for solving VRP using Google Map service. VRP variant implemented in the application is CVRP, and routing strategy used was Sequential Insertion method. Distance among customers was obtained from Google Map service, based on user input on the displayed map, as well as route drawing that used Google Map service. The application provided better visualization to the users, and route produced was more appropriate to the real circumstances. Test showed that length of the route is slightly longer than calculation from CVRP in general, which considered that route between two nodes is symmetrical.
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.
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.
Peningkatan Daya Tarik dan Wawasan Wisatawan dengan Pembangunan Eco-Smart Mini Lab Sebagai Wisata Edukasi Alam Andika Bagus Nur Rahma Putra; Agung Winarno; Agus Purnomo; Muhammad Afnan Habibi; Darmawan Satyananda; Yuli Agustina; Tee Tze Kiong
Jurnal KARINOV Vol 4, No 1 (2021): Januari
Publisher : Institute for Research and Community Service (LP2M), Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um045v4i1p%p

Abstract

Penelusuran ragam potensi unggulan di Indonesia tidak akan pernah terlepas dari keindahan alamnya. Masyarakat perkotaan khususnya era millenial saat ini menggandrungi objek wisata yang berkonsep alam atau biasa dikenal dengan ekowisata. Terutama banyaknya potensi wisata alam yang ada di Kabupaten Malang Jawa Timur. Salah satu yang sudah ada yaitu wisata bumi perkemahan bedengan yang terletak di kecamatan Dau Kabupaten Malang. Sesuai dengan bidang dari sebagian besar tim pelaksana, maka disepakati untuk mengembangkan desain Eco-Smart Mini Lab berbasis solar cell sebagai konsep wisata alam edukasi dalam meningkatkan pengetahuan dan daya tarik wisatawan di area bumi perkemahan Bedengan. Eco-Smart Mini Lab berbasis solar cell merupakan bangunan laboratorium mini berkonsep alam yang di dalamnya berisi pengetahuan dan informasi terkait dengan wisata yang ada di Desa Selorejo seperti wisata Bumi Perkemahan Bedengan. Metode yang digunakan pada kegiatan ini yaitu metode demonstrasi dengan pendekatan diskusi kelompok dan studi kasus. Metode demonstrasi dipilih dikarenakan telah tersedianya alat sarana dan prasarana pendukung untuk melakukan pelatihan. Diskusi kelompok dan studi kasus dipilih untuk menentukan permasalahan (trouble) yang akan diambil pada kegiatan ini. Hasil dari kegiatan pegabdian ini meliputi: 1) kegiatan yang telah dilakukan terdiri dari pembuatan Eco-Smart Mini Lab, sosialisasi, dan pelatihan perawatan; 2) adanya peningkatan pendapatan wisata Bedengan meningkat; 3) terjadi peningkatan tata nilai masyarakat terkait dengan lapangan pekerjaan; dan 4) peningkatan wawasan pengunjung terkait dengan pembudidayaan jeruk di Bedengan. Kata kunci— wisata Bedengan, wisata alam, budidaya jeruk, potensi unggulan daerah AbstractExploring the variety of superior potential in Indonesia will never be separated from its natural beauty. Urban communities, especially the millennial era, currently love tourist objects with a natural concept or commonly known as ecotourism. Especially the large number of natural tourism potentials in Malang Regency. One that already exists is a tour of the bed campground located in Dau sub-district, Malang district. In accordance with the areas of most of the implementing team, it was agreed that a solar cell-based Eco-Smart Mini Lab design would be developed as a concept for educational nature tourism in increasing knowledge and tourist attraction in the Bedengan campground area. Eco-Smart Mini Lab based on solar cell is a mini laboratory building with a natural concept which contains knowledge and information related to tourism in Selorejo village such as Bumi Perkemahan Bedengan. The method used in this activity is the demonstration method with a group discussion approach and case studies. The demonstration method was chosen because of the availability of supporting facilities and infrastructure for conducting training. Group discussions and case studies were selected to determine problems (trouble) to be taken up in this activity. The results of service include: 1) activities that have been carried out consisting of making an Eco-Smart Mini Lab, socialization, and maintenance training; 2) increased tourism revenue for Bedengan increases; 3) there is an increase in community values related to employment; and 4) increasing visitors' insight related to citrus cultivation in Bedengan..Keywords— Bedengan village tourism, nature tourism, citrus cultivation, regional superior potential
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.
Multi-output Regression untuk memprediksi Luas Wilayah, Kualitas Padi dan Produksi Padi pada Pulau Jawa Felix Indra Kurniadi; Darmawan Satyananda; Elly Santika; Pramitha Dwi Larasati
Jurnal SISKOM-KB (Sistem Komputer dan Kecerdasan Buatan) Vol. 5 No. 2 (2022): Volume V - Nomor 2 - Maret 2022
Publisher : Teknik Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47970/siskom-kb.v5i2.269

Abstract

Beras merupakan salah satu makanan pokok di Indonesia. Berdasarkan data dari Badan Pusat Statistik (BPS), konsumsi beras pada tahun 2015 dan 2017 sekitar 29’178.94 -ribu- ton dan 29’133.51-ribu ton. Sayangnya produksi beras pada tahun 2018 hanya mencapati 81.31 juta ton. Pada artikel ilmiah ini, kami membandingkan beberapa metode regresi multi-output seperti Regression Chain, Multi-output linear regression dan Random Forest. Data yang digunakan adalah data beras pada Pulau Jawa terutama Jawa Barat, Jawa Tengah dan Jawa Timur yang diambil dari tahun 2017-2020. Kami menggunakan pendekatan menggunakan outlier removal dan tidak menggunakan outlier removal. Hasil yang didapatkan dari kedua pendekatan ini, ditemukan bahwa outlier removal pada data yang dimiliki sangat diperlukan terutama untuk mengurangi ke-bias an pada hasil tiap metode yang diusulkan.
Co-Authors Agus Purnomo Andika Bagus Nur Rahma Putra, Andika Bagus Nur Rahma Elly Santika Febri Nur Azis Felix Indra Kurniadi Muhammad Afnan Habibi Pramitha Dwi Larasati Rahma Try Iriani Sapti Wahyuningsih Tee Tze Kiong Ulil Ilmi Fadila Yuli Agustina, Yuli Yulio Christopher