Lord Rama Devotees Algorithm: A New Human-Inspired Metaheuristic Optimization Algorithm
Several Human-Inspired Metaheuristic Optimization Algorithms were proposed in literature. But the concept of DevoteesInspired Metaheuristic Optimization Algorithms is not yet explored. In this article, Lord Rama Devotees Algorithm (LRDA) is proposed which is a new Devotees-Inspired Metaheuristic Optimization Algorithm.
Introduction
Articles [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11] proposed various Human-Inspired Optimization Algorithms. But the concepts like “Devotion”, “Devotees” are not yet explored. This article is based on this research gap. Section 2 shows “Lord Rama Devotees Algorithm (LRDA)”.
Lord Rama Devotees Algorithm
The population consists of Lord Rama Devotees and non-devotees. Based on random number generated and Lord Rama Devotee Probability, the human is classified into either Lord Rama Devotee or non-devotee. Lord Rama Devotee is not affected by success or failure and he moves in search space without any halt. So velocity and position are always updated as shown in line number 15 and 16 irrespective of anything. But this is not the case for non-devotee. Based on random number generated and Non Devotee Success Probability, non-devotee is classified to facing either success or failure. Non-devotee will not update velocity and position and moves into halted state when he faces failure as shown in line number 25. He updates velocity and position when he faces success as shown in line number 21 and 22. Hence failure or success is not a matter for Lord Rama Devotee. But non-devotee will stop progress when he faces failure.
Procedure
- Lord Rama Devotees Algorithm (LRDA)
- Initialize all devotees
- iterations = 0
- do
- for each devotee i do
- If (f( xi) < f (p best i)) then
- P best i = xi
- end if
- if (f (p best i) < f (g best)) then
- g best = p best i
- end if
- end for
- for each devotee i do
- if (random(0,
15. for each dimension d do 16. vi, d = w*vi, d + C1*Random(0,1)*(p best i, d – xi, d) + C2*Random(0,1)*(g best d – xi, d) 17. xi, d = xi, d + vi, d 18. end for 19. else // Non devotee 20. if (random(0,1) < Non Devotee Success Probability) then 21. for each dimension d do 22. vi, d = w*vi, d + C1*Random(0,1)*(p best i, d – xi, d) + C2*Random(0,1)*(g best d – xi, d) 23. xi, d = xi, d + vi, d 24. end for 25. else // Non devotee with failure 26. // non-devotee with failure does not update position and velocity 27. end if 28. end if 29. end for 30. iterations = iterations + 1 31. while (termination condition is false)
Results
Human Bhagavad Gita Particle Swarm Optimization (HBGPSO) proposed in Gajawada, et al. [7] and Lord Rama Devotees Algorithm (LRDA) proposed in this article is mathematically equivalent. According to Gajawada, et al. [7], HBGPSO performed as well as PSO. Hence Lord Rama Devotees Algorithm (LRDA) performed as well as PSO as it is mathematically equivalent to HBGPSO.
Conclusion
In this article, a new metaheuristic optimization algorithm titled “Lord Rama Devotees Algorithm (LRDA)” is proposed. Results show that proposed LRDA algorithm performed as well as PSO algorithm. In this article, PSO is modified with the concept of “devotion”, “devotees” to get LRDA algorithm. Hence LRDA algorithm is a Hybrid-PSO Algorithm. This article is a starting point of “Devotees- Inspired Metaheuristic Optimization Algorithms”. Hence it is ideal for future research scientists to create algorithms like LRDA from scratch instead of modifying existing algorithms like PSO as done in this article.
References
-
Zhang LM, Dahlmann C, Zhang Y (2009) Human-Inspired Algorithms for continuous function optimization. IEEE International Conference on Intelligent Computing and Intelligent Systems, Shanghai, China, pp: 318-321.
-
Rai R, Das A, Ray S, Dhal KG (2022) Human-Inspired Optimization Algorithms: Theoretical Foundations, Algorithms, Open-Research Issues and Application for Multi-Level Thresholding. Arch Computat Methods Eng 29(7): 5313-5352.
-
Dehghani M, Trojovska E, Zuscak T (2022) A new human-inspired metaheuristic algorithm for solving optimization problems based on mimicking sewing training. Scientific Reports.
-
Faridmehr I, Nehdi ML, Davoudkhani IF, Poolad A (2023) Mountaineering Team-Based Optimization: A Novel Human-Based Metaheuristic Algorithm 11(5).
-
Wang X, Xu J, Huang C (2023) Fans Optimizer: A human- inspired optimizer for mechanical design problems optimization. Expert Systems with Applications 228.
-
Trojovsky P, Dehghani M, Trojovska E, Milkova E (2023) Language Education Optimization: A New Human- Based Metaheuristic Algorithm for Solving Optimization Problems. Computer Modeling in Engineering & Sciences 136(2): 1527-1573.
-
Gajawada S, Mustafa H (2019) Ten Artificial Human Optimization Algorithms. Transactions on Engineering and Computing Sciences 7(3): 01-16.
-
Moosavi SHS, Bardsiri VK (2019) Poor and rich optimization algorithm: A new human-based and multi population’s algorithm. Engineering Applications of Artificial Intelligence 86: 165-181.
-
Trojovsky P, Dehghani M (2022) A new optimization algorithm based on mimicking the voting process for leader selection. PeerJ Comput Sci 8: e976.
-
Dehghani M, Trojovska E, Trojovsky P (2022) A new human-based metaheuristic algorithm for solving optimization problems on the base of simulation of driving training process. Scientific reports 12: 9924.
-
Fattahi M, Bidar M, Kanan HR (2018) Focus Group: An Optimization Algorithm Inspired by Human Behavior. International Journal of Computational Intelligence and Applications 17(1).
- Group Consensus of Nonlinear Hybrid Multi-Agent Systems with Self-Triggering Event Mechanism
- Optimum Vector Combinatorial Theory and Its Applications
- Manifold Systems Applied Theory for Innovative Robotic Technology
- Collaborative Robots: Human-Robots Coexistence in Industrial Environments
- Utilizing Idle Time for Job Clusters Reduces Inventory and Total Job Completion Time for Single Machine Scheduling
- Embracing the Future of Robotics with ART