2012 ©
             Publication
Journal Publication
Title of Article The Cuckoo Search Algorithm with Suitable Probabilistic Mutation Parameter for Global Optimization Problems 
Date of Acceptance 19 November 2019 
Journal
     Title of Journal KKU Science Journal 
     Standard TCI 
     Institute of Journal Faculty of Science at Khon Kaen University 
     ISBN/ISSN ISSN 2586-9531 
     Volume 48 
     Issue
     Month มกราคม-มีนาคม
     Year of Publication 2019 
     Page  
     Abstract As the complexity of the optimization problems increases over the last few decades, such as Congress on Evolutionary Computation-2017 (CEC-2017) benchmark functions, the development of new optimization techniques becomes evident more than before. Modern algorithms are required because the conventional algorithms are inadequate to solve the complicated problems. The Nearest neighbor cuckoo search with the probabilistic mutation, which is the improved cuckoo search algorithm using the topology of the nearest neighbor population and probabilistic mutation to fix the step size problem in search space is studied in this work. The proposed algorithm can solve the problem without using any NN topology and it provides better result than the NNCS. The of 0.06 was selected for both low and high dimensional problems. The proposed method has been compared with other previously reported algorithms such as ABC, CS, PSO, FA, GSA, GWO, MVO, MFO, QPSO, LCA, NNCS to investigate the improvement of efficiency over the original CS. 
     Keyword Cuckoo search, Lévy flight, Nature-inspired algorithm 
Author
607020030-3 Mr. PATCHARA NASA-NGIUM [Main Author]
Science Doctoral Degree

Reviewing Status มีผู้ประเมินอิสระ 
Status ได้รับการตอบรับให้ตีพิมพ์ 
Level of Publication ชาติ 
citation false 
Part of thesis true 
Attach file
Citation 0