Skip to main content

Advertisement

Springer Nature Link
Log in

Multimodal and multi-objective optimization algorithm based on two-stage search framework

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The problem that multiple Pareto solution sets correspond to the same Pareto front is called multimodal multi-objective optimization problem. Solving all Pareto solution sets in this kind of problem can provide decision makers with more convenient and accurate choices. However, the traditional multi-objective optimization algorithm often ignores the distribution of solutions in the decision space when solving such problems, resulting in poor diversity of Pareto solution sets.To solve this problem, a two-stage search algorithm framework is proposed. This framework divides the optimization process into two parts: global search and local search to balance the search ability of the algorithm. When searching globally, locate as many approximate locations with the optimal solution as possible, providing a good population distribution for subsequent local searches. In local search, DBSCAN clustering method with adaptive neighborhood radius is used to divide the population into several subpopulations, so as to enhance the local search ability with the algorithm. At the same time, an individual selection mechanism based on the farthest-candidate approach with two spaces is proposed to keep the diversity of the population in the objective space and decision space. The algorithm is compared with five state-of-the-art algorithms on 22 multimodal and multi-objective optimization test functions. The experimental results indicate that the proposed algorithm can search more Pareto solution sets while maintaining the diversity of solutions in the objective space.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.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

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
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Bader J, Zitzler E (2011) Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76

    Article  Google Scholar 

  2. Borhani M (2020) A multicriteria optimization for flight route networks in large-scale airlines using intelligent spatial information. Int J Interact Multimed Artif Intell 6(1)

  3. Chen B, Zeng W, Lin Y, Zhang D (2015) Anew local search-based multiobjective optimization algorithm. IEEE Trans Evol Comput 19(1):50–73

    Article  Google Scholar 

  4. Das A, Pradhan S N (2020) An elitist non-dominated multi-objective genetic algorithm based temperature aware circuit synthesis. Int J Interact Multimed Artif Intell 6(4)

  5. Das S, Suganthan P N (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31

    Article  Google Scholar 

  6. De Jong KA (1975) Analysis of the behavior of a class of genetic adaptive systems. Technical report

  7. Deb K, Agrawal R B (1995) Simulated binary crossover for continuous search space. Compl Syst 9(3):115–148

    MathSciNet  MATH  Google Scholar 

  8. Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part i: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601

    Article  Google Scholar 

  9. Deb K, Tiwari S (2005) Omni-optimizer: a procedure for single and multi-objective optimization. In: International Conference on Evolutionary Multi-Criterion Optimization, Springer, pp 47–61

  10. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: Nsga–ii. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  11. Fan Q, Yan X (2019) Solving multimodal multiobjective problems through zoning search. IEEE Trans Syst Man Cybern Syst:1–12

  12. Goldberg D E, Holland J H H (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95–99

    Article  Google Scholar 

  13. Gong D, Xu B, Zhang Y, Guo Y, Yang S (2020) A similarity-based cooperative co-evolutionary algorithm for dynamic interval multiobjective optimization problems. IEEE Trans Evol Comput 24 (1):142–156

    Article  Google Scholar 

  14. Haghbayan P, Nezamabadi-pour H, Kamyab S (2017) A niche gsa method with nearest neighbor scheme for multimodal optimization. Swarm Evol Comput 35:78–92

    Article  Google Scholar 

  15. Han Y, Gong D, Jin Y, Pan Q (2019) Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE Trans Cybern 49(1):184–197

    Article  Google Scholar 

  16. Hu C, Ishibuchi H (2018) Incorporation of a decision space diversity maintenance mechanism into moea/d for multi-modal multi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion

  17. Hu Y, Wang J, Liang J, Yu K, Song H, Guo Q, Yue C, Wang Y (2019) A self-organizing multimodal multi-objective pigeon-inspired optimization algorithm. Sci China Inf Sci 62(007):1–17

    Article  MathSciNet  Google Scholar 

  18. Hu Y, Zhang Y, Gong D (2021) Multiobjective particle swarm optimization for feature selection with fuzzy cost. IEEE Trans Cybern 51(2):874–888

    Article  Google Scholar 

  19. Ishibuchi H, Akedo N, Nojima Y (2011) A many-objective test problem for visually examining diversity maintenance behavior in a decision space. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, p 649–656

  20. Jaszkiewicz A (2002) On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-a comparative experiment. IEEE Trans Evol Comput 6(4):402–412

    Article  Google Scholar 

  21. Kim M, Hiroyasu T, Miki M, Watanabe S (2004) Spea2+: Improving the performance of the strength pareto evolutionary algorithm 2. In: International Conference on Parallel Problem Solving from Nature, Springer, pp 742–751

  22. Kramer O, Danielsiek H (2010) Dbscan-based multi-objective niching to approximate equivalent pareto-subsets. In: Proceedings of the 12th annual conference on Genetic and evolutionary computation, pp 503–510

  23. Li M, Dan L, Kou J (2012) A hybrid niching pso enhanced with recombination-replacement crowding strategy for multimodal function optimization. Appl Soft Comput 12(3):975–987

    Article  Google Scholar 

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

    Article  Google Scholar 

  25. Li Z, Shi L, Yue C, Shang Z, Qu B (2019) Differential evolution based on reinforcement learning with fitness ranking for solving multimodal multiobjective problems. Swarm Evol Comput 49:234–244

    Article  Google Scholar 

  26. Liang J, Yue C, Qu B (2016) Multimodal multi-objective optimization: a preliminary study. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 2454–2461

  27. Liang J, Suganthan P N, Qu B, Gong D, Yue C (2019a) Problem definitions and evaluation criteria for the cec 2019 Special session on multimodal multiobjective optimization. Technical report, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou

  28. Liang J, Xu W, Yue C, Yu K, Song H, Crisalle OD, Qu B (2019b) Multimodal multiobjective optimization with differential evolution. Swarm Evol Comput 44:1028–1059

  29. Liang J, Qiao K, Yue C, Yu K, Qu B, Xu R, Li Z, Hu Y (2021) A clustering-based differential evolution algorithm for solving multimodal multi-objective optimization problems. Swarm Evol Comput 60:100788

    Article  Google Scholar 

  30. Lin C, Wu W (2002) Niche identification techniques in multimodal genetic search with sharing scheme. Adv Eng Softw 33(11):779–791

    Article  Google Scholar 

  31. Lin Q, Lin W, Zhu Z, Gong M (2020) Multimodal multiobjective evolutionary optimization with dual clustering in decision and objective spaces. IEEE Trans Evol Comput PP(99):1–1

  32. Ling Q, Wu G, Yang Z, Wang Q (2008) Crowding clustering genetic algorithm for multimodal function optimization. Appl Soft Comput 8(1):88–95

    Article  Google Scholar 

  33. Liu Y, Ishibuchi H, Nojima Y, Masuyama N, Shang K (2018a) A double-niched evolutionary algorithm and its behavior on polygon-based problems. In: International Conference on Parallel Problem Solving from Nature, Springer, pp 262–273

  34. Liu Y, Yen G, Gong D (2018b) A multi-modal multi-objective evolutionary algorithm using two-archive and recombination strategies. IEEE Trans Evol Comput 23(4):660–674

  35. Maree SC, Alderliesten T, Thierens D, Bosman PAN (2018) Real-valued evolutionary multi-modal optimization driven by hill-valley clustering. In: Proceedings of the Genetic and Evolutionary Computation Conference on, pp 857–864

  36. Marler R, Arora J (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26(6):369– 395

    Article  MathSciNet  Google Scholar 

  37. Oliveto P S, Sudholt D, Zarges C (2019) On the benefits and risks of using fitness sharing for multimodal optimisation. Theor Comput Sci 773:53–70

    Article  MathSciNet  Google Scholar 

  38. Pamulapati T, Mallipeddi R, Suganthan PN (2019) isde +—an indicator for multi and many-objective optimization. IEEE Trans Evol Comput 23(2):346–352

  39. Parrott D, Li X (2006) Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput 10(4):440–458

    Article  Google Scholar 

  40. di Pierro F, Khu S T, Savic D A (2007) An investigation on preference order ranking scheme for multiobjective evolutionary optimization. IEEE Trans Evol Comput 11(1):17–45

    Article  Google Scholar 

  41. Preuss M (2015) Niching methods and multimodal optimization performance. In: Multimodal Optimization by Means of Evolutionary Algorithms. Springer, pp 115–137

  42. Qu B, Li C, Liang J, Yan L, Zhu Y (2020) A self-organized speciation based multi-objective particle swarm optimizer for multimodal multi-objective problems. Appl Soft Comput 86:105886

    Article  Google Scholar 

  43. Tanabe R, Ishibuchi H (2018) A decomposition-based evolutionary algorithm for multi-modal multi-objective optimization. In: International Conference on Parallel Problem Solving from Nature. Springer, pp 249–261

  44. Tanabe R, Ishibuchi H (2020a) A framework to handle multimodal multiobjective optimization in decomposition-based evolutionary algorithms. IEEE Trans Evol Comput 24(4):720–734

  45. Tanabe R, Ishibuchi H (2020b) A review of evolutionary multimodal multiobjective optimization. IEEE Trans Evol Comput 24(1):193–200

  46. Thomsen R (2004) Multimodal optimization using crowding-based differential evolution. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), vol 2. IEEE, pp 1382–1389

  47. Tian Y, Cheng R, Zhang X, Cheng F, Jin Y (2018) An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans Evol Comput 22(4):609–622

    Article  Google Scholar 

  48. Tian Y, Cheng R, Zhang X, Su Y, Jin Y (2019) A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization. IEEE Trans Evol Comput 23 (2):311–345

    Article  Google Scholar 

  49. Togelius J, Preuss M, Yannakakis GN (2010) Towards multiobjective procedural map generation. In: Proceedings of the 2010 Workshop on Procedural Content Generation in Games, pp 1–8

  50. Tsai C F, Chiang Y (2016) Enhancement of data clustering using tss-dbscan approach for data mining. In: 2016 International conference on machine learning and cybernetics (ICMLC), vol 2. IEEE, pp 535–540

  51. Wu M, Li K, Kwong S, Zhang Q, Zhang J (2019) Learning to de-compose: a paradigm for decomposition-based multiobjective optimi-zation. IEEE Trans Evol Comput 23(3):376–390

    Article  Google Scholar 

  52. Yuan Y, Xu H, Wang B, Yao X (2016) A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(1):16–37

    Article  Google Scholar 

  53. Yue C, Qu B, Liang J (2018) A multi-objective particle swarm optimizer using ring topology for solving multimodal multi-objective problems. IEEE Trans Evol Comput 22(5):805–817

    Article  Google Scholar 

  54. Zhang Q, Li H (2007) Moea/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  55. Zhang W, Li G, Zhang W, Liang J, Yen G G (2019) A cluster based pso with leader updating mechanism and ring-topology for multimodal multi-objective optimization. Swarm Evol Comput 50:100569

    Article  Google Scholar 

  56. Zhang Y, Gong D, Sun J, Qu B (2018) A decomposition-based archiving approach for multi-objective evolutionary optimization. Inf Sci 430-431:397–413

    Article  Google Scholar 

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

    Article  Google Scholar 

  58. Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. Technical Report Gloriastrasse 103

  59. Zou J, Deng Q, Zheng J, Yang S (2020) A close neighbor mobility method using particle swarm optimizer for solving multimodal optimization problems. Inf Sci 519:332–347

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the Key Technologies R & D Program of Hebei (No. 20373303D),in part by the Educational Commission of Hebei Province of China (No. ZD2019134, ZD2020344) , in part by the Startup Foundation for PhD of Hebei GEO University (No. BQ201322) and by the Key Agricultural Programs of Science and Technology and Innovation of Xiangyang under Grant (No. 2020ABAO02240).

Author information

Authors and Affiliations

  1. School of Information Engineering, Hebei GEO University, Shijiazhuang, 050031, China

    Jia-Xing Zhang, Xiao-Kai Chu, Feng Yang & Shen-Wen Wang

  2. Laboratory of Artificial Intelligence and Machine Learning, Hebei GEO University, Shijiazhuang, 050031, China

    Jia-Xing Zhang, Xiao-Kai Chu, Feng Yang & Shen-Wen Wang

  3. School of Computer Engineering, Hubei University of Arts and Science, Xiangyang, 441053, China

    Jun-Feng Qu

Authors
  1. Jia-Xing Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xiao-Kai Chu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Feng Yang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Jun-Feng Qu
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Shen-Wen Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Shen-Wen Wang.

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

Zhang, JX., Chu, XK., Yang, F. et al. Multimodal and multi-objective optimization algorithm based on two-stage search framework. Appl Intell 52, 12470–12496 (2022). https://doi.org/10.1007/s10489-021-02969-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02969-0

Keywords