Drawer Algorithm: A New Metaheuristic Approach for Solving Optimization Problems in Engineering

Abstract

Metaheuristic optimization algorithms play an essential role in optimizing problems. In this article, a new metaheuristic approach called the drawer algorithm (DA) is developed to provide quasi-optimal solutions to optimization problems. The main inspiration for the DA is to simulate the selection of objects from different drawers to create an optimal combination. The optimization process involves a dresser with a given number of drawers, where similar items are placed in each drawer. The optimization is based on selecting suitable items, discarding unsuitable ones from different drawers, and assembling them into an appropriate combination. The DA is described, and its mathematical modeling is presented. The performance of the DA in optimization is tested by solving fifty-two objective functions of various unimodal and multimodal types and the CEC 2017 test suite. The results of the DA are compared to the performance of twelve well-known algorithms. The simulation results demonstrate that the DA, with a proper balance between exploration and exploitation, produces suitable solutions. Furthermore, comparing the performance of optimization algorithms shows that the DA is an effective approach for solving optimization problems and is much more competitive than the twelve algorithms against which it was compared to. Additionally, the implementation of the DA on twenty-two constrained problems from the CEC 2011 test suite demonstrates its high efficiency in handling optimization problems in real-world applications.

Path Planning for the Rapid Reconfiguration of a Multi-Robot Formation Using an Integrated Algorithm

“…Metaheuristic algorithms, such as the genetic algorithm [18][19][20], annealing algorithm [21], tabu search algorithm [22], particle swarm optimization algorithm [23], and ant colony algorithm [24][25][26], have gained popularity in recent years for solving complex problems that cannot be solved by traditional methods [27][28][29]. Consequently, many researchers have utilized these metaheuristic global optimization algorithms to address multi-objective path planning.…”

Swarm Bipolar Algorithm: A Metaheuristic Based on Polarization of Two Equal Size Sub Swarms

“…Meanwhile, the decision variables construct the solution set and are used in the objective function. These three aspects (constraints, accuracy, and decision variables) are fundamental to any optimizations [3].…”

“…The popularity of metaheuristics comes from its stochastic approach, which scans the solution randomly inside the space so that it does not trace all possible solutions through the iterative process [3]. This approach gives an advantage in avoiding excessive computational processes, especially in International Journal of Intelligent Engineering and Systems, Vol.17, No.2, 2024 DOI: 10.22266/ijies2024.0430.…”

A Subtraction-Average-Based Optimizer for Solving Engineering Problems with Applications on TCSC Allocation in Power Systems

“…Stochastic techniques solve optimization issues by randomly exploring the searching space and employing arbitrary operators. Such methods build a population of workable solutions to a particular issue before iteratively improving those answers to finally settle on an acceptable solution [ 3 , 4 , 5 ].…”