{"title":"乌托邦约束多目标优化进化算法","authors":"P. Varshini, S. Baskar, S. T. Selvi","doi":"10.1080/0952813X.2022.2035826","DOIUrl":null,"url":null,"abstract":"ABSTRACT A new multiobjective evolutionary optimisation algorithm (MOEA) to solve multimodal, multidimensional, nonconvex, nonlinear, dynamic multiobjective optimisation problems (MOPs) is the need of the hour. The quality of an MOEA lies in a good balance between the exploration and exploitation stages of the MOEA. Utopia constrained MOEA (U-MOEA) is proposed in this paper that improves the exploitation in the replacement step to achieve a perfect balance between exploration and exploitation. The proposed U-MOEA is tested on benchmark MOPs and a multivariable controller design problem. The performance of the proposed algorithm is also compared with other MOEAs such as NSGA-II and ICMDRA concerning hyper volume, nondomination count, combined Pareto set metric, and Cmetric . The performance metrics show better hyper volume and spread metric values for the proposed algorithm, indicating the ability in attaining trade-off region closeness along with diversified Pareto front for U-MOEA when compared to the other two algorithms. Results clearly show that the proposed U-MOEA produces good convergence, diversity characteristics with many numbers of trade-off solutions in a Pareto front.","PeriodicalId":15677,"journal":{"name":"Journal of Experimental & Theoretical Artificial Intelligence","volume":"19 1","pages":"955 - 971"},"PeriodicalIF":1.7000,"publicationDate":"2022-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Utopia constrained multi objective optimisation evolutionary algorithm\",\"authors\":\"P. Varshini, S. Baskar, S. T. Selvi\",\"doi\":\"10.1080/0952813X.2022.2035826\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT A new multiobjective evolutionary optimisation algorithm (MOEA) to solve multimodal, multidimensional, nonconvex, nonlinear, dynamic multiobjective optimisation problems (MOPs) is the need of the hour. The quality of an MOEA lies in a good balance between the exploration and exploitation stages of the MOEA. Utopia constrained MOEA (U-MOEA) is proposed in this paper that improves the exploitation in the replacement step to achieve a perfect balance between exploration and exploitation. The proposed U-MOEA is tested on benchmark MOPs and a multivariable controller design problem. The performance of the proposed algorithm is also compared with other MOEAs such as NSGA-II and ICMDRA concerning hyper volume, nondomination count, combined Pareto set metric, and Cmetric . The performance metrics show better hyper volume and spread metric values for the proposed algorithm, indicating the ability in attaining trade-off region closeness along with diversified Pareto front for U-MOEA when compared to the other two algorithms. Results clearly show that the proposed U-MOEA produces good convergence, diversity characteristics with many numbers of trade-off solutions in a Pareto front.\",\"PeriodicalId\":15677,\"journal\":{\"name\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"volume\":\"19 1\",\"pages\":\"955 - 971\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2022-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1080/0952813X.2022.2035826\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Experimental & Theoretical Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/0952813X.2022.2035826","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Utopia constrained multi objective optimisation evolutionary algorithm
ABSTRACT A new multiobjective evolutionary optimisation algorithm (MOEA) to solve multimodal, multidimensional, nonconvex, nonlinear, dynamic multiobjective optimisation problems (MOPs) is the need of the hour. The quality of an MOEA lies in a good balance between the exploration and exploitation stages of the MOEA. Utopia constrained MOEA (U-MOEA) is proposed in this paper that improves the exploitation in the replacement step to achieve a perfect balance between exploration and exploitation. The proposed U-MOEA is tested on benchmark MOPs and a multivariable controller design problem. The performance of the proposed algorithm is also compared with other MOEAs such as NSGA-II and ICMDRA concerning hyper volume, nondomination count, combined Pareto set metric, and Cmetric . The performance metrics show better hyper volume and spread metric values for the proposed algorithm, indicating the ability in attaining trade-off region closeness along with diversified Pareto front for U-MOEA when compared to the other two algorithms. Results clearly show that the proposed U-MOEA produces good convergence, diversity characteristics with many numbers of trade-off solutions in a Pareto front.
期刊介绍:
Journal of Experimental & Theoretical Artificial Intelligence (JETAI) is a world leading journal dedicated to publishing high quality, rigorously reviewed, original papers in artificial intelligence (AI) research.
The journal features work in all subfields of AI research and accepts both theoretical and applied research. Topics covered include, but are not limited to, the following:
• cognitive science
• games
• learning
• knowledge representation
• memory and neural system modelling
• perception
• problem-solving