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

Descripció completa

Dades bibliogràfiques

Autors principals:	Sanjib Debnath, Swapan Debbarma, Sukanta Nama, Apu Kumar Saha, Ghanshyam G. Tejani, Seyed Jalaleddin Mousavirad
Format:	Artigo
Idioma:	Inglês
Publicat:	Springer 2025-11-01
Col·lecció:	International Journal of Computational Intelligence Systems
Matèries:	Backtracking search algorithm Improved power mutation Engineering optimization Combined power mutation-based backtracking search algorithm Benchmark functions
Accés en línia:	https://doi.org/10.1007/s44196-025-01026-9
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!