Hybrid algorithms based on combining reinforcement learning and metaheuristic methods to solve global optimization problems

This paper introduces three hybrid algorithms that help in solving global optimization problems using reinforcement learning along with metaheuristic methods. Using the algorithms presented, the search agents try to find a global optimum avoiding the local optima trap. Compared to the classical metaheuristic approaches, the proposed algorithms display higher success in finding new areas as well as exhibiting a more balanced performance while in the exploration and exploitation phases. The algorithms employ reinforcement agents to select an environment based on predefined actions and tasks. A reward and penalty system is used by the agents to discover the environment, done dynamically without following a predetermined model or method. The study makes use of Q-Learning method in all three metaheuristic algorithms, so-called RLI−GWO, RLEx−GWO, and RLWOA algorithms, so as to check and control exploration and exploitation with Q-Table. The Q-Table values guide the search agents of the metaheuristic algorithms to select between the exploration and exploitation phases. A control mechanism is used to get the reward and penalty values for each action. The algorithms presented in this paper are simulated over 30 benchmark functions from CEC 2014, 2015 and the results obtained are compared with well-known metaheuristic and hybrid algorithms (GWO, RLGWO, I-GWO, Ex-GWO, and WOA). The proposed methods have also been applied to the inverse kinematics of the robot arms problem. The results of the used algorithms demonstrate that RLWOA provides better solutions for relevant problems. •Global optimization problems are generally NP-hard problem where metaheuristic algorithms find the optimal solution in the search space.•Reinforcement learning methods give high success rate in finding new global areas compared with metaheuristics and have a more balanced behavior.•Three metaheuristic-reinforcement learning hybrid algorithms are proposed switching between exploration and exploitation phases as and when needed making them more successful in finding better optimized solutions.•They have been applied over 30 benchmark functions and have been simulated to inverse kinematics of the robot arms problem.