Search

Bat Algorithm (BA) is a nature-inspired metaheuristic search algorithm designed to efficiently explore complex problem spaces and find near-optimal solutions. The algorithm is inspired by the echolocation behavior of bats, which acts as a signal system to estimate the distance and hunt prey. Although the BA has proven effective for various optimization problems, it exhibits limited exploration ability and susceptibility to local optima. The algorithm updates velocities and positions based on the current global best solution, causing all agents to converge toward a specific location, potentially leading to local optima issues in optimization problems. On this premise, this paper proposes the Modified Bat Algorithm (MBA) as an enhancement to address the local optima limitation observed in the original BA. MBA incorporates the frequency and velocity of the current best solution, enhancing convergence speed to the optimal solution and preventing local optima entrapment. While the original BA faces diversity issues, both the original BA and MBA are introduced. To assess MBA’s performance, three sets of test functions (classical benchmark functions, CEC2005, and CEC2019) are employed, with results compared to those of the original BA, Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Dragonfly Algorithm (DA). The outcomes demonstrate the MBA’s significant superiority over other algorithms. In addition, MBA successfully addresses a real-world assignment problem (call center problem), traditionally solved using linear programming methods, with satisfactory results. [ABSTRACT FROM AUTHOR]

Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms have shown promising results in solving various optimization problems. The crow search algorithm (CSA) is a new and effective meta-heuristic algorithm that emulates crows' intelligent group behavior in nature. However, it suffers from several problems, such as trapping into local optimum and premature convergence. This paper proposes an improved crow search algorithm (ICSA), which has been tested and evaluated by a set of well-known benchmark functions. A new update mechanism that uses the merits of the global best position to move toward the best position is proposed. This mechanism increases the convergence of the algorithm and improves its local search-ability. Twenty benchmark functions are used to evaluate the performance of the proposed ICSA. Moreover, the ICSA algorithm is compared with the conventional CSA and other meta-heuristic algorithms such as particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), gray wolf optimizer (GWO), moth-flame optimization (MFO), and sine-cosine algorithm (SCA). The experimental result shows that the proposed ICSA algorithm has produced promising results and outperformed conventional CSA and other meta-heuristic algorithms. Also, the proposed ICSA has a more robust convergence for optimizing objective functions in terms of solution accuracy and efficiency. [ABSTRACT FROM AUTHOR]