Jiale Zhao , Xiangdang Huang , Tian Li , Huanhuan Yu , Hansheng Fei , Qiuling Yang
{"title":"Research on decomposition-based multi-objective evolutionary algorithm with dynamic weight vector","authors":"Jiale Zhao , Xiangdang Huang , Tian Li , Huanhuan Yu , Hansheng Fei , Qiuling Yang","doi":"10.1016/j.jocs.2024.102361","DOIUrl":null,"url":null,"abstract":"<div><p>In recent years, multi-objective evolutionary algorithm based on decomposition has gradually attracted people's interest. However, this algorithm has some problems. For example, the diversity of the algorithm is poor, and the convergence and diversity of the algorithm are unbalanced. In addition, users don't always care about the entire Pareto front. Sometimes they may only be interested in specific areas of entire Pareto front. Based on the above problems, this paper proposes a decomposition-based multi-objective evolutionary algorithm with dynamic weight vector (MOEA/D-DWV). Firstly, a weight vector generation model with uniform distribution or preference distribution is proposed. Users can decide which type of weight vector to generate according to their own wishes. Then, two combination evolution operators are proposed to better balance the convergence and diversity of the algorithm. Finally, a dynamic adjustment strategy of weight vector is proposed. This strategy can adjust the distribution of weight vector adaptively according to the distribution of solutions in the objective space, so that the population can be uniformly distributed in the objective space as much as possible. MOEA/D-DWV algorithm is compared with 9 advanced multi-objective evolutionary algorithms. The comparison results show that MOEA/D-DWV algorithm is more competitive.</p></div><div><h3>Data availability</h3><p>Data will be made available on request.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102361"},"PeriodicalIF":3.1000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877750324001546","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years, multi-objective evolutionary algorithm based on decomposition has gradually attracted people's interest. However, this algorithm has some problems. For example, the diversity of the algorithm is poor, and the convergence and diversity of the algorithm are unbalanced. In addition, users don't always care about the entire Pareto front. Sometimes they may only be interested in specific areas of entire Pareto front. Based on the above problems, this paper proposes a decomposition-based multi-objective evolutionary algorithm with dynamic weight vector (MOEA/D-DWV). Firstly, a weight vector generation model with uniform distribution or preference distribution is proposed. Users can decide which type of weight vector to generate according to their own wishes. Then, two combination evolution operators are proposed to better balance the convergence and diversity of the algorithm. Finally, a dynamic adjustment strategy of weight vector is proposed. This strategy can adjust the distribution of weight vector adaptively according to the distribution of solutions in the objective space, so that the population can be uniformly distributed in the objective space as much as possible. MOEA/D-DWV algorithm is compared with 9 advanced multi-objective evolutionary algorithms. The comparison results show that MOEA/D-DWV algorithm is more competitive.
期刊介绍：
Computational Science is a rapidly growing multi- and interdisciplinary field that uses advanced computing and data analysis to understand and solve complex problems. It has reached a level of predictive capability that now firmly complements the traditional pillars of experimentation and theory.
The recent advances in experimental techniques such as detectors, on-line sensor networks and high-resolution imaging techniques, have opened up new windows into physical and biological processes at many levels of detail. The resulting data explosion allows for detailed data driven modeling and simulation.
This new discipline in science combines computational thinking, modern computational methods, devices and collateral technologies to address problems far beyond the scope of traditional numerical methods.
Computational science typically unifies three distinct elements:
• Modeling, Algorithms and Simulations (e.g. numerical and non-numerical, discrete and continuous);
• Software developed to solve science (e.g., biological, physical, and social), engineering, medicine, and humanities problems;
• Computer and information science that develops and optimizes the advanced system hardware, software, networking, and data management components (e.g. problem solving environments).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
