Article Per Year (5 Year)
p-Index From 2021 - 2026
6.806
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering IAES International Journal of Artificial Intelligence (IJ-AI) IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Jurnal Ilmu Komputer MATICS : Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology) TELKOMNIKA (Telecommunication Computing Electronics and Control) Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Jurnal Ilmiah Kursor Journal of Innovation and Applied Technology International Journal of Local Economic Governance Journal of Environmental Engineering and Sustainable Technology Jurnal Pembangunan dan Alam Lestari Jurnal Teknologi Informasi dan Ilmu Komputer The International Journal of Accounting and Business Society Jurnal Edukasi dan Penelitian Informatika (JEPIN) International Journal of Advances in Intelligent Informatics Scientific Journal of Informatics Journal of Information Systems Engineering and Business Intelligence KLIK (Kumpulan jurnaL Ilmu Komputer) (e-Journal) JOIV : International Journal on Informatics Visualization Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Journal of Information Technology and Computer Science Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Knowledge Engineering and Data Science Jambura Law Review Advances in Food Science, Sustainable Agriculture and Agroindustrial Engineering (AFSSAAE) Indonesian Journal of Electrical Engineering and Computer Science International Journal of Engineering, Science and Information Technology Indexia Prosiding Seminar Nasional Teknik Elektro, Sistem Informasi, dan Teknik Informatika (SNESTIK) Bulletin of Culinary Art and Hospitality Bulletin of Social Informatics Theory and Application Jurnal ilmiah teknologi informasi Asia Signal and Image Processing Letters Jurnal Pengabdian Masyarakat Teknologi Informasi dan Informatika
Wayan Firdaus Mahmudy
Brawijaya University
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Social Sciences Transportation

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

Found 163 Documents
Search

 3   4   5   6   7 
AN IMPROVED SIMULATED ANNEALING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) Farhanna Mari; Wayan Firdaus Mahmudy; Purnomo Budi Santoso
Jurnal Ilmiah Kursor Vol 9 No 3 (2018)
Publisher : Universitas Trunojoyo Madura

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28961/kursor.v9i3.178

Abstract

In the industrial sector, in order to increase the company's competitive profit and ratio, must be able to suppress as much expenditure as possible. Product distribution is one of the logistics processes in the industry which consumes the most costs. Products must be distributed to customers in different locations and also with varying requests. The problem belongs to Capacitated Vehicle Routing Problem (CVRP) that is considered as one of the complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that requires difficult computation and a lot of time along with the increasing size of the problem data. So, in this study improvisation will be carried out in the form of modifying the simulated annealing method to solve the combinatorial problem so that the optimal distance in the case of distribution will be obtained. In addition, in this study a comparison will be made between basic simulated annealing and also improved simulated annealing. Based on the results of the research it is proven that Improved Simulated Annealing can provide a better solution.
PRE-PROCESSED LATENT SEMANTIC ANALYSIS FOR AUTOMATIC ESSAY GRADING Ruth Ema Febrita; Wayan Firdaus Mahmudy
Jurnal Ilmiah Kursor Vol 8 No 4 (2016)
Publisher : Universitas Trunojoyo Madura

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28961/kursor.v8i4.110

Abstract

In education, essay is considered as the best tool to evaluate student’s high order thinking and understanding. In the other hand, manual processing and grading essay answers by a teacher need much time and tending to subjectivity grading. Meanwhile automatic essay grading in e-learning system find the difficulties in comparing model or key answer to student’s answer because student’s can answer the question with so various way. That means a right answer also can be so various, for they have same semantic meaning. This paper proposed automatic essay grading using Latent Semantic Analysis. But before the texts being scored, they will be pre-processed using stop words removal and synonyms checking. Calibration process implemented for dealing with the various possible right answer and help to simplify the term matrix. Implementation of this approach using Java Programming Language and WordNet as lexical database for searching the synonyms of every given words. The accuracy obtained by this method is 54.9289%.
IMPROVED SIMULATED ANNEALING FOR OPTIMIZATION OF VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) Wayan Firdaus Mahmudy
Jurnal Ilmiah Kursor Vol 7 No 3 (2014)
Publisher : Universitas Trunojoyo Madura

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

Abstract

