Abstract
In order to solve the problems of backtracking search optimization algorithm with slow convergence speed and easy to fall into local optimum, an improved backtracking search optimization algorithm based on multi-strategy synergy is proposed. Foremost, a combination mutation strategy based on chaotic map and gamma distribution is introduced. The poor individuals are mutated to generate better quality individuals under a certain probability. Next, the global optimal individual information is introduced into the cross equation to guide the population update. Last but not least, a small habitat displacement method based on simulated annealing is designed. The poor individual is found by the niche radius, and the rich individuals are reconstructed by the global optimal individual information and the Gaussian distribution random function, and the convergence speed of the algorithm is improved. The simulated annealing algorithm is integrated on the niche technology to ensure the diversity of the new population and improve the convergence speed of the algorithm. In this paper, some standard test functions are selected, and numerical simulations are carried out in low-dimensional and high-dimensional states, compared with seven well-performing algorithms. The improved algorithm was analyzed by complexity, T test and ANOVA test. Simulation experiments on 20 standard test functions show that the improved algorithm has a faster convergence speed and higher convergence accuracy. Even in a high-dimensional multi-peak function, the convergence accuracy of the improved algorithm after the same number of iterations is 15 times higher than the original algorithm above the magnitude.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ahandani MA, Ghiasi AR, Kharrati H (2018) Parameter identification of chaotic systems using a shuffled backtracking search optimization algorithm. Soft Comput 22:8317–8339
Ayan Kürşat, Kılıç Ulaş (2016) Optimal power flow of two-terminal HVDC systems using backtracking search algorithm. Int J Electr Power Energy Syst 78:326–335
Cavicchio DJ (1972) Reproductive adaptive plans. In: Proceedings of the ACM 1972 annual conference, pp 1–11
Chen D, Zou F, Lu R, Wang P (2017) Learning backtracking search optimisation algorithm and its application. Inf Sci 376(10):71–94
Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144
El-Fergany Attia (2015) Optimal allocation of multi-type distributed generators using backtracking search optimization algorithm. Int J Electr Power Energy Syst 64:1197–1205
Engin O, Güçlü A (2018) A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl Soft Comput 72:166–176
Hassan BA, Rashid TA (2020a) Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation. Appl Math Comput 370:124919
Hassan BA, Rashid TA (2020b) Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms. Data Brief 28:105046
Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471
Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, vol 4, pp 1942–1948
Li B, Ding L, Rajai M, Hu D, Zheng S (2018) Backtracking algorithm-based disassembly sequence planning. Procedia CIRP 69:932–937
Liang JJ, Qin AK, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evolut Comput 10(3):281–295
Liu F, Wang Y, Bai Y, Yu J (2019) Study on stealth characteristics of metamaterials based on simulated annealing algorithm. Procedia Comput Sci 147:221–227
Maniezzo V, Gambardella LM, Luigi FD (2010) Ant colony optimization. Alphascript Publ 28:1155–1173
Marques Filipe J (2019) Products of ratios of gamma functions—an application to the distribution of the test statistic for testing the equality of covariance matrices. J Comput Appl Math 354:86–95
Mehmood A, Zameer A, Chaudhary I, Raja MAZ (2019a) Backtracking search heuristics for identification of electrical muscle stimulation models using Hammerstein structure. Appl Soft Comput 84:105705
Mehmood A, Chaudhary NI, Zameer A, Raja MAZ (2019b) Backtracking search optimization heuristics for nonlinear Hammerstein controlled auto regressive auto regressive systems. ISA Trans 91:99–113
Modiri-Delshad M, Abd Rahim N (2014) Solving non-convex economic dispatch problem via backtracking search algorithm. Energy 77(1):372–381
Modiri-Delshad M, Abd Rahim N (2016) Multi-objective backtracking search algorithm for economic emission dispatch problem. Appl Soft Comput 40:479–494
Nama S, Saha AK, Ghosh S (2017) Improved backtracking search algorithm for pseudo dynamic active earth pressure on retaining wall supporting c-Ф backfill. Appl Soft Comput 52:885–897
Price K, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization (natural computing series). Springer-Verlag New York Inc, Secaucus
Rahman CM, Rashid TA (2019) Dragonfly algorithm and its applications in applied science survey. Comput Intell Neurosci 2019:9293617. https://doi.org/10.1155/2019/9293617
Raja MAZ, Akhtar R, Chaudhary NI, Khan WU, Zhiyu Z, Jamil A, Zaman F (2020) Design of backtracking search optimization paradigm for joint amplitude-angle measurement of sources lying in fraunhofer zone. Measurement 149:106977
Salgotra R, Singh U (2017) Application of mutation operators to flower pollination algorithm. Expert Syst Appl 79(15):112–129
Su Z, Wang H, Yao P (2016) A hybrid backtracking search optimization algorithm for nonlinear optimal control problems with complex dynamic constraints. Neurocomputing 186(19):182–194
Wang L, Zhong Y, Yin Y, Zhao W, Wang B, Xu Y, Ruiz-Cortes A (2015) A hybrid backtracking search optimization algorithm with differential evolution. Math Probl Eng 2015:769245. https://doi.org/10.1155/2015/769245
Wang Z, Zeng Y-R, Wang S, Wang L (2019) Optimizing echo state network with backtracking search optimization algorithm for time series forecasting. Eng Appl Artif Intell 81:117–132
Yüzgeç U, Eser M (2018) Chaotic based differential evolution algorithm for optimization of baker’s yeast drying process. Egypt Inform J 19:151–163
Zhang X, Xu Y, Yu C, Heidari AA, Li S, Chen H, Li C (2020) Gaussian mutational chaotic fruit fly-built optimization and feature selection. Expert Syst Appl 141(1):112976
Zhao W, Wang L, Wang B, Yin Y (2016) Best guided backtracking search algorithm for numerical optimization problems. In: International conference on knowledge science, engineering and management, pp 414–425
Funding
This work is supported by the National Natural Science Foundation of China (Grant No. 51575443), and the Ph.D. Programs Foundation of Xi’an University of Technology (Grant No. 102-451115002).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This paper does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by A. Di Nola.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wei, F., Shi, Y., Li, J. et al. Multi-strategy synergy-based backtracking search optimization algorithm. Soft Comput 24, 14305–14326 (2020). https://doi.org/10.1007/s00500-020-05225-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-020-05225-8