A novel modified BSA inspired by species evolution rule and simulated annealing principle for constrained engineering optimization problems

  • Hailong Wang
  • Zhongbo HuEmail author
  • Yuqiu Sun
  • Qinghua Su
  • Xuewen Xia
Original Article


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.


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


  1. 1.
    Bäck T, Schwefel HP (1993) An overview of evolutionary algorithms for parameter optimization. Evol Comput 1(1):1–23CrossRefGoogle Scholar
  2. 2.
    Elsayed SM, Sarker RA, Essam DL (2013) Adaptive configuration of evolutionary algorithms for constrained optimization. Appl Math Comput 222:680–711MathSciNetzbMATHGoogle Scholar
  3. 3.
    Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann ArborzbMATHGoogle Scholar
  4. 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
  5. 5.
    Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Hu Z, Su Q, Yang X, Xiong Z (2016) Not guaranteeing convergence of differential evolution on a class of multimodal functions. Appl Soft Comput 41:479–487CrossRefGoogle Scholar
  7. 7.
    Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713CrossRefGoogle Scholar
  8. 8.
    Zhang H, Cao X, Ho JK, Chow TW (2017) Object-level video advertising: an optimization framework. IEEE Trans Ind Inf 13(2):520–531CrossRefGoogle Scholar
  9. 9.
    Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144MathSciNetzbMATHGoogle Scholar
  10. 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
  11. 11.
    Das S, Mandal D, Kar R, Prasad Ghoshal S (2015) A new hybridized backtracking search optimization algorithm with differential evolution for sidelobe suppression of uniformly excited concentric circular antenna arrays. Int J RF Microw Comput Aided Eng 25(3):262–268CrossRefGoogle Scholar
  12. 12.
    El-Fergany A (2015) Optimal allocation of multi-type distributed generators using backtracking search optimization algorithm. Int J Electr Power Energy Syst 64:1197–1205CrossRefGoogle Scholar
  13. 13.
    Modiri-Delshad M, Rahim NA (2016) Multi-objective backtracking search algorithm for economic emission dispatch problem. Appl Soft Comput 40:479–494CrossRefGoogle Scholar
  14. 14.
    Madasu SD, Kumar MS, Singh AK (2017) Comparable investigation of backtracking search algorithm in automatic generation control for two area reheat interconnected thermal power system. Appl Soft Comput 55:197–210CrossRefGoogle Scholar
  15. 15.
    Islam NN, Hannan MA, Shareef H, Mohamed A (2017) An application of backtracking search algorithm in designing power system stabilizers for large multi-machine system. Neurocomputing 237:175–184CrossRefGoogle Scholar
  16. 16.
    Ali JA, Hannan MA, Mohamed A, Abdolrasol MG (2016) Fuzzy logic speed controller optimization approach for induction motor drive using backtracking search algorithm. Measurement 78:49–62CrossRefGoogle Scholar
  17. 17.
    Hannan MA, Ali JA, Mohamed A, Uddin MN (2017) A random forest regression based space vector PWM inverter controller for the induction motor drive. IEEE Trans Ind Electron 64(4):2689–2699CrossRefGoogle Scholar
  18. 18.
    Agarwal SK, Shah S, Kumar R (2015) Classification of mental tasks from EEG data using backtracking search optimization based neural classifier. Neurocomputing 166:397–403CrossRefGoogle Scholar
  19. 19.
    Zhang L, Zhang D (2016) Evolutionary cost-sensitive extreme learning machine. IEEE Trans Neural Netw Learn Syst 28(12):3045–3060MathSciNetCrossRefGoogle Scholar
  20. 20.
    Lu C, Gao L, Li X, Chen P (2016) Energy-efficient multi-pass turning operation using multiobjective backtracking search algorithm. J Clean Prod 137:1516–1531CrossRefGoogle Scholar
  21. 21.
    Akhtar M, Hannan MA, Begum RA, Basri H, Scavino E (2017) Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization. Waste Manag (Oxf) 61:117–128CrossRefGoogle Scholar
  22. 22.
    Ahmed MS, Mohamed A, Khatib T, Shareef H, Homod RZ, Ali JA (2017) Real time optimal schedule controller for home energy management system using new binary backtracking search algorithm. Energy Build 138:215–227CrossRefGoogle Scholar
  23. 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. 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
  25. 25.
    Chen D, Zou F, Lu R, Wang P (2017) Learning backtracking search optimisation algorithm and its application. Inf Sci 376:71–94CrossRefGoogle Scholar
  26. 26.
    Lin Q, Gao L, Li X, Zhang C (2015) A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput Ind Eng 85:437–446CrossRefGoogle Scholar
  27. 27.
    Wang S, Da X, Li M, Han T (2016) Adaptive backtracking search optimization algorithm with pattern search for numerical optimization. J Syst Eng Electron 27(2):395–406CrossRefGoogle Scholar
  28. 28.
    Su Z, Wang H, Yao P (2016) A hybrid backtracking search optimization algorithm for nonlinear optimal control problems with complex dynamic constraints. Neurocomputing 186:182–194CrossRefGoogle Scholar
  29. 29.
    Askarzadeh A, dos Santos Coelho L (2014) A backtracking search algorithm combined with Burger’s chaotic map for parameter estimation of PEMFC electrochemical model. Int J Hydrogen Energy 39(21):11165–11174CrossRefGoogle Scholar
  30. 30.
    Yuan X, Ji B, Yuan Y, Ikram RM, Zhang X, Huang Y (2015) An efficient chaos embedded hybrid approach for hydro-thermal unit commitment problem. Energy Convers Manag 91:225–237CrossRefGoogle Scholar
  31. 31.
    Lin J (2015) Oppositional backtracking search optimization algorithm for parameter identification of hyperchaotic systems. Nonlinear Dyn 80(1–2):209–219MathSciNetCrossRefGoogle Scholar
  32. 32.
    Duan H, Luo Q (2014) Adaptive backtracking search algorithm for induction magnetometer optimization. IEEE Trans Magn 50(12):1–6CrossRefGoogle Scholar
  33. 33.
    Nama S, Saha AK, Ghosh S (2017) Improved backtracking search algorithm for pseudo dynamic active earth pressure on retaining wall supporting c-\(\Phi\) backfill. Appl Soft Comput 52:885–897CrossRefGoogle Scholar
  34. 34.
    Eiben AE, Smith J (2015) From evolutionary computation to the evolution of things. Nature 521(7553):476–482CrossRefGoogle Scholar
  35. 35.
    Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680MathSciNetzbMATHCrossRefGoogle Scholar
  36. 36.
    Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132MathSciNetzbMATHGoogle Scholar
  37. 37.
    Zhang C, Lin Q, Gao L, Li X (2015) Backtracking search algorithm with three constraint handling methods for constrained optimization problems. Expert Syst Appl 42(21):7831–7845CrossRefGoogle Scholar
  38. 38.
    Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612CrossRefGoogle Scholar
  39. 39.
    Homaifar A, Qi CX, Lai SH (1994) Constrained optimization via genetic algorithms. Simulation 62(4):242–253CrossRefGoogle Scholar
  40. 40.
    Fogel DB (1995) A comparison of evolutionary programming and genetic algorithms on selected constrained optimization problems. Simulation 64(6):397–404CrossRefGoogle Scholar
  41. 41.
    Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36):3902–3933zbMATHCrossRefGoogle Scholar
  42. 42.
    Amirjanov A (2006) The development of a changing range genetic algorithm. Comput Methods Appl Mech Eng 195(19):2495–2508MathSciNetzbMATHCrossRefGoogle Scholar
  43. 43.
    Becerra RL, Coello CAC (2006) Cultured differential evolution for constrained optimization. Comput Methods Appl Mech Eng 195(33):4303–4322MathSciNetzbMATHCrossRefGoogle Scholar
  44. 44.
    Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput 9(1):1–17zbMATHCrossRefGoogle Scholar
  45. 45.
    Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640CrossRefGoogle Scholar
  46. 46.
    Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294CrossRefGoogle Scholar
  47. 47.
    Wang L, Li LP (2010) An effective differential evolution with level comparison for constrained engineering design. Struct Multidiscip Optim 41(6):947–963CrossRefGoogle Scholar
  48. 48.
    Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074CrossRefGoogle Scholar
  49. 49.
    Wang Y, Cai Z, Zhou Y, Fan Z (2009) Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct Multidiscip Optim 37(4):395–413CrossRefGoogle Scholar
  50. 50.
    Long W, Liang X, Huang Y, Chen Y (2014) An effective hybrid cuckoo search algorithm for constrained global optimization. Neural Comput Appl 25(3–4):911–926CrossRefGoogle Scholar
  51. 51.
    Li X, Yin M (2014) Self-adaptive constrained artificial bee colony for constrained numerical optimization. Neural Comput Appl 24(3–4):723–734CrossRefGoogle Scholar
  52. 52.
    Brajevic I (2015) Crossover-based artificial bee colony algorithm for constrained optimization problems. Neural Comput Appl 26(7):1587–1601CrossRefGoogle Scholar
  53. 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
  54. 54.
    Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2):311–338zbMATHCrossRefGoogle Scholar
  55. 55.
    Chootinan P, Chen A (2006) Constraint handling in genetic algorithms using a gradient-based repair method. Comput Oper Res 33(8):2263–2281zbMATHCrossRefGoogle Scholar
  56. 56.
    Coello CAC, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36(2):219–236CrossRefGoogle Scholar
  57. 57.
    He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MathSciNetzbMATHGoogle Scholar
  58. 58.
    Zahara E, Kao YT (2009) Hybrid Nelder–Mead simplex search and particle swarm optimization for constrained engineering design problems. Expert Syst Appl 36(2):3880–3886CrossRefGoogle Scholar
  59. 59.
    Tang KZ, Sun TK, Yang JY (2011) An improved genetic algorithm based on a novel selection strategy for nonlinear programming problems. Comput Chem Eng 35(4):615–621CrossRefGoogle Scholar
  60. 60.
    Krohling RA, dos Santos Coelho L (2006) Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems. IEEE Trans Syst Man Cybern Part B (Cybern) 36(6):1407–1416CrossRefGoogle Scholar
  61. 61.
    Huang FZ, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356MathSciNetzbMATHGoogle Scholar
  62. 62.
    Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315CrossRefGoogle Scholar
  63. 63.
    Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12CrossRefGoogle Scholar
  64. 64.
    Ray T, Liew KM (2003) Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans Evol Comput 7(4):386–396CrossRefGoogle Scholar
  65. 65.
    Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127CrossRefGoogle Scholar
  66. 66.
    Coello CAC, Montes EM (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16(3):193–203CrossRefGoogle Scholar
  67. 67.
    He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99MathSciNetCrossRefGoogle Scholar
  68. 68.
    dos Santos Coelho L (2010) Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems. Expert Syst Appl 37(2):1676–1683CrossRefGoogle Scholar
  69. 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
  70. 70.
    Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23(4):1001–1014CrossRefGoogle Scholar
  71. 71.
    Yuan Q, Qian F (2010) A hybrid genetic algorithm for twice continuously differentiable NLP problems. Comput Chem Eng 34(1):36–41CrossRefGoogle Scholar
  72. 72.
    Coello CAC (2000) Constraint-handling using an evolutionary multiobjective optimization technique. Civ Eng Syst 17(4):319–346CrossRefGoogle Scholar
  73. 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
  74. 74.
    Coello CAC (2000) Treating constraints as objectives for single-objective evolutionary optimization. Eng Optim 32(3):275–308CrossRefGoogle Scholar
  75. 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. 76.
    Siddall JN (1982) Optimal engineering design: principles and applications. Marcel Dekker, New YorkGoogle Scholar

Copyright information

© The Natural Computing Applications Forum 2018

Authors and Affiliations

  • Hailong Wang
    • 1
  • Zhongbo Hu
    • 1
    Email author
  • Yuqiu Sun
    • 1
  • Qinghua Su
    • 1
  • Xuewen Xia
    • 2
  1. 1.School of Information and MathematicsYangtze UniversityJingzhouChina
  2. 2.School of SoftwareEast China Jiao tong UniversityNanchangChina

Personalised recommendations