arrow
Return

Backtracking Search Algorithm with Mutation Strategy for Engineering Optimization

delete2025-11-03
delete0
delete
OA
AI
S
Sanjib Debnath
S
Swapan Debbarma
S
Sukanta Nama
A
Apu Kumar Saha
G
Ghanshyam G. Tejani
S
Seyed Jalaleddin Mousavirad *
DOI:10.1007/s44196-025-01026-9delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

International Journal of Computational Intelligence Systems cover
International Journal of Computational Intelligence Systems
IF:
3
Papers:
362
Citations:
2.7K

Organization

N
national institute of technology (nit system)
Scholars:
4.0W
Papers: 3.7W
Citations: 31
Y
Yuan Ze University
Scholars:
389
Papers: 256
Citations: 19
N
national institute of technology agartala
Scholars:
130
Papers: 82
Citations: 0
S
saveetha institute of medical & technical science
Scholars:
7.3K
Papers: 7.6K
Citations: 12
researcher View more organizations
Cited Papers

Cited Papers

Engineering Optimization Theory and Practice
err
IF0
err2019-12-13
err0
PREAI
errSingiresu S Rao
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
Metaheuristic Algorithms for Optimization: A Brief Review
err2024-03-13
err0
errOAAI
errVinita Tomar; Mamta Bansal; Pooja Singh
errShare
errSave
Adaptation in Natural and Artificial Systems
err
IF0
err1992-04-29
err0
PREAI
errJohn H. Holland
errShare
errSave
researcher View more