Skip to main content

Best Guided Backtracking Search Algorithm for Numerical Optimization Problems

  • Conference paper
  • First Online:
Knowledge Science, Engineering and Management (KSEM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9983))

Abstract

Backtracking search algorithm is a promising stochastic search technique by using its historical information to guide the population evolution. Using historical population information improves the exploration capability, but slows the convergence, especially on the later stage of iteration. In this paper, a best guided backtracking search algorithm, termed as BGBSA, is proposed to enhance the convergence performance. BGBSA employs the historical information on the beginning stage of iteration, while using the best individual obtained so far on the later stage of iteration. Experiments are carried on the 28 benchmark functions to test BGBSA, and the results show the improvement in efficiency and effectiveness of BGBSA.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT press, Cambridge (1992)

    Google Scholar 

  2. Storn, R., Price, K.: Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. ICSI, Berkeley (1995)

    Google Scholar 

  3. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B Cybern. 26, 29–41 (1996)

    Article  Google Scholar 

  4. Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: 6th International Symposium on Micro Machine and Human Science, pp. 39–43. IEEE Press, New York (1995)

    Google Scholar 

  5. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report, Erciyes University (2005)

    Google Scholar 

  6. Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12, 702–713 (2008)

    Article  Google Scholar 

  7. Civicioglu, P.: Backtracking search optimization algorithm for numerical optimization problems. Appl. Math. Comput. 219, 8121–8144 (2013)

    MathSciNet  MATH  Google Scholar 

  8. Agarwal, S.K., Shah, S., Kumar, R.: Classification of mental tasks from eeg data using backtracking search optimization based neural classifier. Neurocomputing 166, 397–403 (2015)

    Article  Google Scholar 

  9. Yang, D.D., Ma, H.G., Xu, D.H., Zhang, B.H.: Fault measurement for siso system using the chaotic excitation. J. Franklin Inst. 352, 3267–3284 (2015)

    Article  MathSciNet  Google Scholar 

  10. Mallick, S., Kar, R., Mandal, D., Ghoshal, S.: CMOS analogue amplifier circuits optimisation using hybrid backtracking search algorithm with differential evolution. J. Exp. Theor. Artif. Intell. 28(4), 719–749 (2016)

    Article  Google Scholar 

  11. Xu, Q., Guo, L., Wang, N., Li, X.: Opposition-based backtracking search algorithm for numerical optimization problems. In: He, X., Gao, X., Zhang, Y., Zhou, Z.-H., Liu, Z.-Y., Fu, B., Hu, F., Zhang, Z. (eds.) 5th International Conference on Intelligence Science and Big Data Engineering. LNCS, vol. 9243, pp. 223–234. Springer, Switzerland (2015)

    Google Scholar 

  12. Duan, H., Luo, Q.: Adaptive backtracking search algorithm for induction magnetometer optimization. IEEE Trans. Mag. 50(12), 1–6 (2014)

    Article  Google Scholar 

  13. Askarzadeh, A., Coelho, L.D.S.: A backtracking search algorithm combined with Burger’s chaotic map for parameter estimation of PEMFC electrochemical model. Int. J. Hydrogen Energy 39, 11165–11174 (2014)

    Article  Google Scholar 

  14. Wang, L., Zhong, Y., Yin, Y., et al.: A hybrid backtracking search optimization algorithm with differential evolution. Math. Probl. Eng. 2015, 1 (2015)

    Google Scholar 

  15. Zhao, W., Wang, L., Yin, Y., Wang, B., Wei, Y., Yin, Y.: An improved backtracking search algorithm for constrained optimization problems. In: Buchmann, R., Kifor, C.V., Yu, J. (eds.) KSEM 2014. LNCS (LNAI), vol. 8793, pp. 222–233. Springer, Heidelberg (2014). doi:10.1007/978-3-319-12096-6_20

    Google Scholar 

  16. Liang, J., Qu, B., Suganthan, P., Hernndez-Daz, A.G.: Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical report, Singapore (2013)

    Google Scholar 

  17. Loshchilov, I.: CMA-ES with restarts for solving CEC 2013 benchmark problems. In: 2013 IEEE Congress on Evolutionary Computation, pp. 369–376. IEEE Press (2013)

    Google Scholar 

  18. Nepomuceno, F.V., Engelbrecht, A.P.: A self-adaptive heterogeneous PSO for real-parameter optimization. In: 2013 IEEE Congress on Evolutionary Computation, pp. 361–368. IEEE Press (2013)

    Google Scholar 

  19. Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2337–2344. IEEE Press (2013)

    Google Scholar 

  20. El-Abd, M.: Testing a particle swarm optimization and artificial bee colony hybrid algorithm on the CEC13 benchmarks. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2215–2220. IEEE Press (2013)

    Google Scholar 

  21. Coelho, L.D.S., Ayala, V.H., Freire, R.Z.: Population’s variance-based adaptive differential evolution for real parameter optimization. In: 2013 IEEE Congress on Evolutionary Computation, pp. 1672–1677. IEEE Press (2013)

    Google Scholar 

  22. Gong, W.Y., Cai, Z.H.: Differential evolution with rankingbased mutation operators. IEEE Trans. Cybern. 43, 2066–2081 (2013)

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the NSFC Joint Fund with Guangdong of China under Key Project U1201258, the National Natural Science Foundation of China under Grant No. 61573219, the Shandong Natural Science Funds for Distinguished Young Scholar under Grant No. JQ201316, the Natural Science Foundation of Fujian Province of China under Grant No. 2016J01280 and the Fostering Project of Dominant Discipline and Talent Team of Shandong Province Higher Education Institutions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yilong Yin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Zhao, W., Wang, L., Wang, B., Yin, Y. (2016). Best Guided Backtracking Search Algorithm for Numerical Optimization Problems. In: Lehner, F., Fteimi, N. (eds) Knowledge Science, Engineering and Management. KSEM 2016. Lecture Notes in Computer Science(), vol 9983. Springer, Cham. https://doi.org/10.1007/978-3-319-47650-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47650-6_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47649-0

  • Online ISBN: 978-3-319-47650-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics