{"title":"多目标优化的改进参考向量引导差分进化算法","authors":"Jie Lin, S. Zheng, Y. Long","doi":"10.1145/3395260.3395268","DOIUrl":null,"url":null,"abstract":"Most of the existing evolutionary algorithms to deal with many-objective problems are based on the enhancing of selection strategy. Among them, the reference vector-guided evolutionary algorithm (RVEA) achieves excellent performance. In this paper, a new search engine is combined with RVEA to achieve further performance enhancement of the differential evolutionary (DE) algorithm. In the optimization process of differential evolution algorithm on many-objective problems, improving convergence and maintaining diversity are two different optimization directions, and it is usually difficult to maintain a balance between them. To solve this problem, a new search engine based on DE is proposed. The proposed search engine is implemented based on a cooperative scheme of local and global search strategies. In the local search, the population is divided into several sub-populations, each of which evolves independently using the proposed mutation strategy. The distance between the individuals in each sub-population is relatively close. Therefore, it has a strong exploitation capability, and will not make the population lose diversity. Meanwhile, the selection strategy of RVEA enables the population to maintain diversity, and the DE/rand/1 utilized in global search is sufficient to keep a strong exploration capability. Therefore, the proposed approach can achieve a good balance between exploration and exploitation. The experimental results show that the proposed algorithm performs well in many-objective optimizations up to more than 10 objectives.","PeriodicalId":103490,"journal":{"name":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improved Reference Vector Guided Differential Evolution Algorithm for Many-Objective Optimization\",\"authors\":\"Jie Lin, S. Zheng, Y. Long\",\"doi\":\"10.1145/3395260.3395268\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the existing evolutionary algorithms to deal with many-objective problems are based on the enhancing of selection strategy. Among them, the reference vector-guided evolutionary algorithm (RVEA) achieves excellent performance. In this paper, a new search engine is combined with RVEA to achieve further performance enhancement of the differential evolutionary (DE) algorithm. In the optimization process of differential evolution algorithm on many-objective problems, improving convergence and maintaining diversity are two different optimization directions, and it is usually difficult to maintain a balance between them. To solve this problem, a new search engine based on DE is proposed. The proposed search engine is implemented based on a cooperative scheme of local and global search strategies. In the local search, the population is divided into several sub-populations, each of which evolves independently using the proposed mutation strategy. The distance between the individuals in each sub-population is relatively close. Therefore, it has a strong exploitation capability, and will not make the population lose diversity. Meanwhile, the selection strategy of RVEA enables the population to maintain diversity, and the DE/rand/1 utilized in global search is sufficient to keep a strong exploration capability. Therefore, the proposed approach can achieve a good balance between exploration and exploitation. The experimental results show that the proposed algorithm performs well in many-objective optimizations up to more than 10 objectives.\",\"PeriodicalId\":103490,\"journal\":{\"name\":\"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3395260.3395268\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3395260.3395268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved Reference Vector Guided Differential Evolution Algorithm for Many-Objective Optimization
Most of the existing evolutionary algorithms to deal with many-objective problems are based on the enhancing of selection strategy. Among them, the reference vector-guided evolutionary algorithm (RVEA) achieves excellent performance. In this paper, a new search engine is combined with RVEA to achieve further performance enhancement of the differential evolutionary (DE) algorithm. In the optimization process of differential evolution algorithm on many-objective problems, improving convergence and maintaining diversity are two different optimization directions, and it is usually difficult to maintain a balance between them. To solve this problem, a new search engine based on DE is proposed. The proposed search engine is implemented based on a cooperative scheme of local and global search strategies. In the local search, the population is divided into several sub-populations, each of which evolves independently using the proposed mutation strategy. The distance between the individuals in each sub-population is relatively close. Therefore, it has a strong exploitation capability, and will not make the population lose diversity. Meanwhile, the selection strategy of RVEA enables the population to maintain diversity, and the DE/rand/1 utilized in global search is sufficient to keep a strong exploration capability. Therefore, the proposed approach can achieve a good balance between exploration and exploitation. The experimental results show that the proposed algorithm performs well in many-objective optimizations up to more than 10 objectives.