Skip to main content
Log in

A Multi-objective optimization algorithm based on dynamic user-preference information

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

Abstract

In real life, some complex problems are multi-objective optimization problems. Most of the existing studies have focused on how to obtain the optimal solutions distributed on the whole Pareto-optimal frontier. However, in some fields such as industrial production, the decision-makers of enterprises usually care about what specific measures can maximize the comprehensive benefits of enterprises. Due to this kind of realistic demands, we prefer to find a small part of the optimal solutions according to the preference information suggested by the decision-makers rather than obtain all of the Pareto-optimal solutions. However, almost all of the existing methods only repeat calculation when they meet the scenario where the user-preferences change over time. To address the multi-objective optimization problem under the scenario with dynamic user-preferences information, we propose a MOEA/D-DPRE (multi-objective optimization algorithm based on dynamic preference information) algorithm in this paper, and its framework is inspired by the MOEA/D-PRE (decomposition user-preference multi-objective evolutionary) algorithm. We analyze the four position relations between the distribution region of the old preference weight vectors (old preference region), and we also present the distribution region of the new preference weight vectors (new preference region) and propose the different strategy to the different case respectively. When the preference information changes, the MOEA/D-DPRE can converge to the region of new interest by responding to the change of preference and the historical information. Experimental results show that the proposed method is better than the compared method in convergence speed and distribution under the scenario with dynamic user-preferences information.

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

References

  1. Bandaru S, Ng AH, Deb K (2017) Data mining methods for knowledge discovery in multi-objective optimization: Part a-survey. Exp Syst Appl 70:139–159

    Article  Google Scholar 

  2. Cvetkovic D, Parmee IC (2002) Preferences and their application in evolutionary multiobjective optimization. IEEE Trans Evolutionary Comput 6(1):42–57

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Deb K, Sundar J (2006) Reference point based multi-objective optimization using evolutionary algorithms. In: In Proceedings of the 8th annual conference on Genetic and evolutionary computation, pp 635–642

  5. Filatovas E, Kurasova O, Sindhya K (2015) Synchronous r-nsga-ii: an extended preference-based evolutionary algorithm for multi-objective optimization. Informatica 26(1):33–50

    Article  Google Scholar 

  6. Fonseca CM, Fleming P (1995) Multiobjective genetic algorithms made easy: selection sharing and mating restriction. In: 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pp 45–52

  7. Fuente D, Vega-Rodríguez MA, Pérez CJ (2018) Automatic selection of a single solution from the pareto front to identify key players in social networks. Knowledge-Based Syst 160:228–236

    Article  Google Scholar 

  8. Kaddani S, Vanderpooten D, Vanpeperstraete JM, Aissi H (2017) Weighted sum model with partial preference information: Application to multi-objective optimization. Eur J Operat Res 260(2):665–679

    Article  MathSciNet  Google Scholar 

  9. Liu R, Song X, Fang L, Jiao L (2017) An r-dominance-based preference multi-objective optimization for many-objective optimization. Soft Comput 21(17):5003–5024

    Article  Google Scholar 

  10. Mavrovouniotis M, Li C, Yang S (2017) A survey of swarm intelligence for dynamic optimization: Algorithms and applications. Swarm and Evolutionary Comput 33:1–17

    Article  Google Scholar 

  11. Miettinen K (2012) Nonlinear multiobjective optimization. Springer Science & Business Media

  12. Miettinen K, Mäkelä MM (2006) Synchronous approach in interactive multiobjective optimization. Eur J Operational Res 170(3):909–922

    Article  Google Scholar 

  13. Molina J, Santana LV, Hernández-Díaz AG, Coello CAC, Caballero R (2009) g-dominance: Reference point based dominance for multiobjective metaheuristics. Eur J Operational Res 197(2):685–692

    Article  Google Scholar 

  14. Purshouse RC, Fleming PJ (2003) Evolutionary many-objective optimisation: An exploratory analysis. In: In The 2003 Congress on Evolutionary Computation, pp 2066–2073

  15. Said LB, Bechikh S, Ghédira K (2010) The r-dominance: a new dominance relation for interactive evolutionary multicriteria decision making. IEEE Trans Evolutionary Comput 14(5):801–818

    Article  Google Scholar 

  16. Siegmund F, Ng AH, Deb K (2012) Finding a preferred diverse set of pareto-optimal solutions for a limited number of function calls. In: In 2012 IEEE Congress on Evolutionary Computation, pp 1–8

  17. Sindhya K, Ruiz AB, Miettinen K (2011) A preference based interactive evolutionary algorithm for multi-objective optimization: Pie. In: In International Conference on Evolutionary Multi-Criterion Optimization, pp 212–225

  18. Thiele L, Miettinen K, Korhonen PJ, Molina J (2009) A preference-based evolutionary algorithm for multi-objective optimization. Evolutionary Comput 17(3):411–436

    Article  Google Scholar 

  19. Wang B, Li S, Guo J, Chen Q (2018) Car-like mobile robot path planning in rough terrain using multi-objective particle swarm optimization algorithm. Neurocomputing 282:42–51

    Article  Google Scholar 

  20. Yu G, Zheng J, Shen R, Li M (2016) Decomposing the user-preference in multiobjective optimization. Soft Comput 20(10):4005–4021

    Article  Google Scholar 

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

    Article  Google Scholar 

  22. Zhou Y, Yang JJ, Zheng LY (2019) Hyper-heuristic coevolution of machine assignment and job sequencing rules for multi-objective dynamic flexible job shop scheduling. IEEE Access 7:68–88

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61876027, 61751312 and 61533020, and the Natural Science Foundation of Chongqing under Grant Nos. cstc2019jscx-mbdxX0048.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong Yu.

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

Yu, H., Fu, Z., Wang, G. et al. A Multi-objective optimization algorithm based on dynamic user-preference information. Computing 104, 627–656 (2022). https://doi.org/10.1007/s00607-021-00995-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-021-00995-x

Keywords

Mathematics Subject Classification

Navigation