{"title":"基于DMMA算法的三元FPRM电路极性搜索","authors":"Weichao Chen, Qiang Fu, Junwen Wei","doi":"10.1109/ICETCI53161.2021.9563531","DOIUrl":null,"url":null,"abstract":"Through studying the Ternary FPRM expression and polarity conversion algorithm, combining with the mayfly optimization algorithm, this paper proposes a decomposition-based multi-objective mayfly optimization (Multi objective mayfly optimization algorithm based on decomposition, DMMA) algorithm solution. The DMMA algorithm decomposes the target space into multiple uniform subspaces, and each subspace independently retains a Pareto solution so as to improve the distribution of the population on the Pareto front; using the Chebyshev decomposition method, the optimal solution of the sub-problem is taken as the direction of population evolution so as to expand the search range of the population. On this basis, Ternary FPRM polarity conversion technology and DMMA algorithm are combined to search for the optimal polarity of the circuit. By testing 10 Benchmark reference circuits, and comparing the performance of DMMA algorithm with MODPSO and MODCPSO algorithms, it is effectively proved that DMMA algorithm has advantages in searching the optimal polarity of Ternary FPRM circuits.","PeriodicalId":170858,"journal":{"name":"2021 IEEE International Conference on Electronic Technology, Communication and Information (ICETCI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polarity Search of Ternary FPRM Circuit Based on DMMA Algorithm\",\"authors\":\"Weichao Chen, Qiang Fu, Junwen Wei\",\"doi\":\"10.1109/ICETCI53161.2021.9563531\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Through studying the Ternary FPRM expression and polarity conversion algorithm, combining with the mayfly optimization algorithm, this paper proposes a decomposition-based multi-objective mayfly optimization (Multi objective mayfly optimization algorithm based on decomposition, DMMA) algorithm solution. The DMMA algorithm decomposes the target space into multiple uniform subspaces, and each subspace independently retains a Pareto solution so as to improve the distribution of the population on the Pareto front; using the Chebyshev decomposition method, the optimal solution of the sub-problem is taken as the direction of population evolution so as to expand the search range of the population. On this basis, Ternary FPRM polarity conversion technology and DMMA algorithm are combined to search for the optimal polarity of the circuit. By testing 10 Benchmark reference circuits, and comparing the performance of DMMA algorithm with MODPSO and MODCPSO algorithms, it is effectively proved that DMMA algorithm has advantages in searching the optimal polarity of Ternary FPRM circuits.\",\"PeriodicalId\":170858,\"journal\":{\"name\":\"2021 IEEE International Conference on Electronic Technology, Communication and Information (ICETCI)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Electronic Technology, Communication and Information (ICETCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICETCI53161.2021.9563531\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Electronic Technology, Communication and Information (ICETCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICETCI53161.2021.9563531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
通过对三元FPRM表达和极性转换算法的研究,结合蜉蝣优化算法,提出了一种基于分解的多目标蜉蝣优化算法(Multi -objective mayfly optimization algorithm based on decomposition, DMMA)的算法解决方案。DMMA算法将目标空间分解为多个均匀的子空间,每个子空间独立保留一个Pareto解,以改善种群在Pareto前沿的分布;采用切比雪夫分解方法,以子问题的最优解作为种群进化的方向,从而扩大种群的搜索范围。在此基础上,结合三元FPRM极性转换技术和DMMA算法搜索电路的最优极性。通过对10个基准参考电路的测试,并将DMMA算法与MODPSO和MODCPSO算法的性能进行比较,有效地证明了DMMA算法在寻找三元FPRM电路的最优极性方面具有优势。
Polarity Search of Ternary FPRM Circuit Based on DMMA Algorithm
Through studying the Ternary FPRM expression and polarity conversion algorithm, combining with the mayfly optimization algorithm, this paper proposes a decomposition-based multi-objective mayfly optimization (Multi objective mayfly optimization algorithm based on decomposition, DMMA) algorithm solution. The DMMA algorithm decomposes the target space into multiple uniform subspaces, and each subspace independently retains a Pareto solution so as to improve the distribution of the population on the Pareto front; using the Chebyshev decomposition method, the optimal solution of the sub-problem is taken as the direction of population evolution so as to expand the search range of the population. On this basis, Ternary FPRM polarity conversion technology and DMMA algorithm are combined to search for the optimal polarity of the circuit. By testing 10 Benchmark reference circuits, and comparing the performance of DMMA algorithm with MODPSO and MODCPSO algorithms, it is effectively proved that DMMA algorithm has advantages in searching the optimal polarity of Ternary FPRM circuits.