Skip to main content
Log in

Reference point reconstruction-based firefly algorithm for irregular multi-objective optimization

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Reference point-based environmental selection has achieved promising performance in multi-objective optimization problems. However, when solving the irregular multi-objective optimization problems, the performance of environmental selection is affected. This is because the irregular Pareto front is often degraded, disconnected, inverted, or with sharp tails, resulting in some reference points not located in appropriate region. This releases the selection pressure. Therefore, adjusting or generating some points is necessary to tackle this problem. However, how to identify the region of interest and how to generate new points in the appropriate region are the current problems to be solved. In this paper, a region-based reconstruction for reference points is proposed. For simplicity, the smallest region which consists of M reference points (M is the dimension of objective space) in the hyperplane of reference point is identified as the unit region. If the vertexes of the region all belong to active reference points, the region will be identified as region of interest and new reference points will be reconstructed in this region. In addition, the process is activated in the later stage of the algorithm operation, while the efficient of the search algorithm is weak. In order to find more valuable individuals in the neighborhood region of selected individuals, thereby, firefly algorithm is employed as search algorithm because of its search mechanism which has strong indicative features. Several experiments are designed to verify the performance of the proposed method. The experiment results show that the proposed method is effective.

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

Access this article

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

Similar content being viewed by others

References

  1. Cui Y, Geng Z, Zhu Q, Han Y (2017) Multi-objective optimization methods and application in energy saving. Energy 125:681–704

    Article  Google Scholar 

  2. Xiao L, Shao W, Yu M, Ma J, Jin C (2017) Research and application of a combined model based on multi-objective optimization for electrical load forecasting. Energy 119:1057–1074

    Article  Google Scholar 

  3. Zhu C, Xu L, Goodman E D (2015) Generalization of pareto-optimality for many-objective evolutionary optimization. IEEE Trans Evol Comput 20(2):299–315

    Article  Google Scholar 

  4. Farina M, Amato P (2004) A fuzzy definition of” optimality” for many-criteria optimization problems. IEEE Trans Syst Man Cybern-Part A: Syst Hum 34(3):315–326

    Article  Google Scholar 

  5. Hughes E J (2003) Multiple single objective pareto sampling. In: The 2003 Congress on Evolutionary Computation, 2003. CEC’03, vol 4. IEEE, pp 2678–2684

  6. Hughes E J (2007) MSOPS-II: A general-purpose many-objective optimiser. In: 2007 IEEE Congress on Evolutionary Computation. IEEE, pp 3944–3951

  7. 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 

  8. Wang F, Zhang H, Zhou A (2021) A particle swarm optimization algorithm for mixed-variable optimization problems. Swarm Evol Comput 60:100808

    Article  Google Scholar 

  9. Peng H, Wu Z (2015) Heterozygous differential evolution with taguchi local search. Soft Comput 19(11):3273–3291

    Article  Google Scholar 

  10. Liu J, Peng H, Wu Z, Chen J, Deng C (2020) Multi-strategy brain storm optimization algorithm with dynamic parameters adjustment. Appl Intell 50(4):1289–1315

    Article  Google Scholar 

  11. Peng H, Deng C, Wu Z (2019) Best neighbor-guided artificial bee colony algorithm for continuous optimization problems. Soft Comput 23(18):8723–8740

    Article  Google Scholar 

  12. Yang X-S (2010) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-inspired Comput 2(2):78–84

    Article  Google Scholar 

  13. Lin Q, Liu S, Zhu Q, Tang C, Song R, Chen J, Coello C A C, Wong K-C, Zhang J (2016) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evol Comput 22(1):32–46

    Article  Google Scholar 

  14. Shi Y, Xue J, Wu Y (2013) Multi-objective optimization based on brain storm optimization algorithm. Int J Swarm Intell Res (IJSIR) 4(3):1–21

    Article  Google Scholar 

  15. Lin Q, Ma Y, Chen J, Zhu Q, Coello C A C, Wong K-C, Chen F (2018) An adaptive immune-inspired multi-objective algorithm with multiple differential evolution strategies. Inf Sci 430:46– 64

    Article  MathSciNet  Google Scholar 

  16. Corne D W, Jerram N R, Knowles J D, Oates M J (2001) Pesa-ii: Region-based selection in evolutionary multiobjective optimization. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann Publishers Inc., pp 283–290

  17. Yang S, Li M, Liu X, Zheng J (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721–736

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  20. Chen H, Tian Y, Pedrycz W, Wu G, Wang R, Wang L (2019) Hyperplane assisted evolutionary algorithm for many-objective optimization problems. IEEE Transactions on Cybernetics

  21. Hua Y, Jin Y, Hao K (2018) A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts. IEEE Trans Cybern 49(7):2758–2770

    Article  Google Scholar 

  22. Cheng J, Yen G G, Zhang G (2015) A many-objective evolutionary algorithm with enhanced mating and environmental selections. IEEE Trans Evol Comput 19(4):592–605

    Article  Google Scholar 

  23. Cheng R, Jin Y, Narukawa K, Sendhoff B (2015) A multiobjective evolutionary algorithm using gaussian process-based inverse modeling. IEEE Trans Evol Comput 19(6):838–856

    Article  Google Scholar 

  24. Das I, Dennis J E (1998) Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631–657

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  26. Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary Multiobjective Optimization. Springer, pp 105– 145

  27. Olatomiwa L, Mekhilef S, Shamshirband S, Mohammadi K, Petković D, Sudheer C (2015) A support vector machine–firefly algorithm-based model for global solar radiation prediction. Sol Energy 115:632–644

    Article  Google Scholar 

  28. Liu Y, Ishibuchi H, Masuyama N, Nojima Y (2019) Adapting reference vectors and scalarizing functions by growing neural gas to handle irregular pareto fronts. IEEE Trans Evol Comput 24(3):439–453

    Google Scholar 

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

    Article  Google Scholar 

  30. Asafuddoula M, Singh H K, Ray T (2017) An enhanced decomposition-based evolutionary algorithm with adaptive reference vectors. IEEE Trans Cybern 48(8):2321–2334

    Google Scholar 

  31. Jain H, Deb K (2013) An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part ii: handling constraints and extending to an adaptive approach. IEEE Trans Evol Comput 18(4):602–622

    Article  Google Scholar 

  32. Ge H, Zhao M, Sun L, Wang Z, Tan G, Zhang Q, Chen CLP (2018) A many-objective evolutionary algorithm with two interacting processes: Cascade clustering and reference point incremental learning. IEEE Trans Evol Comput 23(4):572–586

    Article  Google Scholar 

  33. Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773–791

    Article  Google Scholar 

  34. Qi Y, Ma X, Liu F, Jiao L, Sun J, Wu J (2014) Moea/d with adaptive weight adjustment. Evol Comput 22(2):231–264

    Article  Google Scholar 

  35. Lin Y, Liu H, Jiang Q (2018) Dynamic reference vectors and biased crossover use for inverse model based evolutionary multi-objective optimization with irregular pareto fronts. Appl Intell

  36. Dhiman G, Kumar V (2019) Knrvea: A hybrid evolutionary algorithm based on knee points and reference vector adaptation strategies for many-objective optimization. Appl Intell

  37. Li E, Chen R (2020) Multi-objective decomposition optimization algorithm based on adaptive weight vector and matching strategy. Appl Intell (6)

  38. Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol 4. Citeseer, pp 1942–1948

  39. Tian Y, Cheng R, Zhang X, Jin Y (2017) Platemo: A matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73– 87

    Article  Google Scholar 

  40. Hua Y, Liu Q, Hao K, Jin Y (2021) A survey of evolutionary algorithms for multi-objective optimization problems with irregular pareto fronts. IEEE/CAA J Autom Sin 8(2):303–318

    Article  MathSciNet  Google Scholar 

  41. Xiang Y, Zhou Y, Li M, Chen Z (2016) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 21(1):131–152

    Article  Google Scholar 

  42. Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E (2006) Commbining model-based and genetics-based offspring generation for mul-tiobjective optimization using a convergence criterion. In: 2006 IEEE International Conference on Evolutionary Computation. IEEE, pp 892–899

  43. While L, Hingston P, Barone L, Huband S (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29–38

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (61763019, 62041603), the Science and Technology Foundation of Jiangxi Province (20202BABL202019) and the Fundamental Research Funds for the Central Universities (93K- 172020K21).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hu Peng.

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

He, Y., Peng, H., Deng, C. et al. Reference point reconstruction-based firefly algorithm for irregular multi-objective optimization. Appl Intell 53, 962–983 (2023). https://doi.org/10.1007/s10489-022-03561-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-03561-w

Keywords

Navigation