一种新的基于线性规划的多目标进化算法

Zhicang Wang, Hecheng Li
{"title":"一种新的基于线性规划的多目标进化算法","authors":"Zhicang Wang, Hecheng Li","doi":"10.1109/CIS2018.2018.00082","DOIUrl":null,"url":null,"abstract":"It is the goal of scholars in the field of multiobjective optimization to find wide distributive and uniform Pareto solution set over Pareto front. The reason is that the solutions of multi-objective optimization problem is a set of Pareto solutions which are non-dominated each other, and the obtained Pareto solutions are often not well distributed and cannot satisfy the needs of decision makers. It may be the case that decision-makers expect to have a solution in an area to assist them for making decisions. In this paper, we propose a local search strategy based on linear programming and construct a multi-objective evolutionary algorithm based on linear programming (MOEA/LP). MOEA/LP algorithm makes up for the large “gap” in Pareto front, and makes Pareto optimal solutions over Pareto front more uniform and more extensive. Thereby, the decision makers use MOEA/LP algorithm to make more effective choice. Experiment results show the proposed algorithm has better performance according to some measure indices such as running time, hypervolue and C metric, etc.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Novel Multi-Objective Evolutionary Algorithm Based on Linear Programming\",\"authors\":\"Zhicang Wang, Hecheng Li\",\"doi\":\"10.1109/CIS2018.2018.00082\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is the goal of scholars in the field of multiobjective optimization to find wide distributive and uniform Pareto solution set over Pareto front. The reason is that the solutions of multi-objective optimization problem is a set of Pareto solutions which are non-dominated each other, and the obtained Pareto solutions are often not well distributed and cannot satisfy the needs of decision makers. It may be the case that decision-makers expect to have a solution in an area to assist them for making decisions. In this paper, we propose a local search strategy based on linear programming and construct a multi-objective evolutionary algorithm based on linear programming (MOEA/LP). MOEA/LP algorithm makes up for the large “gap” in Pareto front, and makes Pareto optimal solutions over Pareto front more uniform and more extensive. Thereby, the decision makers use MOEA/LP algorithm to make more effective choice. Experiment results show the proposed algorithm has better performance according to some measure indices such as running time, hypervolue and C metric, etc.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00082\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在Pareto前沿上寻找广分布且均匀的Pareto解集是多目标优化领域学者研究的目标。原因是多目标优化问题的解是一组彼此非支配的帕累托解,而得到的帕累托解往往分布不好,不能满足决策者的需要。决策者可能期望在某一领域有一个解决方案来帮助他们做出决策。本文提出了一种基于线性规划的局部搜索策略,并构造了一种基于线性规划的多目标进化算法(MOEA/LP)。MOEA/LP算法弥补了Pareto前沿的巨大“缺口”,使得Pareto前沿上的Pareto最优解更加均匀和广泛。因此,决策者使用MOEA/LP算法来做出更有效的选择。实验结果表明,该算法在运行时间、超容量和C度量等度量指标上具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Multi-Objective Evolutionary Algorithm Based on Linear Programming
It is the goal of scholars in the field of multiobjective optimization to find wide distributive and uniform Pareto solution set over Pareto front. The reason is that the solutions of multi-objective optimization problem is a set of Pareto solutions which are non-dominated each other, and the obtained Pareto solutions are often not well distributed and cannot satisfy the needs of decision makers. It may be the case that decision-makers expect to have a solution in an area to assist them for making decisions. In this paper, we propose a local search strategy based on linear programming and construct a multi-objective evolutionary algorithm based on linear programming (MOEA/LP). MOEA/LP algorithm makes up for the large “gap” in Pareto front, and makes Pareto optimal solutions over Pareto front more uniform and more extensive. Thereby, the decision makers use MOEA/LP algorithm to make more effective choice. Experiment results show the proposed algorithm has better performance according to some measure indices such as running time, hypervolue and C metric, etc.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信