MLBRSA: Multi-Learning-Based Reptile Search Algorithm for Global Optimization and Software Requirement Prioritization Problems

Abstract

In the realm of computational problem-solving, the search for efficient algorithms tailored for real-world engineering challenges and software requirement prioritization is relentless. This paper introduces the Multi-Learning-Based Reptile Search Algorithm (MLBRSA), a novel approach that synergistically integrates Q-learning, competitive learning, and adaptive learning techniques. The essence of multi-learning lies in harnessing the strengths of these individual learning paradigms to foster a more robust and versatile search mechanism. Q-learning brings the advantage of reinforcement learning, enabling the algorithm to make informed decisions based on past experiences. On the other hand, competitive learning introduces an element of competition, ensuring that the best solutions are continually evolving and adapting. Lastly, adaptive learning ensures the algorithm remains flexible, adjusting the traditional Reptile Search Algorithm (RSA) parameters. The application of the MLBRSA to numerical benchmarks and a few real-world engineering problems demonstrates its ability to find optimal solutions in complex problem spaces. Furthermore, when applied to the complicated task of software requirement prioritization, MLBRSA showcases its capability to rank requirements effectively, ensuring that critical software functionalities are addressed promptly. Based on the results obtained, the MLBRSA stands as evidence of the potential of multi-learning, offering a promising solution to engineering and software-centric challenges. Its adaptability, competitiveness, and experience-driven approach make it a valuable tool for researchers and practitioners.