Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation

DOI10.1016/J.AMC.2019.124919MaRDI QIDQ2287628zbMATH OpenOpenAlexWikidataFDO

Authors Bryar A. Hassan, Tarik A. Rashid

Publication date 21 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.13011

zbMATH Keywords

backtracking search optimisation algorithmBSA applicationsevolutionary optimisation algorithmsoptimisation problemsperformance evaluationswarm intelligence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Abstract: The experiments conducted in previous studies demonstrated the successful performance of BSA and its non-sensitivity toward the several types of optimisation problems. This success of BSA motivated researchers to work on expanding it, e.g., developing its improved versions or employing it for different applications and problem domains. However, there is a lack of literature review on BSA; therefore, reviewing the aforementioned modifications and applications systematically will aid further development of the algorithm. This paper provides a systematic review and meta-analysis that emphasise on reviewing the related studies and recent developments on BSA. Hence, the objectives of this work are two-fold: (i) First, two frameworks for depicting the main extensions and the uses of BSA are proposed. The first framework is a general framework to depict the main extensions of BSA, whereas the second is an operational framework to present the expansion procedures of BSA to guide the researchers who are working on improving it. (ii) Second, the experiments conducted in this study fairly compare the analytical performance of BSA with four other competitive algorithms: differential evolution (DE), particle swarm optimisation (PSO), artificial bee colony (ABC), and firefly (FF) on 16 different hardness scores of the benchmark functions with different initial control parameters such as problem dimensions and search space. The experimental results indicate that BSA is statistically superior than the aforementioned algorithms in solving different cohorts of numerical optimisation problems such as problems with different levels of hardness score, problem dimensions, and search spaces.

Recommendations

• Backtracking search optimization algorithm for numerical optimization problems
• Improved backtracking search algorithm based on population control factor and optimal learning strategy
• Generating functions and the performance of backtracking adaptive search
• Slime mould algorithm: a comprehensive review of recent variants and applications
• A comprehensive review of cuckoo search: variants and hybrids

Cites work

• A comparative study of artificial bee colony algorithm
• A literature survey of benchmark functions for global optimisation problems
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Adaptive evolutionary clustering
• Backtracking search algorithm for multi-objective design optimisation
• Backtracking search optimization algorithm for numerical optimization problems
• Backtracking-assisted multiplication
• Combinatorial optimization. Theory and algorithms. Translated from the English by R. von Randow
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Cost-sensitive feature selection of numeric data with measurement errors
• Data mining and knowledge discovery with evolutionary algorithms
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• scientific article; zbMATH DE number 2159093 (Why is no real title available?)
• Improved backtracking search algorithm based on population control factor and optimal learning strategy
• Introduction to nature-inspired optimization
• Mathematical analysis and its applications. Proceedings of the international conference on recent trends in mathematical analyis and its applications, ICRTMAA 2014, Roorkee, India, December 21--23, 2014
• Mathematical Foundations of Nature-Inspired Algorithms
• Modern solvers for Helmholtz problems
• New heuristics for no-wait flowshops to minimize makespan.
• Probe backtrack search for minimal perturbation in dynamic scheduling
• Quantum-walk speedup of backtracking algorithms
• Springer Handbook of Computational Intelligence

Cited in

(5)

• Multi-objective grasshopper optimization algorithm based on multi-group and co-evolution
• Improved backtracking search algorithm based on population control factor and optimal learning strategy
• Backtracking search optimization algorithm for numerical optimization problems
• A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean
• Quadratic interpolation boosted black widow spider-inspired optimization algorithm with wavelet mutation

Describes a project that uses

Uses Software

• ABC

This page was built for publication: Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287628)