Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering TELKOMNIKA (Telecommunication Computing Electronics and Control) Journal of Environmental Engineering and Sustainable Technology Jurnal Teknologi Informasi dan Ilmu Komputer Indonesian Journal of Electrical Engineering and Computer Science
Yusuf Priyo Anggodo
Brawijaya University
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Energy Engineering Environmental Science Mechanical Engineering

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

Found 7 Documents
Search

 1 
Hybrid Genetic Algorithms and Simulated Annealing for Multi-trip Vehicle Routing Problem with Time Windows Amalia Kartika Ariyani; Wayan Firdaus Mahmudy; Yusuf Priyo Anggodo
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 6: December 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (85.504 KB) | DOI: 10.11591/ijece.v8i6.pp4713-4723

Abstract

Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach to solve the VRPTW that looking trip scheduling for gets best result. Even though there are various algorithms for the problem, there is opportunity to improve the existing algorithms in order gaining a better result. In this research, genetic algoritm is hybridized with simulated annealing algoritm to solve the problem. Genetic algoritm is employed to explore global search area and simulated annealing is employed to exploit local search area. Four combination types of genetic algorithm and simulated annealing (GA-SA) are tested to get the best solution. The computational experiment shows that GA-SA1 and GA-SA4 can produced the most optimal fitness average values with each value was 1.0888 and 1.0887. However GA-SA4 can found the best fitness chromosome faster than GA-SA1.
Improve Interval Optimization of FLR using Auto-speed Acceleration Algorithm Yusuf Priyo Anggodo; Imam Cholissodin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 4: August 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

Inflation is a benchmark of a country's economic development. Inflation is very influential on various things, so forecasting inflation to know on upcoming inflation will impact positively. There are various methods used to perform forecasting, one of which is the fuzzy time series forecasting with maximum results. Fuzzy logical relationships (FLR) model is a very good in doing forecasting. However, there are some parameters that the value needs to be optimised. Interval is a parameter which is highly influence toward forecasting result. The utilizing optimization with hybrid automatic clustering and particle swarm optimization (ACPSO). Automatic clustering can do interval formation with just the right amount. While the PSO can optimise the value of each interval and it is providing maximum results. This study proposes the improvement in find the solution using auto-speed acceleration algorithm. Auto-speed acceleration algorithm can find a global solution which is hard to reach by the PSO and time of computation is faster. The results of the acquired solutions can provide the right interval so that the value of the FLR can perform forecasting with maximum results.
A Novel Forecasting Based on Automatic-optimized Fuzzy Time Series Yusuf Priyo Anggodo; Wayan Firdaus Mahmudy
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 4: August 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, we propose a new method for forecasting based on automatic-optimized fuzzy time series to forecast Indonesia Inflation Rate (IIR). First, we propose the forecasting model of two-factor high-order fuzzy-trend logical relationships groups (THFLGs) for predicting the IIR. Second, we propose the interval optimization using automatic clustering and particle swarm optimization (ACPSO) to optimize the interval of main factor IIR and secondary factor SF, where SF = {Customer Price Index (CPI), the Bank of Indonesia (BI) Rate, Rupiah Indonesia /US Dollar (IDR/USD) Exchange rate, Money Supply}. The proposed method gets lower root mean square error (RMSE) than previous methods.
AUTOMATIC CLUSTERING AND OPTIMIZED FUZZY LOGICAL RELATIONSHIPS FOR MINIMUM LIVING NEEDS FORECASTING Yusuf Priyo Anggodo; Wayan Firdaus Mahmudy
Journal of Environmental Engineering and Sustainable Technology Vol 4, No 1 (2017)
Publisher : Lembaga Penelitian dan Pengabdian kepada Masyarakat Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (777.074 KB) | DOI: 10.21776/ub.jeest.2017.004.01.1

Abstract

Forecasting of minimum living needs is useful for companies in financial planning next year. In this study, the firescasting is done using automatic clustering and optimized fuzzy logical relationships. Automatic clustering is used to form a sub-interval time series data. Particle swarm optimization is used to set and optimze interval values in fuzzy logical relationships. The data used as many as 11 years of historical data from 2005-2015. The optimal value of the test results obtained by the p = 4, the number of iterations = 100, the number of particles = 45, a combination of Vmin and Vmax = [-0.6, 0.6], as well as combinations Wmax and Wmin = [0, 4, 0 , 8]. These parameters values produce good forecasting results.Keywords: minimum living needs, automatic clustering, particle swarm optimization, fuzzy logical relationships
Hybrid K-means Dan Particle Swarm Optimization Untuk Clustering Nasabah Kredit Yusuf Priyo Anggodo; Winda Cahyaningrum; Aprilia Nur Fauziyah; Irma Lailatul Khoiriyah; Oktavianis Kartikasari; Imam Cholissodin
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 4 No 2: Juni 2017
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (277.188 KB) | DOI: 10.25126/jtiik.201742303

