LAB: A Leader-Advocate-Believer Based Optimization Algorithm

TL;DR

The paper introduces LAB, a novel socio-inspired metaheuristic algorithm based on leader-advocate-believer roles, demonstrating superior performance in engineering optimization problems compared to existing algorithms.

Contribution

A new metaheuristic algorithm inspired by social roles and AI behavior, with demonstrated effectiveness in engineering and global optimization tasks.

Findings

LAB outperforms existing algorithms in computational time and function evaluations.

LAB achieves superior results in challenging engineering problems.

The paper discusses the features and limitations of the LAB algorithm.

Abstract

This manuscript introduces a new socio-inspired metaheuristic technique referred to as Leader-Advocate-Believer based optimization algorithm (LAB) for engineering and global optimization problems. The proposed algorithm is inspired by the AI-based competitive behaviour exhibited by the individuals in a group while simultaneously improving themselves and establishing a role (Leader, Advocate, Believer). LAB performance in computational time and function evaluations are benchmarked using other metaheuristic algorithms. Besides benchmark problems, the LAB algorithm was applied for solving challenging engineering problems, including abrasive water jet machining, electric discharge machining, micro-machining processes, and process parameter optimization for turning titanium alloy in a minimum quantity lubrication environment. The results were superior to the other algorithms compared such as Firefly Algorithm, Variations of Co-hort Intelligence, Genetic Algorithm, Simulated Annealing, Particle Swarm Optimisation, and Multi-Cohort Intelligence. The results from this study highlighted that the LAB outperforms the other algorithms in terms of function evaluations and computational time. The prominent features of the LAB algorithm along with its limitations are also discussed.