一种求多目标最小-最大最优解的随机方法

Yan Tian, Jiang-ling Hao, Li Erxue
{"title":"一种求多目标最小-最大最优解的随机方法","authors":"Yan Tian, Jiang-ling Hao, Li Erxue","doi":"10.1109/ICEMS.2001.971871","DOIUrl":null,"url":null,"abstract":"A tabu based algorithm for finding the minmax optimal of multi-objective optimal design problems is proposed. A min-max optimal in multi-objective optimizations is that with the smallest relative increments of all the objective functions. Contrary to other methods used for multi-objective optimizations in electromagnetic device designs, the proposed one requires no scalarization techniques, thus simplifying the numerical implementations considerably. Numerical examples on both test and practical problems are presented to validate the proposed algorithm.","PeriodicalId":143007,"journal":{"name":"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A stochastic method for finding the min-max optimal solution of multiple objectives\",\"authors\":\"Yan Tian, Jiang-ling Hao, Li Erxue\",\"doi\":\"10.1109/ICEMS.2001.971871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A tabu based algorithm for finding the minmax optimal of multi-objective optimal design problems is proposed. A min-max optimal in multi-objective optimizations is that with the smallest relative increments of all the objective functions. Contrary to other methods used for multi-objective optimizations in electromagnetic device designs, the proposed one requires no scalarization techniques, thus simplifying the numerical implementations considerably. Numerical examples on both test and practical problems are presented to validate the proposed algorithm.\",\"PeriodicalId\":143007,\"journal\":{\"name\":\"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)\",\"volume\":\"233 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEMS.2001.971871\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEMS.2001.971871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于禁忌的多目标优化设计问题的最小最大优化算法。多目标优化中的最小-最大优化是指所有目标函数的相对增量最小。与电磁器件设计中用于多目标优化的其他方法相反,该方法不需要标量化技术,从而大大简化了数值实现。给出了测试和实际问题的数值算例,验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A stochastic method for finding the min-max optimal solution of multiple objectives
A tabu based algorithm for finding the minmax optimal of multi-objective optimal design problems is proposed. A min-max optimal in multi-objective optimizations is that with the smallest relative increments of all the objective functions. Contrary to other methods used for multi-objective optimizations in electromagnetic device designs, the proposed one requires no scalarization techniques, thus simplifying the numerical implementations considerably. Numerical examples on both test and practical problems are presented to validate the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信