A novel modified BSA inspired by species evolution rule and simulated annealing principle for constrained engineering optimization problems
The backtracking search optimization algorithm (BSA) is one of the recently proposed evolutionary algorithms (EAs) for solving numerical optimization problems. In this study, a nature-inspired modified BSA (called SSBSA) is proposed and investigated to improve the exploitation and convergence performance of BSA. Inspired by the species evolution rule and the simulated annealing principle, this paper proposes two modified strategies through introducing a specified retain mechanism and an acceptance probability into BSA. In SSBSA, the specified previous individuals of historical population (oldP) and their corresponding amplitude control factors (F) are retained according to the fitness feedback for the next iteration, and a new adaptive F that could decrease as the number of iterations increases is redesigned by learning the acceptance probability. SSBSA has two main advantages: (1) The way to retain the specified previous information improves BSA’s exploitation capability. (2) This new F adaptively controls the diversity of population which makes convergence faster. Simulation experiments are carried on fourteen constrained benchmarks and engineering design problems to test the performance of SSBSA. To fully evaluate the performance of SSBSA, several comparisons between SSBSA and other well-known algorithms are implemented. The experimental results show that SSBSA improves the performance of BSA and its performance is more competitive than that of the other algorithms.
KeywordsBacktracking search optimization algorithm Evolutionary algorithms Simulated annealing Constrained optimization problems
This work was supported in part by the National Natural Science Foundation of China (No. 61663009) and the State Key Labrotary of Silicate Materials for Architectures (Wuhan University of Technology, SYSJJ2018-21).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 4.Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE international conference on evolutionary computation, 1996. IEEE, pp 312–317Google Scholar
- 10.Guney K, Durmus A, Basbug S (2014) Backtracking search optimization algorithm for synthesis of concentric circular antenna arrays. Int J Antennas Propag 2014:250841Google Scholar
- 23.Zhao W, Wang L, Yin Y, Wang B, Wei Y, Yin Y (2014) An improved backtracking search algorithm for constrained optimization problems. In: International conference on knowledge science, engineering and management. Springer, pp 222–233Google Scholar
- 24.Wang L, Zhong Y, Yin Y, Zhao W, Wang B, Xu Y (2015) A hybrid backtracking search optimization algorithm with differential evolution. Math Probl Eng 2015:769245Google Scholar
- 53.Long W, Liang X, Cai S, Jiao J, Zhang W (2017) An improved artificial bee colony with modified augmented Lagrangian for constrained optimization. Soft Comput 2017:1–22Google Scholar
- 69.Mezura-Montes E, Coello CAC (2005) Useful infeasible solutions in engineering optimization with evolutionary algorithms. In: Mexican international conference on artificial intelligence. Springer, Berlin, pp 652–662Google Scholar
- 73.Mezura-Montes E, Coello CAC, Velázquez-Reyes J (2006) Increasing successful offspring and diversity in differential evolution for engineering design. In: Proceedings of the seventh international conference on adaptive computing in design and manufacture (ACDM 2006), pp 131–139Google Scholar
- 75.Deb K, Goyal M (1997) Optimizing engineering designs using a combined genetic search. In: Proceedings of the sixth international conference in generic algorithms, pp 521–528Google Scholar
- 76.Siddall JN (1982) Optimal engineering design: principles and applications. Marcel Dekker, New YorkGoogle Scholar