Cross Elitist Learning Multifactorial Evolutionary Algorithm

  • Conference paper
  • First Online:
Neural Computing for Advanced Applications (NCAA 2022)

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

Included in the following conference series:

  • 693 Accesses

Abstract

Multifactorial Evolutionary Algorithm (MFEA) is a popular optimization algorithm in recent years. It has implicit parallelism and can solve different problems at the same time in the same search space. However, premature convergence is a significant shortcoming of MFEA. The main reason for this phenomenon is the lack of population diversity and the inability to migrate effectively between tasks. To address this shortcoming, this paper proposes a cross elitist learning multifactorial evolutionary algorithm (CEL-MFEA). Firstly, the cross elitist strategy guides the individuals to learn from the elite individual, which can improve the convergence of the proposed CEL-MFEA. Secondly, the Nelder-Mead algorithm is used to provide an effective knowledge transfer between different tasks. Finally, the opposition learning mechanism is employed to ensure population diversity. The comprehensive ability of the proposed CEL-MFEA is evaluated by 9 classical multifactorial optimization problem test sets. Experimental results show that the CEL-MFEA is more competitive than MFEA algorithm and several popular multifactorial optimization algorithms.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
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 ship** 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. Back, T., Hammel, U., Schwefel, H.P.: Evolutionary computation: comments on the history and current state. IEEE Trans. Evol. Comput. 1(1), 3–17 (1997)

    Article  Google Scholar 

  2. Zhu, Y., Tang, X.: Overview of swarm intelligence. In: 2010 International Conference on Computer Application and System Modeling (ICCASM 2010), vol. 9, pp. V9–400-V9–403. IEEE(2010)

    Google Scholar 

  3. Tan, K.C., Chew, Y.H., Lee, L.H.: A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 34(1), 115–151 (2006)

    Article  MathSciNet  Google Scholar 

  4. Guo, S.M., Yang, C.C.: Enhancing differential evolution utilizing eigenvector-based crossover operator. IEEE Trans. Evol. Comput. 19(1), 31–49 (2014)

    Google Scholar 

  5. Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445–460 (2014)

    Article  Google Scholar 

  6. Gupta, A., Ong, Y.S., Feng, L.: Multifactorial evolution: toward evolutionary multitasking. IEEE Trans. Evol. Comput. 20(3), 343–357 (2015)

    Article  Google Scholar 

  7. Yi, J., Bai, J., He, H., et al.: A multifactorial evolutionary algorithm for multitasking under interval uncertainties. IEEE Trans. Evol. Comput. 24(5), 908–922 (2020)

    Article  Google Scholar 

  8. Gong, D., Geng, N., Zhang, Y.: Robot path planning in environment of many terrains. Control Decis. 27(5), 708–712 (2012)

    MathSciNet  Google Scholar 

  9. Binh, H.T.T., Thanh, P.D., Trung, T.B.: Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2018)

    Google Scholar 

  10. Yin, J., Zhu, A., Zhu, Z., et al.: Multifactorial evolutionary algorithm enhanced with cross-task search direction. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 2244–2251. IEEE (2019)

    Google Scholar 

  11. Bali, K.K., Gupta, A., Feng, L., et al.: Linearized domain adaptation in evolutionary multitasking. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1295–1302. IEEE (2017)

    Google Scholar 

  12. Feng, L., Zhou, W., Zhou, L., et al.: An empirical study of multifactorial PSO and multifactorial DE. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 921–928. IEEE (2017)

    Google Scholar 

  13. Da, B., Ong, Y.S., Feng, L., et al.: Evolutionary multitasking for single-objective continuous optimization: Benchmark problems, performance metric, and baseline results. ar**v preprint ar**v:1706.03470 (2017)

    Google Scholar 

  14. Zhou, L., Feng, L., Tan, K.C., et al.: Toward adaptive knowledge transfer in multifactorial evolutionary computation. IEEE Trans. Cybern. 51(5), 2563–2576 (2020)

    Article  Google Scholar 

  15. Tang, Z., Gong, M., Wu, Y., et al.: A multifactorial optimization framework based on adaptive intertask coordinate system. IEEE Trans. Cybern. (2021)

    Google Scholar 

  16. Lagarias, J.C., Reeds, J.A., Wright, M.H., et al.: Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM J. Optim. 9(1), 112–147 (1998)

    Article  MathSciNet  Google Scholar 

  17. Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC 2006), vol. 1, pp. 695–701(2005)

    Google Scholar 

  18. Piotrowski, A.P.: Adaptive memetic differential evolution with global and local neighborhood-based mutation operators. Inf. Sci. 241, 164–194 (2013)

    Article  Google Scholar 

Download references

Acknowledgments

This research is partly supported by the National Natural Science Foundation of China under Project Code (62176146, 61773314).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, W., Luo, H., Wang, L. (2022). Cross Elitist Learning Multifactorial Evolutionary Algorithm. In: Zhang, H., et al. Neural Computing for Advanced Applications. NCAA 2022. Communications in Computer and Information Science, vol 1637. Springer, Singapore. https://doi.org/10.1007/978-981-19-6142-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-6142-7_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-6141-0

  • Online ISBN: 978-981-19-6142-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation