Suiçmez, ÇağrıKahraman, Hamdi TolgaCengiz, EnesYılmaz, Cemal2023-04-102023-04-1020212148-2446http://doi.org/10.29130/dubited.1014947https://search.trdizin.gov.tr/yayin/detay/498914https://hdl.handle.net/20.500.12684/11844Runge Kutta (RUN) is an up-to-date and well-founded metaheuristic algorithm. The RUN algorithm aims to find the global best in solving problems by going beyond the traps of metaphors. For this purpose, enhanced solution quality mechanism is used to avoid local optimum solutions and increase the convergence speed. Although the RUN algorithm offers promising solutions, it is seen that this algorithm has shortcomings, especially in solving high dimensional multimodal problems. In this study, the solution candidates that guide the search process in the RUN algorithm are developed using the Fitness-Distance Balance (FDB) method. Thus, using the FDB-based RUN algorithm, the global optimum value of many optimization problems will be obtained in the future. CEC 2020 which has current benchmark problems was used to test the performance of the developed FDB-RUN algorithm. 10 different unconstrained benchmark problems taken from CEC 2020 were designed by arranging them in 30/50/100 dimensions. Experimental studies were carried out using the designed benchmark problems and analyzed with Friedman and Wilcoxon statistical test methods. According to the results of the analysis, it was seen that the FDB-RUN variations showed a superior performance compared to the base algorithm (RUN) in all experimental studies. In particular, it has been shown to provide more effective results for the continuous optimization of high-dimensional problems.en10.29130/dubited.1014947info:eu-repo/semantics/openAccessArticle96135149498914