optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so *** order to solve optimization problems,metaheuristic algorithms are *** of these techniques ...
详细信息
optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so *** order to solve optimization problems,metaheuristic algorithms are *** of these techniques are influenced by collective knowledge and natural *** is no such thing as the best or worst algorithm;instead,there are more effective algorithms for certain ***,in this paper,a new improved variant of a recently proposed metaphorless runge-kuttaoptimization(RKO)algorithm,called Improved runge-kuttaoptimization(IRKO)algorithm,is suggested for solving optimization *** IRKO is formulated using the basic RKO and local escaping operator to enhance the diversification and intensification capability of the basic RKO *** performance of the proposed IRKO algorithm is validated on 23 standard benchmark functions and three engineering constrained optimization *** outcomes of IRKO are compared with seven state-of-the-art algorithms,including the basic RKO *** to other algorithms,the recommended IRKO algorithm is superior in discovering the optimal results for all selected optimization *** runtime of IRKO is less than 0.5 s for most of the 23 benchmark problems and stands first for most of the selected problems,including real-world optimization problems.
The runge-kuttaoptimization (runge) algorithm is a recently proposed metaphor-free metaheuristic optimizer borrowing practical mathematical foundations of the famous runge-kutta differential equation solver. Despite ...
详细信息
The runge-kuttaoptimization (runge) algorithm is a recently proposed metaphor-free metaheuristic optimizer borrowing practical mathematical foundations of the famous runge-kutta differential equation solver. Despite its relatively new emergence, this algorithm has several applications in various branches of scientific fields. However, there is still much room for improvement as it suffers from premature convergence resulting from inefficient search space exploration. To overcome this algorithmic drawback, this research study proposes a brand-new quasi-dynamic opposition-based learning (QDOPP) mechanism to be implemented in a standard runge-kutta optimizer to eliminate the local minimum points over the search space. Enhancing the asymmetric search hyperspace by taking advantage of various positions of the current solution within the domain is the critical novelty to enrich general diversity in the population, significantly improving the algorithm's overall exploration capability. To validate the effectivity of the proposed runge-QDOPP method, thirty-four multidimensional optimization benchmark problems comprised of unimodal and multimodal test functions with various dimensionalities have been solved, and the corresponding results are compared against the predictions obtained from the other opposition-based learning variants as well as some state-of-art literature optimizers. Furthermore, six constrained engineering design problems with different functional characteristics have been solved, and the respective results are benchmarked against those obtained for the well-known optimizers. Comparison of the solution outcomes with literature optimizers for constrained and unconstrained test problems reveals that the proposed QDOPP has significant advantages over its counterparts regarding solution accuracy and efficiency.
暂无评论