Xin-ru Yao , Zhong-kai Feng , Li Zhang , Wen-jing Niu , Tao Yang , Yang Xiao , Hong-wu Tang
{"title":"基于分解的多目标合作搜索算法,用于复杂工程优化和水库运行问题","authors":"Xin-ru Yao , Zhong-kai Feng , Li Zhang , Wen-jing Niu , Tao Yang , Yang Xiao , Hong-wu Tang","doi":"10.1016/j.asoc.2024.112442","DOIUrl":null,"url":null,"abstract":"<div><div>This study introduces a novel multi-objective cooperation search algorithm based on decomposition (MOCSA/D) to address multi-objective competitive challenges in engineering problem. Inspired by the optimization strategy of single-objective Cooperation Search Algorithm (CSA) and the decomposition framework of MOEA/D, MOCSA/D algorithm randomly generates initial solutions in the optimization space, and then repeatedly executes four search strategies until the end of iteration: Cooperative updating strategy gathers high-quality information to update solutions with balanced distribution. Reflective adjustment strategy expands the exploration range of the population, enabling the acquisition of solutions with strong optimization capabilities. Internal competition strategy selects superior individuals with better performance for subsequent optimization. Density updating strategy improves the competitiveness of optimized individuals within the population, fostering a more diverse solution set. Three numerical experiments (including DTLZ, WFG unconstrained test problems, ZXH_CF constrained test problems and RWMOP real-world multi-objective optimization problems) are tested to further comprehensively evaluate the dominant performance of MOCSA/D. The test results in different problem scenarios show that compared with the existing excellent evolutionary algorithms, MOCSA/D can always obtain a better, stable and uniform distribution of non-dominated solutions, and has higher solving efficiency and optimization quality under different performance evaluation metrics with the increasing difficulty of solving problems. Finally, the proposed algorithm is applied to the multi-objective reservoir engineering optimization problem to verify the feasibility of the decision scheme and the comprehensive benefit optimization of MOCSA/D. Overall, MOCSA/D can simplify the problem optimization difficulty based on decomposition mechanism, and improve the global optimization of population, path diversity and individual competition through different search strategies, which provides an advantageous tool for addressing multi-objective competitive challenges.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"167 ","pages":"Article 112442"},"PeriodicalIF":7.2000,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective cooperation search algorithm based on decomposition for complex engineering optimization and reservoir operation problems\",\"authors\":\"Xin-ru Yao , Zhong-kai Feng , Li Zhang , Wen-jing Niu , Tao Yang , Yang Xiao , Hong-wu Tang\",\"doi\":\"10.1016/j.asoc.2024.112442\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This study introduces a novel multi-objective cooperation search algorithm based on decomposition (MOCSA/D) to address multi-objective competitive challenges in engineering problem. Inspired by the optimization strategy of single-objective Cooperation Search Algorithm (CSA) and the decomposition framework of MOEA/D, MOCSA/D algorithm randomly generates initial solutions in the optimization space, and then repeatedly executes four search strategies until the end of iteration: Cooperative updating strategy gathers high-quality information to update solutions with balanced distribution. Reflective adjustment strategy expands the exploration range of the population, enabling the acquisition of solutions with strong optimization capabilities. Internal competition strategy selects superior individuals with better performance for subsequent optimization. Density updating strategy improves the competitiveness of optimized individuals within the population, fostering a more diverse solution set. Three numerical experiments (including DTLZ, WFG unconstrained test problems, ZXH_CF constrained test problems and RWMOP real-world multi-objective optimization problems) are tested to further comprehensively evaluate the dominant performance of MOCSA/D. The test results in different problem scenarios show that compared with the existing excellent evolutionary algorithms, MOCSA/D can always obtain a better, stable and uniform distribution of non-dominated solutions, and has higher solving efficiency and optimization quality under different performance evaluation metrics with the increasing difficulty of solving problems. Finally, the proposed algorithm is applied to the multi-objective reservoir engineering optimization problem to verify the feasibility of the decision scheme and the comprehensive benefit optimization of MOCSA/D. Overall, MOCSA/D can simplify the problem optimization difficulty based on decomposition mechanism, and improve the global optimization of population, path diversity and individual competition through different search strategies, which provides an advantageous tool for addressing multi-objective competitive challenges.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"167 \",\"pages\":\"Article 112442\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S156849462401216X\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S156849462401216X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Multi-objective cooperation search algorithm based on decomposition for complex engineering optimization and reservoir operation problems
This study introduces a novel multi-objective cooperation search algorithm based on decomposition (MOCSA/D) to address multi-objective competitive challenges in engineering problem. Inspired by the optimization strategy of single-objective Cooperation Search Algorithm (CSA) and the decomposition framework of MOEA/D, MOCSA/D algorithm randomly generates initial solutions in the optimization space, and then repeatedly executes four search strategies until the end of iteration: Cooperative updating strategy gathers high-quality information to update solutions with balanced distribution. Reflective adjustment strategy expands the exploration range of the population, enabling the acquisition of solutions with strong optimization capabilities. Internal competition strategy selects superior individuals with better performance for subsequent optimization. Density updating strategy improves the competitiveness of optimized individuals within the population, fostering a more diverse solution set. Three numerical experiments (including DTLZ, WFG unconstrained test problems, ZXH_CF constrained test problems and RWMOP real-world multi-objective optimization problems) are tested to further comprehensively evaluate the dominant performance of MOCSA/D. The test results in different problem scenarios show that compared with the existing excellent evolutionary algorithms, MOCSA/D can always obtain a better, stable and uniform distribution of non-dominated solutions, and has higher solving efficiency and optimization quality under different performance evaluation metrics with the increasing difficulty of solving problems. Finally, the proposed algorithm is applied to the multi-objective reservoir engineering optimization problem to verify the feasibility of the decision scheme and the comprehensive benefit optimization of MOCSA/D. Overall, MOCSA/D can simplify the problem optimization difficulty based on decomposition mechanism, and improve the global optimization of population, path diversity and individual competition through different search strategies, which provides an advantageous tool for addressing multi-objective competitive challenges.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.