[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Success-History Based Position Adaptation in Co-operation of Biology Related Algorithms

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11655))

Included in the following conference series:

Abstract

Previously, a meta-heuristic approach called Co-Operation of Biology Related Algorithms or COBRA based on a fuzzy logic controller for solving real-parameter optimization problems was introduced and described. COBRA’s basic idea consists in a cooperative work of well-known bio-inspired algorithms with similar schemes, while the fuzzy logic controller determines which bio-inspired algorithms should be included in the co-operative work at a given moment for solving optimization problems using the COBRA approach. COBRA’s performance has been evaluated on a set of test functions and its workability demonstrated. However, COBRA’s search efficiency depends significantly on its ability to keep the balance between exploration and exploitation when solving complex multimodal problems. In this study, a new technique for generating potential solutions in biology-inspired algorithms is proposed. This technique uses a historical memory of successful positions found by individuals to guide them in different directions and thus to improve the exploration and exploitation abilities. The proposed method was applied to the components of the COBRA approach. The modified meta-heuristic as well as its original variant and components (with and without the proposed modification), were evaluated on a set of various well-known test functions. The obtained experimental results are presented and compared. It was established that the fuzzy-controlled COBRA with success-history based position adaptation allows better solutions with the same computational effort to be found. Thus, the usefulness of the proposed position adaptation technique was demonstrated.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 51.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 64.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

References

  1. Akhmedova, S., Semenkin, E.: Co-operation of biology related algorithms. In: IEEE Congress on Evolutionary Computation, pp. 2207–2214 (2013)

    Google Scholar 

  2. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, IV, pp. 1942‒1948 (1995)

    Google Scholar 

  3. Yang, Ch., Tu, X., Chen, J.: Algorithm of marriage in Honey Bees Optimization based on the Wolf Pack Search. In: International Conference on Intelligent Pervasive Computing, pp. 462‒467 (2007)

    Google Scholar 

  4. Yang, X.S.: Firefly algorithms for multimodal optimization. In: 5th Symposium on Stochastic Algorithms, Foundations and Applications, pp. 169‒178 (2009)

    Google Scholar 

  5. Yang, X.S., Deb, S.: Cuckoo search via Levy flights. In: World Congress on Nature & Biologically Inspired Computing, pp. 210‒214. IEEE Publications (2009)

    Google Scholar 

  6. Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010. SCI, vol. 284, pp. 65–74. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12538-6_6

    Chapter  Google Scholar 

  7. Bastos, F.C., Lima, N.F.: Fish school search: an overview. In: Chiong, R. (ed.) Nature-Inspired Algorithms for Optimisation. SCI, vol. 193, pp. 261–277. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00267-0_9

    Chapter  Google Scholar 

  8. Akhmedova, S., Semenkin, E., Stanovov, V., Vishnevskaya, S.: Fuzzy logic controller design for tuning the cooperation of biology-inspired algorithms. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds.) ICSI 2017. LNCS, vol. 10386, pp. 269–276. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61833-3_28

    Chapter  Google Scholar 

  9. Akhmedova, S., Semenkin, E., Stanovov, V.: Semi-supervised SVM with fuzzy controlled cooperation of biology related algorithms. In: 14th International Conference on Informatics in Control, Automation and Robotics, vol. 1, pp. 64‒71 (2017)

    Google Scholar 

  10. Črepinšek, M., Liu, S., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. 45(3) (2013). Article no. 35

    Article  Google Scholar 

  11. Zaharie, D.: Critical values for control parameters of differential evolution algorithm. In: The 8th International Mendel Conference on Soft Computing, pp. 62–67 (2002)

    Google Scholar 

  12. Kumar, A., Misra, R., Singh, D.: Improving the local search capability of effective butterfly optimizer using covariance matrix adapted retreat phase. In: IEEE Congress on Evolutionary Computation, pp. 1835–1842 (2017)

    Google Scholar 

  13. Zhang, J., Sanderson, A.: JADE: adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 13(5), 945–958 (2009)

    Article  Google Scholar 

  14. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3, 257–271 (1999)

    Article  Google Scholar 

  15. Liang, J.J., Qu, B. Y., Suganthan P.N., Hernandez-Diaz, A.G.: Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical report, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China, and Nanyang Technological University, Singapore (2012)

    Google Scholar 

  16. Akhmedova, S., Stanovov, V., Erokhin, D., Semenkin, E.: Position adaptation of candidate solutions based on their success history in nature-inspired algorithms. Int. J. Inf. Technol. Secur. 11(1), 21–32 (2019)

    Google Scholar 

  17. Mirjalili, S.: SCA: a Sine Cosine Algorithm for solving optimization problems. Knowl. Based Syst. 96, 120–133 (2016)

    Article  Google Scholar 

  18. Nenavath, H., Jatoth, R.K., Das, S.: A synergy of the sine-cosine algorithm and particle swarm optimizer for improved global optimization and object tracking. Swarm Evol. Comput. 43, 1–30 (2017)

    Article  Google Scholar 

Download references

Acknowledgments

Research is performed with the support of the Ministry of Education and Science of the Russian Federation within State Assignment project № 2.1680.2017/ПЧ.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shakhnaz Akhmedova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Akhmedova, S., Stanovov, V., Semenkin, E. (2019). Success-History Based Position Adaptation in Co-operation of Biology Related Algorithms. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2019. Lecture Notes in Computer Science(), vol 11655. Springer, Cham. https://doi.org/10.1007/978-3-030-26369-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26369-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26368-3

  • Online ISBN: 978-3-030-26369-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics