Repository Universitas Ahmad Dahlan

Enhancing Modified Cuckoo Search Algorithm by Using MCMC Random Walk

Aida Husaini, Noor and Ghazali, Rozaida and Tri Riyadi Yanto, Iwan (2018) Enhancing Modified Cuckoo Search Algorithm by Using MCMC Random Walk. [Artikel Dosen]

Enhancing Modified Cuckoo Search Algorithm by Using MCMC Random Walk.pdf

Download (5MB) | Preview


In this paper, we scrutinised an improvement of the Modified Cuckoo Search (MCS), called Modified Cuckoo Searoh-Markov chain Monte Carlo (MCS-MCMC) algorithm, for solving optimisation problems. The performance of MCS are at least on a par with the standard Cuckoo Search (CS) in terms of high rate of convergence when dealing with true global minimum, although at high number of dimensions. In conjunction with the benefits of MCS, we aim to enhance the MCS algorithm by applying Markov chain Monte Carlo (MCMC) random walk. We validated the proposed algorithm alongside several test functions and later on, we compare its performance with those of MCS-Levy algorithm. The capability of the MCS-MCMC algorithm in yielding good results is considered as a solution to deal with the downside of those existing algorithm Keyword&- MCS-MCMC, modified cuckoo search, cuckoo search, Markov chain Monte Carlo

Item Type: Artikel Dosen
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisi / Prodi: Faculty of Mathematics and Natural Sciences (Fakultas Matematika dan Ilmu Pengetahuan Alam) > S1-Information System (S1-Sistem Informasi)
Depositing User: Iwan Tri Riyadi Yanto
Date Deposited: 06 Nov 2018 06:56
Last Modified: 06 Nov 2018 06:56

Actions (login required)

View Item View Item

Repository Universitas Ahmad Dahlan is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.