IMPROVED SIMULATED ANNEALING FOR OPTIMIZATION OF VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) Wayan Firdaus Mahmudy Department of Computer Science, University of Brawijaya (UB) Email: wayanfm@ub.ac.id Abstrak Vehicle routing proble with time windows (VRPTW) merupakan permasalahan optimasi kombinatorial yang banyak ditemui pada sistem distribusi permasalahan ini berkaitan dengan pengalokasian sejumlah kendaraan umum untuk melayani sejumlah konsumen, sejumlah konsumen mempunyai rentang waktu kesediaan yang berbeda dan harus dilayani dalam waktu tersebut. Paper ini memaparkan penggunaan metode simulated annealing yang diperkaya dengan beberapa fungsi khusus untuk menghasilkan solusi tetangga yang digunakan pada penelusuran are pencarian solusi dari VRPTW. Serangkaian percobaan menunjukkan bahwa simulated annealing yang diperkaya dengan fungsi-fungsi khusus dapat menghasilkan solusi yang baik dalam waktu rata-rata 82.29 detik. Kata kunci: Vehicle Routing Problem with Time Windows (VRPTW), Permasalahan optimasi kombinatoria, Simulated annealing, solusi tetangga. Abstract The Vehicle Routing Problem with Time Windows (VRPTW) is a combinatorial optimization problem that exists in various distribution systems. The problem deals with allocation of vehicles to service several customers, each customer has different available time, and the vehicles must visit the customers in their available time.This paper addresses the VRPTW by using an improved simulated annealing algorithm. Special functions to effectively exploring neighborhood solutions are developed. The functions are required to deal with the large search space of the VRPTW and enhance the power of the simulated annealing to obtain better solutions. The proposed approach is evaluated in comparison with well-known benchmark problems available in the literature. A set of computational experiments prove that the improved simulated annealing could produce promising results in the average of computational time of 82.29 seconds. Keywords: Vehicle Routing Problem with Time Windows (VRPTW), combinatorial optimization problem, simulated annealing, neighborhood solution
OPTIMASI MULTI TRAVELLING SALESMAN PROBLEM (M-TSP) UNTUK DISTRIBUSI PRODUK PADA HOME INDUSTRI TEKSTIL DENGAN ALGORITMA GENETIKA Agung Mustika Rizki; Wayan Firdaus Mahmudy; Gusti Eka Yuliastuti
KLIK- KUMPULAN JURNAL ILMU KOMPUTER Vol 4, No 2 (2017)
Publisher : Lambung Mangkurat University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20527/klik.v4i2.86

Abstract

In the field of textile industry, the distribution process is an important factor that can affect the cost of production. For that we need optimization on the distribution process to be more efficient. This problem is a model in the Multi Travelling Salesman Problem (M-TSP). Much research has been done to complete the M-TSP model. Among several methods that have been applied by other researchers, genetic algorithms are a workable method for solving this model problem. In this article the authors chose the genetic algorithm is expected to produce an optimal value with an efficient time. Based on the results of testing and analysis, obtained the optimal population amount of 120. For the optimal generation amount is 800. The test results related to the number of population and the number of generations are used as input to test the combination of CR and MR, obtained the optimal combination of CR = 0 , 4 and MR = 0.6 with a fitness value of 2.9964.Keywords: Textile Industry, Multi Travelling Salesman Problem (M-TSP), Genetic AlgorithmPada bidang industri tekstil, proses distribusi merupakan satu faktor penting yang dapat berpengaruh terhadap biaya produksi. Untuk itu diperlukan optimasi pada proses distribusi agar menjadi lebih efisien. Masalah seperti ini merupakam model dalam Multi Travelling Salesman Problem (M-TSP). Banyak penelitian telah dilakukan untuk menyelesaikan model M-TSP. Diantara beberapa metode yang telah diterapkan oleh peneiti lain, algoritma genetika adalah metode yang bisa diterapkan untuk penyelesaian permasalahan model ini. Dalam artikel ini penulis memilih algoritma genetika diharapkan dapat menghasilkan nilai yang optimal dengan waktu yang efisien. Berdasarkan hasil pengujian dan analisis, didapatkan jumlah populasi yang optimal sebesar 120. Untuk jumlah generasi yang optimal adalah sebesar 800. Hasil pengujian terkait jumlah populasi dan jumlah generasi tersebut dijadikan masukan untuk melakukan pengujian kombinasi  CR dan MR, didapatkan kombinasi yang optimal yakni CR=0,4 dan MR=0,6 dengan nilai fitness sebesar 2,9964.Kata kunci: Industri Tekstil, Distribusi, Multi Travelling Salesman Problem (M-TSP), Algoritma Genetika
Optimization of Dempster-Shafer’s Believe Value Using Genetic Algorithm for Identification of Plant Diseases Jatropha Curcas Triando Hamonangan Saragih; Wayan Firdaus Mahmudy; Yusuf Priyo Anggodo
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: October 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i1.pp61-68

