Backtracking Search Algorithm with Mutation Strategy for Engineering Optimization

Abstract 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...

Popoln opis

Bibliografske podrobnosti

Principais autores:	Sanjib Debnath, Swapan Debbarma, Sukanta Nama, Apu Kumar Saha, Ghanshyam G. Tejani, Seyed Jalaleddin Mousavirad
Format:	Artigo
Jezik:	Inglês
Izdano:	Springer 2025-11-01
Serija:	International Journal of Computational Intelligence Systems
Teme:	Backtracking search algorithm Improved power mutation Engineering optimization Combined power mutation-based backtracking search algorithm Benchmark functions
Online dostop:	https://doi.org/10.1007/s44196-025-01026-9
Oznake:	Označite Brez oznak, prvi označite!