Skip to main content

Firefly Algorithm with Elite Attraction

  • Conference paper
  • First Online:
Computational Intelligence and Intelligent Systems (ISICA 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 873))

Included in the following conference series:

  • 651 Accesses

Abstract

Firefly algorithm is a simple and efficient meta-heuristic optimization algorithm which has outstanding performance on many optimization problems. However, in the standard FA, the fireflies will be attracted by all the other bright fireflies, and there is a lot of attraction that does not affect, but will increase the computational time of the algorithm. In addition, all the best firefly information in the search process has not been recorded, which may lead the algorithm to be inefficient. To over these problems, this paper proposed en elite-k attraction firefly algorithm (EkFA), which can not only reduce the no effective attractions between the fireflies but also can make full use of the best firefly’s information to guide other nearby fireflies to movement. Thirteen well-known benchmark functions are used to verify the performance of our proposed method. The experimental results show that the accuracy and efficiency of the proposed algorithm are significantly better than those of other FA variants.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Bristol (2008)

    Google Scholar 

  2. SundarRajan, R., Vasudevan, V., Mithya, S.: Workflow scheduling in cloud computing environment using firefly algorithm. In: 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT), pp. 955–960 (2016)

    Google Scholar 

  3. Marichelvam, M.K., Prabaharan, T., Yang, X.S.: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans. Evol. Comput. 18, 301–305 (2014)

    Article  Google Scholar 

  4. Manshahia, M.S., Dave, M., Singh, S.B.: Firefly algorithm based clustering technique for wireless sensor networks. In: 2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), pp. 1273–1276 (2016)

    Google Scholar 

  5. Lalwani, P., Ganguli, I., Banka, H.: FARW: firefly algorithm for routing in wireless sensor networks. In: 2016 3rd International Conference on Recent Advances in Information Technology (RAIT), pp. 248–252 (2016)

    Google Scholar 

  6. Kazem, A., Sharifi, E., Hussain, F.K., Saberi, M., Hussain, O.K.: Support vector regression with chaos-based firefly algorithm for stock market price forecasting. Appl. Soft Comput. 13, 947–958 (2013)

    Article  Google Scholar 

  7. Baykasoğlu, A., Ozsoydan, F.B.: Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl. Soft Comput. 36, 152–164 (2015)

    Article  Google Scholar 

  8. Wang, H., Wang, W., Zhou, X., Sun, H., Zhao, J., Yu, X., Cui, Z.: Firefly algorithm with neighborhood attraction. Inf. Sci. 382–383, 374–387 (2016)

    Google Scholar 

  9. Yang, X.-S.: Engineering Optimization: An Introduction with Metaheuristic Applications. Wiley Publishing, Hoboken (2010)

    Book  Google Scholar 

  10. Yang, X.-S.: Firefly algorithm, lévy flights and global optimization. In: Bramer, M., Ellis, R., Petridis, M. (eds.) Research and Development in Intelligent Systems XXVI, pp. 209–218. Springer, Heidelberg (2010). https://doi.org/10.1007/978-1-84882-983-1_15

    Chapter  Google Scholar 

  11. Fister Jr., I., Yang, X.-S., Fister, I., Brest, J.: Memetic firefly algorithm for combinatorial optimization. arXiv preprint arXiv:1204.5165 (2012)

  12. Lin, Y., Wang, L., Zhong, Y., Zhang, C.: Control scaling factor of cuckoo search algorithm using learning automata. Int. J. Comput. Sci. Mathematics 7, 476–484 (2016)

    Article  MathSciNet  Google Scholar 

  13. Yu, S., Su, S., Lu, Q., Huang, L.: A novel wise step strategy for firefly algorithm. Int. J. Comput. Math. 91, 2507–2513 (2014)

    Article  MathSciNet  Google Scholar 

  14. Yu, S., Zhu, S., Ma, Y., Mao, D.: A variable step size firefly algorithm for numerical optimization. Appl. Math. Comput. 263, 214–220 (2015)

    MathSciNet  Google Scholar 

  15. Wang, H., Zhou, X., Sun, H., Yu, X., Zhao, J., Zhang, H., Cui, L.: Firefly algorithm with adaptive control parameters. Soft. Comput. 21, 5091–5102 (2016)

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank anonymous reviewers for their detailed and constructive comments that help us to increase the quality of this work. This work was supported by the National Natural Science Foundation of Jiangxi Province (No. 20151BAB207023) and Science and Technology project of Jiangxi Provincial Department of Education (No. GJJ150448).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jing Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, J. (2018). Firefly Algorithm with Elite Attraction. In: Li, K., Li, W., Chen, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2017. Communications in Computer and Information Science, vol 873. Springer, Singapore. https://doi.org/10.1007/978-981-13-1648-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-1648-7_16

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-1647-0

  • Online ISBN: 978-981-13-1648-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics