Skip to main content

Advertisement

SpringerLink
Log in

An adaptive niching method based on multi-strategy fusion for multimodal optimization

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Various niching methods have been widely adopted for solving multimodal optimization. However, keeping a balance between exploitation and exploration is still a tough task for designers of multimodal optimization algorithms. An essential niching method is encouraged to deal with optimization problems. In this paper, we proposed an adaptive niching method based on multi-strategy fusion for multimodal optimization. The method changes the traditional way that populations are evaluated in meta-heuristic algorithms. First, a population-entropy based on information theory is proposed as the convergence-maintaining mechanism to track the population status in algorithms. Second, a distribution-radius based on similarity measurement is investigated as the diversity-preserving mechanism to measure the spatial distribution of the optimal solution found. Third, a utility-fitness based on utility theory is adopted to assess the quality of each individual and provide a trade-off between exploitation and exploration. Three strategies are tightly linked and form a closed loop, so that meta-heuristic algorithms equipped with the proposed approach are able to find multiple optimal solutions. The value of population-entropy, the length of distribution-radius, and the evaluation of utility-fitness interact with each other and are adaptively adjusted in each iteration. Meanwhile, our niching method is universal for meta-heuristic algorithms. To illustrate the performance of the proposed method, experiments are conducted using kinds of test functions with different dimensions. The proposed approach is hybrid with different kinds of evolutionary algorithms and swarm intelligence algorithms, including genetic algorithm, differential evolution, particle swarm optimization, brain storm optimization, and artificial bee colony algorithm. The hybrid algorithms are compared with other variants of the standard meta-heuristic algorithms. The validity of the algorithm is analyzed comprehensively. The statistical results show that the hybrid algorithms perform better than other algorithms in both peak ratio and success rate. Then, the hybrid algorithms are verified in practical scheduling problems, and the results show that the algorithms are able to effectively find multiple solutions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Beasley D, Bull DR, Martin RR (1993) A sequential niche technique for multimodal function optimization. Evol Comput 1(2):101–125

    Article  Google Scholar 

  2. Cheng S, Lu H, Song W, Chen J, Shi Y (2018) Dynamic multimodal optimization using brain storm optimization algorithms. In: International conference on bio-inspired computing: theories and applications. Springer, Singapore, pp 236–245

  3. Cheng S, Chen J, Lei X, Shi Y (2018) Locating multiple optima via brain storm optimization algorithms. IEEE Access 6:17039–17049

    Article  Google Scholar 

  4. Chica M, Barranquero J, Kajdanowicz T, Damas S, Cordón Ó (2017) Multimodal optimization: an effective framework for model calibration. Inf Sci 375:79–97

    Article  Google Scholar 

  5. Cipra T (2010) Utility theory. In: Financial and insurance formulas. Physica, Heidelberg, pp 91–93

  6. Deb K, Saha A (2012) Multimodal optimization using a bi-objective evolutionary algorithm. Evol Comput 20(1):27–62

    Article  Google Scholar 

  7. Della Cioppa A, De Stefano C, Marcelli A (2007) Where are the niches? Dynamic fitness sharing. IEEE Trans Evol Comput 11(4):453–465

    Article  Google Scholar 

  8. Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks. pp 1942–1948

  9. Gan J, Warwick K (2001) Dynamic niche clustering: a fuzzy variable radius niching technique for multimodal optimisation in GAs. In: Proceedings of the 2001 congress on evolutionary computation. IEEE, Seoul, pp 215–222

  10. Gao W, Yen GG, Liu S (2014) A cluster-based differential evolution with self-adaptive strategy for multimodal optimization. IEEE Trans Cybern 44(8):1314–1327

    Article  Google Scholar 

  11. Li X (2009) Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput 14(1):150–169

    Google Scholar 

  12. Li X, Engelbrecht A, Epitropakis MG (2013) Benchmark functions for CEC’2013 special session and competition on niching methods for multimodal function optimization. RMIT University, Evolutionary Computation and Machine Learning Group, Australia, Tech, Rep

  13. Li X, Epitropakis MG, Deb K, Engelbrecht A (2016) Seeking multiple solutions: an updated survey on niching methods and their applications. IEEE Trans Evol Comput 21(4):518–538

    Article  Google Scholar 

  14. Li Y, Chen Y, Zhong J, Huang Z (2019) Niching particle swarm optimization with equilibrium factor for multi-modal optimization. Inf Sci 494:233–246

    Article  MathSciNet  Google Scholar 

  15. Lu H, Shi J, Zong F, Zhou Q, Mao K (2018) Analysis of the similarities and differences of job-based scheduling problems. Eur J Oper Res 270(3):809–825

    Article  MathSciNet  Google Scholar 

  16. Luh GC, Lin CY (2011) Optimal design of truss-structures using particle swarm optimization. Comput Struct 89(23–24):2221–2232

    Article  Google Scholar 

  17. Ma L, Cheng S, Shi Y (2020) Enhancing learning efficiency of brain storm optimization via orthogonal learning design. IEEE Trans Syst Man Cybern Syst. https://doi.org/10.1109/TSMC.2020.2963943

    Article  Google Scholar 

  18. Maier HR, Razavi S, Kapelan Z, Matott LS, Kasprzyk J, Tolson BA (2019) Introductory overview: optimization using evolutionary algorithms and other metaheuristics. Environ Model Softw 114:195–213

    Article  Google Scholar 

  19. Mwaura J, Engelbrecht AP, Nepocumeno FV, (2016) Performance measures for niching algorithms. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, Vancouver, pp 4775–4784

  20. Peng X, Jin Y, Wang H (2018) Multimodal optimization enhanced cooperative coevolution for large-scale optimization. IEEE Trans Cybern 49(9):3507–3520

    Article  Google Scholar 

  21. Qu BY, Suganthan PN, Das S (2012) A distance-based locally informed particle swarm model for multimodal optimization. IEEE Trans Evol Comput 17(3):387–402

    Article  Google Scholar 

  22. Sareni B, Krahenbuhl L (1998) Fitness sharing and niching methods revisited. IEEE Trans Evol Comput 2(3):97–106

    Article  Google Scholar 

  23. Shi Y (2011) Brain storm optimization algorithm. In: International conference in swarm intelligence. Springer, Berlin pp 303–309

  24. Singh G, Deb K (2006) Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, Seattle, pp 1305–1312

  25. Wang Y, Li HX, Yen GG, Song W (2014) MOMMOP: Multiobjective optimization for locating multiple optimal solutions of multimodal optimization problems. IEEE Trans Cybern 45(4):830–843

    Article  Google Scholar 

  26. Xia R, Xiao M, Cheng J (2007) Parallel TPS design and application based on software architecture. Components and patterns, 2007 IEEE Autotestcon, pp 234–240

  27. Yu X, Gen M (2010) Multimodal optimization. In: Introduction to evolutionary algorithms. Springer, London, pp 165–191

  28. Zhang YH, Gong YJ, Yuan HQ, Zhang J (2019) A tree-structured random walking swarm optimizer for multimodal optimization. Appl Soft Comput 78:94–108

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported in part by the National Natural Science Foundation of China under Grant Nos. 61671041, 61827901, 61806119, and 61101153.

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, Beihang University, Beijing, 100191, People’s Republic of China

    Hui Lu & Shengjie Sun

  2. School of Computer Science, Shaanxi Normal University, Xi’an, 710119, People’s Republic of China

    Shi Cheng

  3. Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, People’s Republic of China

    Yuhui Shi

Authors
  1. Hui Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shengjie Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shi Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yuhui Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shi Cheng.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, H., Sun, S., Cheng, S. et al. An adaptive niching method based on multi-strategy fusion for multimodal optimization. Memetic Comp. 13, 341–357 (2021). https://doi.org/10.1007/s12293-021-00338-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-021-00338-5

Keywords

Search

Navigation