Abstract

AbstrakKredit merupakan suatu pendapatan terbesar bagi bank. Akan tetapi, bank harus selektif dalam menentukan nasabah yang dapat menerima kredit. Permasalahan ini menjadi semakin komplek karena ketika bank salah memberikan kredit kepada nasabah dapat merugikan, selain itu banyaknya parameter penentu dalam penentuan nasabah yang kredit. Clustering merupakan salah satu cara untuk dapat menyelesaikan permasalahan ini. K-means merupakan metode yang simpel dan popular dalam menyelesaikan permasalahan clustering. Akan tetapi, K-means murni tidak dapat memberikan solusi optimum sehingga perlu dilakukan improve untuk mendapatkan solusi optimum. Salah satu metode optimasi yang dapat menyelesaikan permasalahan optimasi dengan baik adalah particle swarm optimization (PSO). PSO sangat membantu dalam proses clustering dengan melakukan optimasi pada titik pusat tiap cluster. Untuk meningkatkan hasil yang lebih baik pada PSO ada beberapa improve yang dilakukan. Pertama penggunaan time-variant inertia untuk membuat nilai w atau inertia dinamis ditiap iterasi. Kedua melakukan kontrol kecepatan partikel atau velocity clamping untuk mendapatkan posisi terbaik. Selain itu untuk mengatasi konvergensi dini dilakukan hybrid PSO dengan random injection. Hasil pengujian menunjukan hybrid PSO K-means memberikan hasil terbesar dibandingkan K-means dan PSO K-means, dimana silhouette dari K-means, PSO K-means, dan hybrid PSO K-means masing-masing 0.57343, 0.792045, 1.Kata kunci: Kredit, Clustering, PSO, K-means, Random InjectionAbstractCredit is the biggest revenue for the bank. However, banks have to be selective in deciding which clients can receive the credit. This issue is becoming increasingly complex because when the bank was wrong to give credit to customers can do harm, apart of that a large number of deciding parameter in determining customer credit. Clustering is one way to be able to resolve this issue. K-means is a simple and popular method for solving clustering. However, K-means pure can’t provide optimum solutions so that needs to be done to get the optimum solution to improve. One method of optimization that can solve the problems of optimization with particle swarm optimization is good (PSO). PSO is very helpful in the process of clustering to perform optimization on the central point of each cluster. To improve better results on PSO there are some that do improve. The first use of time-variant inertia to make the dynamic value of inertial w each iteration. Both control the speed of the particle velocity or clamping to get the best position. Besides to overcome premature convergence do hybrid PSO with random injection. The results of this research provide the optimum results for solving clustering of customer credits. The test results showed the hybrid PSO K-means provide the greatest results than K-means and PSO K-means, where the silhouette of the K-means, PSO K-means, and hybrid PSO K-means respectively 0.57343, 0.792045, 1.Keywords: Credit, Clustering, PSO, K-means, Random Injection
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.
Peramalan Butuhan Hidup Minimum Menggunakan Automatic Clustering dan Fuzzy Logical Relationship Yusuf Priyo Anggodo; Wayan Firdaus Mahmudy
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 3 No 2: Juni 2016
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (926.087 KB) | DOI: 10.25126/jtiik.201632202

Abstract

Kebutuhan hidup minimum (KHM) adalah standar kebutuhan seorang pekerja atau lanjang untuk dapat hidup layak secara fisik untuk kebutuhan satu bulan. Selain itu KHM berpengaruh terhadap upah minum provinsi dan kota. Oleh karena itu diperlukan suatu peramalan KHM untuk mengetahui nilai KHM di tahun yang akan datang. Peramalan ini bermanfaat untuk perusahaan dalam merencanakan keuangan perusahaan tahun depan. Dalam melakukan peramalan KHM menggunakan metode automatic clustering dan fuzzy logical relationship. Automatic clustering digunakan untuk membentuk sub-interval dari data time series yang ada. Sedangkan fuzzy logical relationship digunakan untuk melakukan peramalan KHM berdasarkan relasi fuzzy yang telah dikelompokan. Automatic clustering dapat menghasilkan cluster-cluster yang sangat baik sehingga dalam melakukan peramalan dalam fuzzy logical relationship memberikan akurasi yang tinggi. Dalam menghitung kesalahan menggunakan mean squere error (MSE), nilai kesalahan semakin berkurang ketika diterapkan automatic clustering dalam fuzzy logical relationship. Hasil peramalan memiliki nilai koefisien korelasi yang hampir mendekati satu.
Co-Authors Adyan Nur Alfiyatin Amalia Kartika Ariyani Aprilia Nur Fauziyah Imam Cholissodin Imam Cholissodin Irma Lailatul Khoiriyah Oktavianis Kartikasari Wayan Firdaus Mahmudy Winda Cahyaningrum