{"title":"An Improved Multi-Objective Genetic Algorithm Based On Pareto Front and Fixed Point Theory","authors":"Jingjun Zhang, Yanmin Shang, Ruizhen Gao, Yuzhen Dong","doi":"10.1109/IWISA.2009.5072719","DOIUrl":null,"url":null,"abstract":"For multi-objective optimization problems, an improved multi-objective genetic algorithm based on Pareto Front and Fixed Point Theory is proposed in this paper. In this Algorithm, the fixed point theory is introduced to multi-objective optimization questions and K1 triangulation is carried on to solutions for the weighting function constructed by all subfunctions, so the optimal problems are transferred to fixed point problems. The non-dominated-set is constructed by the method of exclusion. The experimental results show that this improved genetic algorithm convergent faster and is able to achieve a broader distribution of the Pareto optimal solution. Keywords— multi-objective optimization; Pareto Front; nondominated set; genetic algorithm; fixed point; K1 triangulation","PeriodicalId":6327,"journal":{"name":"2009 International Workshop on Intelligent Systems and Applications","volume":"119 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWISA.2009.5072719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
For multi-objective optimization problems, an improved multi-objective genetic algorithm based on Pareto Front and Fixed Point Theory is proposed in this paper. In this Algorithm, the fixed point theory is introduced to multi-objective optimization questions and K1 triangulation is carried on to solutions for the weighting function constructed by all subfunctions, so the optimal problems are transferred to fixed point problems. The non-dominated-set is constructed by the method of exclusion. The experimental results show that this improved genetic algorithm convergent faster and is able to achieve a broader distribution of the Pareto optimal solution. Keywords— multi-objective optimization; Pareto Front; nondominated set; genetic algorithm; fixed point; K1 triangulation
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
