The comparison of efficiency of the population for-mation approaches in the dynamic multi-objective optimization problems
Автор: Rurich M.A., Vakhnin A.V., Sopov E.A.
Журнал: Siberian Aerospace Journal @vestnik-sibsau-en
Рубрика: Informatics, computer technology and management
Статья в выпуске: 2 vol.23, 2022 года.
Бесплатный доступ
Dynamic multi-objective optimization problems are challenging and currently not-well understood class of optimization problems but this class is of great practical value. In such problems, the objective functions, their parameters and restrictions imposed on the search space can change over time. This fact means that solutions of the problem change too. When changes appear in the problem, an optimization algorithm needs to adapt to the changes in such a way that the convergence rate is sufficiently high. The work is devoted to the comparison of the different approaches to formation of a new population when changes in the dynamic multi-objective optimization problem appear: using solution, which obtained in the previous step; using a random generating of the population; partial using solutions which obtained in the previous step. In the first part of the article the classification of the changes in the problems is provided; the currently existing approaches to solving the problems based on evolutionary algorithms are considered. During the research NSGA-2 and SPEA2 algorithms are used to solving the dynamic optimization problems, the benchmark problems set is used to the comparison of the approaches. Obtained results being processed by Mann–Whitney U-test. It was obtained that changes rate in the problem affect the efficiency of the application of the solutions obtained in the previous step of new population the forming.
Dynamic multi-objective optimization, dynamic optimization, multi-objective optimization, evolutionary algorithms
Короткий адрес: https://sciup.org/148329623
IDR: 148329623 | DOI: 10.31772/2712-8970-2022-23-2-227-240
Список литературы The comparison of efficiency of the population for-mation approaches in the dynamic multi-objective optimization problems
- Yazdani D., Cheng R. A Survey of Evolutionary Continuous Dynamic Optimization Over Two Decades–Part A. IEEE Transactions on Evolutionary Computation. 2021, No. 25(4), P. 609–629.
- Zhang J., Xing L. A Survey of Multiobjective Evolutionary Algorithms. 22017 IEEE Interna-tional Conference on Computational Science and Engineering (CSE) and IEEE International Confer-ence on Embedded and Ubiquitous Computing (EUC), 2017.
- Nguyen T. T., Yang S., Branke J. Evolutionary dynamic optimization: A survey of the state of the art. Swarm and Evolutionary Computation. 2012, No. 6, P. 1–24.
- Azzouz R., Bechikh S., Ben Said L. Dynamic Multi-objective Optimization Using Evolutionary Algorithms: A Survey. Adaptation, Learning, and Optimization. 2016, P. 31–70.
- Yazdani D., Cheng R. A Survey of Evolutionary Continuous Dynamic Optimization Over Two Decades–Part B. IEEE Transactions on Evolutionary Computation. 2021, No. 25(4), P. 630–650.
- Li C., Yang S. A general framework of multipopulation methods with clustering in indetectable dynamic environments. IEEE Trans. Evol. Comput. 2012, No. 16(4), P. 556–577.
- Deb K., Karthik S. Dynamic multi-objective optimization and decision-making using modified NSGA-II: a case study on hydro-thermal power scheduling. Lecture Notes in Computer Science. 2007, P. 803–817.
- Muruganantham A., Tan K., Vadakkepat P. Evolutionary dynamic multiobjective optimization via kalman filter prediction. IEEE Trans. Evol. Comput. 2016, No. 46(12), P. 2862–2873.
- Zhang Q., Jiang S., Yang S., Song H. Solving dynamic multi-objective problems with a new prediction-based optimization algorithm. PLoS ONE. 2021, No. 16(8).
- Branke J. Memory enhanced evolutionary algorithms for changing optimization problems. Proceedings of the 1999 congress on evolutionary computation, Institute of Electrical and Electronics Engineers, 1999.
- Goh C., Tan K. A competitive-cooperative coevolutionary paradigm for dynamic multiobjec-tive optimization. IEEE Trans. Evol. Comput. 2009, No. 13(1), P. 103–127.
- Branke J., Kaussler T., Smidt C., Schmeck H. A Multi-population approach to dynamic opti-mizaton problems. Evolutionary Design and Manufacture, Springer Science mathplus Business Media. 2000, P. 299–307.
- Li C., Yang S. Fast Multi-Swarm Optimization for dynamic optimization problems. 2008 Fourth International conference on Natural Computation, Institute of Electrical and Electronics Engi-neers, 2008.
- Deb K., Pratap A., Agarwal S., Meyarivan T. A Fast and Elitist Multiobjective Genetic Algo-rithm: NSGA-II. Ieee transactions on evolutionary computation. 2002, No. 6 (2), P. 182–197.
- Zitzler E., Laumanns M., Thiele L. SPEA2: Improving the Strength Pareto Evolutionary Algo-rithm. Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering, Swiss Federal Institute of Technology (ETH), Zurich, 2001.
- Jiang S., Yang S., Yao X., Chen Tan K., Kaiser M. Benchmark Problems for CEC2018 Com-petition on Dynamic Multiobjective Optimisation. CEC2018 Competition, 2018.
- Zhang Q., Yang S., Wang R. Novel Prediction Strategies for Dynamic Multiobjective optimi-zation. IEEE Trans. Evol. Comput., 2020, 24(2), P. 260–274.
- Rong M., Gong D., Pedrycz W., Wang L. A multimodel prediction method for dynamic multi-obejctive evolutionary optimization. IEEE Trans. Evol. Comput. 2020, No. 24(2), P. 290–304.