Abstract

Jatropha curcas is a plant that can be used as a substitute for diesel fuel. Lack of knowledge of farmers and the limited number of experts and extension agents into the problem of dealing with the disease Jatropha curcas plant which resulted in lower quality of Jatropha curcas. Dempster-Shafer method can be a solution for decision making based on previous research. The difference in beliefs of every expert in seeing Jatropha diseases are important because Dempster-Shafer can not solve this problem. Optimization using genetic algorithms can solve this problem. Optimization of belief values using genetic algorithms can improve the accuracy of the results of this system are using Dempster-Shafer. On the results of this system provides the highest system accuracy value, opimization of belief values using genetic algorithms gives a more significant result than the use of Dempster-Shafer only.
Jatropha Curcas Disease Identification With Extreme Learning Machine Triando Hamonangan Saragih; Diny Melsye Nurul Fajri; Wayan Firdaus Mahmudy; Abdul Latief Abadi; Yusuf Priyo Anggodo
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: November 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i2.pp883-888

Abstract

Jatropha is a plant that has many functions, but this plant can be attacked by various diseases. Expert systems can be applied in identifying so that can help both farmers and extension workers to identify the disease. one of method that can be used is Extreme Learning Machine. Extreme Learning Machine is a method of learning in Neural Network which has a one-time iteration concept in each process. In this study get a maximum accuracy of 66.67% with an average accuracy of 60.61%. This proves the identification using Extreme Learning Machine is better than the comparison method that has been done before.
K-Means Clustering and Genetic Algorithm to Solve Vehicle Routing Problem with Time Windows Problem Adyan Nur Alfiyatin; Wayan Firdaus Mahmudy; Yusuf Priyo Anggodo
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: August 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v11.i2.pp462-468

Abstract

Distribution is an important aspect of industrial activity to serve customers on time with minimal operational cost. Therefore, it is necessary to design a quick and accurate distribution route. One of them can be design travel distribution route using the k-means method and genetic algorithms. This research will combine k-means method and genetic algorithm to solve VRPTW problem. K-means can do clustering properly and genetic algorithms can optimize the route. The proposed genetic algorithm employs initialize chromosome from the result of k-means and using replacement method of selection. Based on the comparison between genetic algorithm and hybrid k-means genetic algorithm proves that k-means genetic algorithm is a suitable combination method with relative low computation time, are the comparison between 2700 and 3900 seconds.
Optimization of Food Composition for Hypertensive Patient using Variable Neighborhood Search Aprilia Nur Fauziyah; Wayan Firdaus Mahmudy
Indonesian Journal of Electrical Engineering and Computer Science Vol 8, No 2: November 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v8.i2.pp327-334

Abstract

Hypertension is a major symptom that cause other diseases appear such as non-communicable diseases, cancer, and diabetes if the nutrients on hypertensive patients not controlled from the actual nutrition need. One of healthy life effort for the patients is consuming healthy food that considers level of salt in the foods. The problem to determine the food composition that considers level of salt and minimum cost of the food is solved using Variable Neighborhood Search. This study compares 3 neighborhood structures: insertion, exchange, and 2-opt. The use of 2-opt neighborhood structure gives the highest fitness averages of other neighborhood structure. Selection and arrangement of neighborhood structure in every k neighborhood have effect on the solution is obtained. The result of this study contains composition of foods with nutrients which are close to the needs of hypertension patients with attentions the sodium and minimal cost within a day.
Anomaly-based intrusion detector system using restricted growing self organizing map Tomi Yahya Christyawan; Ahmad Afif Supianto; Wayan Firdaus Mahmudy
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 3: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i3.pp919-926

Abstract

