Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Pythagoras: Jurnal Matematika dan Pendidikan Matematika Perfecting a Video Game with Game Metrics UNEJ e-Proceeding Jurnal Gantang
Irwan Endrayanto, Irwan
Department Of Mathematics, Universitas Gadjah Mada
Computer Science & IT Education Mathematics

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

Found 4 Documents
Search

 1 
Program Dinamis Pada Penentuan Rute Kendaraan Dengan Time Windows Fera, Mirta; Endrayanto, Irwan
Jurnal Gantang Vol 3 No 2 (2018): September
Publisher : Program Studi Pendidikan Matematika, Fakultas Keguruan dan Ilmu Pendidikan Universitas Maritim Raja Ali Haji

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (538.95 KB) | DOI: 10.31629/jg.v3i2.511

Abstract

Penentuan rute armada merupakan salah satu permasalahan optimisasi kombinatorik yang memiliki pengaruh pada distribusi barang. Pengiriman barang cepat busuk (perishable good) seperti produk darah, dengan karakteristik jarak tempuh yang pendek memungkinkan untuk dilakukan dengan satu kendaraan. Terdapat kendala time windows pada pelanggan dan depot yang membatasi pengiriman. Masalah penentuan rute dalam penelitian ini dipandang sebagai single vehicle routing problem dengan time windows. Penelitian ini bertujuan untuk mendeskripsikan algoritma yang ditulis berdasarkan program dinamis untuk masalah penentuan rute kendaraan dengan time windows. Pada algoritma diterapkan tes yang bertujuan meningkatkan performa algoritma. Pada bagian akhir diberikan contoh penyelesaian masalah penentuan rute kendaraan dengan time windows menggunakan algoritma. Kata kunci: penentuan rute kendaraan; program dinamis; algoritma eksak Routing problem is kind of combinatoric optimization problem that has an influence on the distribution of goods. Delivery of perishable good such as blood products with short travel characteristics makes it possible to do with one vehicle. There are time-windows constraints on customer and depots that limit delivery. This research aims to describe algorithms written based on dynamic programs for the problem of determining vehicle routes with time windows. In the algorithm applied a test that aims to improve the performance of the algorithm. In the end, given an example of solving the problem of determining a vehicle route with time windows using an algorithm. Keywords: vehicle routing problem; dynamic programming; exact algorithm    
The Analyses on Dynamic and Dedicated Resource Allocation on Xen Server Mardhani Riasetiawan; Ahmad Ashari; Irwan Endrayanto
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Data center today challenges is not only serve the users, in same time need to establish scalable resources. Data Center manage the resources such as processor, storage, network, and memory in appropriate way to handle to load. In the big data era, load will increase and come in rapid way with large volume data, many type of data, can be stream and batch data, and unknown sources. Resources need to manage with comprehensive strategies to face the characteristic of big data load. Data Center have capabilties on allocate the reosource in dynamic and dedicated ways. The research investigate in the performance of dedycated and dynamic resource allocation to define the reliable strategies on Data Center. The research work on XenServer platform as Data Center. The research define 18 Virtual Machiens both on dedicated and dynamic strategies, use the shared storage mechanism, and resource pools. The research analyze on CPU performances on XenServer1 and XenServer2 that design as cluster Data Center.The test has run on XenServer and resulting the 2 phase of process when Data Center allocate the resources, there are intiation phase and process phase. The research shown that in the intiation phase both dynamic and dedicated strategies still not running, and use the initial resources to establish Data Center. The process phase shown that dynamic and dedicated strategies run and generating the load process. In the process phase it shown the use of memory and CPU Performance stream line into the balance positions. The research result can use for allocating resources is need to define different strategies in initition and process phase.
Model masalah penjadwalan transporter pasien dengan pendekatan Dial-A-Ride Problem (DARP) Zahrul Jannah Nur Rochim; Irwan Endrayanto
Pythagoras: Jurnal Matematika dan Pendidikan Matematika Vol 16, No 1: June 2021
Publisher : Department of Mathematics Education, Faculty of Mathematics and Natural Sciences, UNY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21831/pg.v16i1.36648

Abstract

