Open Access iconOpen Access

ARTICLE

crossmark

Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier

Jun Wang1,2, Linxi Zhang1,2, Hao Zhang1, Funan Peng1,*, Mohammed A. El-Meligy3, Mohamed Sharaf3, Qiang Fu1

1 College of Computer Science and Technology, Shenyang University of Chemical Technology, Shenyang, 110142, China
2 Key Laboratory of Intelligent Technology for Chemical Process Industry of Liaoning Province, Shenyang University of Chemical Technology, Shenyang, 110142, China
3 Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh, 11421, Saudi Arabia

* Corresponding Author: Funan Peng. Email: email

(This article belongs to the Special Issue: Recent Advances in Ensemble Framework of Meta-heuristics and Machine Learning: Methods and Applications)

Computers, Materials & Continua 2024, 79(1), 1281-1299. https://doi.org/10.32604/cmc.2024.048495

Abstract

The existing algorithms for solving multi-objective optimization problems fall into three main categories: Decomposition-based, dominance-based, and indicator-based. Traditional multi-objective optimization problems mainly focus on objectives, treating decision variables as a total variable to solve the problem without considering the critical role of decision variables in objective optimization. As seen, a variety of decision variable grouping algorithms have been proposed. However, these algorithms are relatively broad for the changes of most decision variables in the evolution process and are time-consuming in the process of finding the Pareto frontier. To solve these problems, a multi-objective optimization algorithm for grouping decision variables based on extreme point Pareto frontier (MOEA-DV/EPF) is proposed. This algorithm adopts a preprocessing rule to solve the Pareto optimal solution set of extreme points generated by simultaneous evolution in various target directions, obtains the basic Pareto front surface to determine the convergence effect, and analyzes the convergence and distribution effects of decision variables. In the later stages of algorithm optimization, different mutation strategies are adopted according to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals, thus enhancing the performance of the algorithm. Evaluation validation of the test functions shows that this algorithm can solve the multi-objective optimization problem more efficiently.

Keywords


Cite This Article

APA Style
Wang, J., Zhang, L., Zhang, H., Peng, F., El-Meligy, M.A. et al. (2024). Multi-objective optimization algorithm for grouping decision variables based on extreme point pareto frontier. Computers, Materials & Continua, 79(1), 1281-1299. https://doi.org/10.32604/cmc.2024.048495
Vancouver Style
Wang J, Zhang L, Zhang H, Peng F, El-Meligy MA, Sharaf M, et al. Multi-objective optimization algorithm for grouping decision variables based on extreme point pareto frontier. Comput Mater Contin. 2024;79(1):1281-1299 https://doi.org/10.32604/cmc.2024.048495
IEEE Style
J. Wang et al., "Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier," Comput. Mater. Contin., vol. 79, no. 1, pp. 1281-1299. 2024. https://doi.org/10.32604/cmc.2024.048495



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 172

    View

  • 121

    Download

  • 0

    Like

Share Link