The rapid development of internet and network technology followed by malicious threats and attacks on networks and computers. Intrusion detection system (IDS) was developed to solve that problems. The development of IDS using machine learning is needed for classifying the attacks. One method of the classification is Self-Organizing Map (SOM). SOM able to perform classification and visualization in learning process to gain new knowledge. However, the SOM has less efficient in learning process when applied in Big Data. This study proposes Restricted Growing SOM method with clustering reference vector (RGSOM-CRV) and Parallel RGSOM-CRV to improve SOM efficiency in classification with accuracy consideration to solve Big Data problem. Growing process in RGSOM is restricted by maximum nodes and growing threshold, the reupdate weight process will update unused reference vector when map size already maximum, these two processes solve the consuming time of regular GSOM. From the results of this research against KDD Cup 1999 dataset, proposed method Parallel RGSOM-CRV able to give 91.86% accuracy, 20.58% false alarm rate, 95.32% recall or detection rate, and precision is 94.35% and time consuming is outperform than regular Growing SOM. This proposed method is very promising to handle big data problems compared with other methods.
Android Malware Detection Using Backpropagation Neural Network Fais Al Huda; Wayan Firdaus Mahmudy; Herman Tolle
Indonesian Journal of Electrical Engineering and Computer Science Vol 4, No 1: October 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v4.i1.pp240-244

Abstract