Transportasi intra-hospital merupakan transportasi dalam area suatu rumah sakit, termasuk di dalamnya adalah transportasi pasien. Transportasi pasien dalam area rumah sakit dilakukan oleh transporter pasien yang merupakan staf non-medis rumah sakit. Tugas transporter pasien adalah menjemput dan mengantarkan pasien yang membutuhkan bantuan untuk berpindah lokasi dalam area rumah sakit dikarenakan kondisinya yang tidak dapat berpindah sendiri untuk menjalani perawatan yang telah terjadwal. Penjadwalan transporter pasien harus mempertim­bangkan beberapa hal yang di antaranya tidak boleh terlambat dalam mengantarkan pasien se­suai jadwal perawatan, adanya time windows untuk masing-masing lokasi penjemputan dan pengantaran, masing-masing pasien memiliki batas maksimum untuk berada di perjalanan, ter­batasnya jumlah transporter pasien serta batasan jam kerja transporter pasien. Permasalahan ini akan dimodelkan dengan pendekatan model Dial-A-Ride Problem (DARP). Fungsi tujuan mo­del ini adalah meminimalkan total waktu tempuh transporter pasien dan jumlah transporter pasien yang ditugaskan. Model diterapkan pada  suatu kasus di salah satu  rumah sakit di Jakarta. Berdasarkan hasil penyelesaian diperoleh hasil penjadwalan yang optimum menggunakan pro­gram LINGO 11.0.Model of patient transporter scheduling problem with Dial-A-Ride Problem (DARP) approachIntra-hospital transportation is transportation within the area of a hospital including the patient transportation. Patient transportation within the hospital area is carried out by patient trans­porters who are non-medical staff of the hospital. The task of the patient transporter is to pick up and deliver patients who need help to switch locations within the hospital area due to their con­dition that cannot move on their own to undergo scheduled treatment. Scheduling a patient transporter should consider several things including not being late in delivering patients accor­ding to the treatment schedule, the existence of time windows for each pickup and drop off location, each patient has a maximum limit on the journey, limited number of patients transpor­ters, and limits on patient transporter working hours. This issue will be modeled with Dial-A-Ride Problem (DARP) model approach. The purpose function of this model is to minimize the total travel time of the patient transporter and the number of patient transporters assigned. The model is applied to a case in one of the hospitals in Jakarta, Indonesia. The results showed op­timum scheduling using LINGO 11.0 program.
Quantification Model of Qualitative Geological Data Variables for Exploration Risk Assessment in Prospect Cu-Au Porphyry Deposit Randu Kuning, Wonogiri, Central Java Nurkhamim Nurkhamim; Arifudin Idrus; Agung Harijoko; Irwan Endrayanto; Sapto Putranto
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Almost geological data variable contain some degree of uncertainty. Most decisions in mineral exploration was based on geological reports, measurements, calculations as well as ignorance of the geological uncertainty underlies all natural risks of the exploration effort. Risks affecting mineral exploration activities, among others caused by several things. Inherent natural variability in the process of geology and geological objects. Uncertainty on the conceptual and models, associated with incomplete knowledge and subjective interpretations of processes and geological objects. Errors can also occur when observing, measuring or evaluating samples or mathematical analysis of geological data. Data from exploration activities, can be grouped into two types of data, namely quantitative data (e g; grade) and qualitative data (geological data). Geological data variables still largely a qualitative data, resulting between some geologists are not infrequent errors of judgment (assessment of subjective data). This leads to misinterpretation of results of exploration that will ultimately impact on the exploration risk assessment. Currently, the quantification of qualitative data variable is one parameter which is becoming a necessity, because it will be easier in terms of interpretation, communication and measurable. Porphyry Cu - Au deposit in the Randu Kuning Prospect, Wonogiri has the characteristic geometry and grade distribution are quite complex. It is characterized by the appearance of some kind of vein and stockwork with different characteristics. Quantification of geological variables will result in a value that allows the quantification in quantifying exploration risk. For quantitative variables data (grade) using geostatistical methods, while for qualitative variables geological data using canonical correlation and multivariable regression.
Co-Authors Agung Harijoko Ahmad Ashari Arifudin Idrus Fera, Mirta Mardhani Riasetiawan Nurkhamim Nurkhamim Sapto Putranto Zahrul Jannah Nur Rochim