.png){kind=icon}
.png){kind=icon}
Return
Backtracking Search Algorithm with Mutation Strategy for Engineering Optimization
.png){kind=icon}
OA
AI
DOI：10.1007/s44196-025-01026-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The backtracking search algorithm (BSA) is a popular metaheuristic algorithm known for its simplicity and effectiveness in solving complex optimization problems. However, like many other algorithms, BSA has some weaknesses, such as getting stuck in local optima and converging too quickly to suboptimal solutions. To address these issues, this study introduces a new variant of BSA called the combined power mutation-based backtracking search algorithm (CPMBSA). The performance of the proposed CPMBSA approach is enhanced through the integration of a modified power mutation operator, which strengthens the exploration capability, and a combined mutation operator. This can improve convergence while preserving population diversity. These modifications help CPMBSA achieve a better balance of exploration and exploitation during the search. The CPMBSA has been tested on 86 benchmark functions to verify its performance and robustness. In addition, the algorithm has been applied to six real-world chemical engineering optimization problems and two engineering design optimization problems to evaluate its practical use in complex design challenges. The analysis of results shows that CPMBSA performs better than the original BSA and other advanced metaheuristic algorithms in terms of solution accuracy, convergence speed, and stability. The present research demonstrates that the proposed CPMBSA is a powerful optimization tool for both theoretical benchmark test problems and real-world engineering applications.
Keywords:
Backtracking search algorithm
Improved power mutation
Engineering optimization
Combined power mutation-based backtracking search algorithm
Benchmark functions
Journal
IF:
3
Papers:
346
Citations:
2.7K
View more organizations