The rapid growing adoption of android operating system around the world affects the growth of malware that attacks this platform. One possible solution to overcome the threat of malware is building a comprehensive system to detect existing malware. This paper proposes multilayer perceptron artificial neural network trained with backpropagation algorithm to determine an application is malware or non-malware application which is often called benign application. The parameters that used in this study based on the list of permissions in the manifest file, the battery rating based on permission, and the size of the application file. Final weights obtained in the training phase will be used in mobile applications for malware detection. The experimental results show that the proposed method for detection of malware on android is effective. The effectiveness is demonstrated by the results of the accuracy of the system developed in this study is relatively high to recognize existing malware samples.
Co-Authors A.N. Afandi Abdul Latief Abadi Abdul Latief Abadi Achmad Arwan Achmad Basuki Achmad Ridok Adimoelja, Ariawan Aditama, Gustian Adyan Nur Alfiyatin Agi Putra Kharisma Agung Mustika Rizki Agung Mustika Rizki, Agung Mustika Agung Setia Budi Agung Setia Budi, Agung Setia Agus Naba Agus Wahyu Widodo Agus Wahyu Widodo Agus Wahyu Widodo, Agus Wahyu Ahmad Afif Supianto Ahmad Afif Supianto Ahmad Afif Supianto Aji Prasetya Wibawa Al Khuluqi, Mabafasa Alauddin, Mukhammad Wildan Alfiani Fitri Alfita Rakhmandasari Alfiyatin, Adyan Nur Alqorni, Faiz Amalia Kartika Ariyani Amalia Kartika Ariyani Amalia Kartika Ariyani Anantha Yullian Sukmadewa Andi Kurniawan Andi Maulidinnawati A K Parewe Andi Maulidinnawati A. K. Parewe Andreas Nugroho Sihananto Andreas Pardede Andreas Patuan G. Pardede Andrew Nafalski Angga Vidianto Anissa, Retno Dewi Aprilia Nur Fauziyah Aprilia Nur Fauziyah Arief Andy Soebroto Arinda Hapsari Achnas Armanda, Rifki Setya Arviananda Bahtiar Arya, Putu Bagus Asyrofa Rahmi Asyrofa Rahmi Asyrofa Rahmi Asyrofa Rahmi Asyrofa Rahmi, Asyrofa Aulia, Yudha Alif Bagus Priambodo Bagus Priambodo Bayu Rahayudi Binti Robiyatul Musanah Budi Darma Setiawan Burhan, M.Shochibul Cahya, Reiza Adi Cahyo Prayogo, Cahyo Candra Dewi Candra Fajri Ananda Cleoputri Yusainy Darmawan, Abizard Hashfi Dea Widya Hutami Dhaifullah, Afif Naufal Diah Anggraeni Pitaloka Didik Suprayogo Dinda Novitasari Dinda Novitasari, Dinda Diny Melsye Nurul Fajri Dita Sundarningsih Durrotul Fakhiroh Dyan Putri Mahardika Dzikron, Ahmad Ahdani Edi Satriyanto Edy Santoso Effendi, Mas’ud Eko Widaryanto Elta Sonalitha Ervin Yohannes Evi Nur Azizah Fadhli Almu’iini Ahda Fais Al Huda Fajri, Diny Melsye Nurul Fatchurrochman Fatchurrochman Fatwa Ramdani, Fatwa Fauzi, Muhammad Rifqi Fauziatul Munawaroh Fazlur Ihzanurahman Febriyana, Ria Fendy Yulianto Fitra Abdurrachman Bachtiar Fitri Anggarsari Fitria Dwi Nurhayati Gayatri Dwi Santika Ghozali Maski Grady Davinsyah Gusti Ahmad Fanshuri Alfarisy Gusti Ahmad Fanshuri Alfarisy, Gusti Ahmad Fanshuri Gusti Eka Yuliastuti Hafidz Ubaidillah Hamdianah, Andi Hanggara , Buce Trias Herman Tolle Hernando, Deo Heru Nurwarsito Hidayat, Luthfi Hilman Nuril Hadi Ida Wahyuni Ihsan Akram, Faiz Imada Nur Afifah Imam Cholisoddin Imam Cholissodin Imam Cholissodin Imam Cholissodin Imam Santoso Indriati Indriati Irvi Oktanisa Ishardita Pambudi Tama Ismiarta Aknuranda Jauhari, Farid Khozaimi, Ach. Kukuh Tejomurti, Kukuh Kuncahyo Setyo Nugroho Kuncahyo Setyo Nugroho Kurnianingtyas, Diva Lailil Muflikhah Lily Montarcih Limantara M Chandra Cahyo Utomo M Fadli Ridhani M Shochibul Burhan, M Shochibul M. Shochibul Burhan M. Zainal Arifin Mabafasa Al Khuluqi Mar'i, Farhanna Marji Marji Mayang Anglingsari Putri, Mayang Anglingsari Mochammad Anshori Moh. Khusaini Moh. Sholichin Moh. Zoqi Sarwani Mohammad Zoqi Sarwani Mohammad Zoqi Sarwani, Mohammad Zoqi Mu’asyaroh, Fita Lathifatul Muh Arif Rahman Muh. Arif Rahman Muhammad Ardhian Megatama Muhammad Faris Mas'ud Muhammad Halim Natsir Muhammad Isradi Azhar Muhammad Khaerul Ardi Muhammad Noor Taufiq Muhammad Rivai Muhammad Rofiq Nadia Roosmalita Sari Nadya Oktavia Rahardiani Nashi Widodo Ni Wayan Surya Wardhani Nindynar Rikatsih Novanto Yudistira Novi Nur Putriwijaya Nurizal Dwi Priandani Nurul Hidayat Oakley, Simon Oktanisa, Irvi Pardede, Andreas Philip Faster Eka Adipraja Pratama, Muhammad Fajarivan Prayudi Lestantyo Prima Zulvarina, Prima Purnomo Budi Santoso Putra, Firnanda Al Islama Achyunda Putri Hasan, Vitara Nindya Putu Indah Ciptayani Qoirul Kotimah Rachmansyah, Ghenniy Rachmawati, Christina Rani Kurnia Rayandra Yala Pratama, Rayandra Yala Retno Astuti Retno Dewi Anissa Riani, Garsinia Ely Rifa’i, Muhaimin Rinda Wahyuni Rizal Setya Perdana Rizal Setya Perdana Rizdania, Rizdania Rizki Ramadhan Rody, Rafiuddin Ruth Ema Febrita Ryan Iriany S, M Zaki Samaher . Saputro, Arkaditya Lanang Saragih, Triando Hamonangan Selly Kurnia Sari Setyawan Purnomo Sakti Sudarto Sudarto Suhana, Rizka Sukarmi Sukarmi, Sukarmi Sulistyo, Danang Arbian Sutrisno . Sutrisno Sutrisno Syafrial Syafrial Syafrial Syafrial Syaiful Anam Syandri, Hafrijal Tanjung, Lutfi Mitra Tirana Noor Fatyanosa, Tirana Noor Titiek Yulianti Titiek Yulianti Titiek YULIANTI Tomi Yahya Christyawan Tri Halomoan Simanjuntak Ubaidillah, Hafidz Ullump Pratiwi Utaminingrum, Fitri Utomo, M. Chandra Cahyo Vivi Nur Wijayaningrum Wahyuni, Ida Widdia Lesmawati Windi Artha Setyowati Yeni Herawati Yogi Pinanda Yogie Susdyastama Putra Yudha Alif Aulia Yudha Alif Auliya Yudha Alif Auliya, Yudha Alif Yulia Trianandi Yusuf Priyo Anggodo Yusuf Priyo Anggodo Yusuf Priyo Anggodo Yusuf Priyo Anggodo, Yusuf Priyo