用非支配排序遗传算法求解模糊多目标优化问题2

Trisna, Marimin Marimin, Y. Arkeman
{"title":"用非支配排序遗传算法求解模糊多目标优化问题2","authors":"Trisna, Marimin Marimin, Y. Arkeman","doi":"10.1109/ICACSIS.2016.7872798","DOIUrl":null,"url":null,"abstract":"This paper presents the stages for solving fuzzy multi-objective optimization problems using genetic algorithm approach. Before applying non-dominated sorting genetic algorithm II (NSGA II) techniques to obtain optimal solution, first multi-objective possibilistic (fuzzy) programming was converted into an equivalent auxiliary crisp model to form deterministic programming model. To determine the best solution from Pareto set, we implied feasibility degree of decision variable and satisfaction degree of decision maker. The best optimal solution is the intersection between α-feasibility degree and satisfaction degree of the decision makers that has the highest fuzzy membership degree. For numerical experiment, we used simple formulation in multi-objective fuzzy linear programming model with three maximum objective functions, three decision variables, and six constraints. The comparison of the results shows that our results are better for two objectives than that of compromising programming.","PeriodicalId":267924,"journal":{"name":"2016 International Conference on Advanced Computer Science and Information Systems (ICACSIS)","volume":"385 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Solving fuzzy multi-objective optimization using non-dominated sorting genetic algorithm II\",\"authors\":\"Trisna, Marimin Marimin, Y. Arkeman\",\"doi\":\"10.1109/ICACSIS.2016.7872798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the stages for solving fuzzy multi-objective optimization problems using genetic algorithm approach. Before applying non-dominated sorting genetic algorithm II (NSGA II) techniques to obtain optimal solution, first multi-objective possibilistic (fuzzy) programming was converted into an equivalent auxiliary crisp model to form deterministic programming model. To determine the best solution from Pareto set, we implied feasibility degree of decision variable and satisfaction degree of decision maker. The best optimal solution is the intersection between α-feasibility degree and satisfaction degree of the decision makers that has the highest fuzzy membership degree. For numerical experiment, we used simple formulation in multi-objective fuzzy linear programming model with three maximum objective functions, three decision variables, and six constraints. The comparison of the results shows that our results are better for two objectives than that of compromising programming.\",\"PeriodicalId\":267924,\"journal\":{\"name\":\"2016 International Conference on Advanced Computer Science and Information Systems (ICACSIS)\",\"volume\":\"385 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Advanced Computer Science and Information Systems (ICACSIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACSIS.2016.7872798\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advanced Computer Science and Information Systems (ICACSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACSIS.2016.7872798","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

介绍了用遗传算法求解模糊多目标优化问题的各个阶段。在应用非支配排序遗传算法II (NSGA II)技术求最优解之前,首先将多目标可能性(fuzzy)规划转化为等效的辅助crisp模型,形成确定性规划模型。为了从Pareto集合中确定最优解,我们隐含了决策变量的可行性程度和决策者的满意度。最优解是模糊隶属度最高的决策者α-可行度与满意度的交集。在数值实验中,我们用简单的公式建立了具有3个最大目标函数、3个决策变量和6个约束条件的多目标模糊线性规划模型。结果的比较表明,我们的结果对两个目标都优于折衷规划的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Solving fuzzy multi-objective optimization using non-dominated sorting genetic algorithm II
This paper presents the stages for solving fuzzy multi-objective optimization problems using genetic algorithm approach. Before applying non-dominated sorting genetic algorithm II (NSGA II) techniques to obtain optimal solution, first multi-objective possibilistic (fuzzy) programming was converted into an equivalent auxiliary crisp model to form deterministic programming model. To determine the best solution from Pareto set, we implied feasibility degree of decision variable and satisfaction degree of decision maker. The best optimal solution is the intersection between α-feasibility degree and satisfaction degree of the decision makers that has the highest fuzzy membership degree. For numerical experiment, we used simple formulation in multi-objective fuzzy linear programming model with three maximum objective functions, three decision variables, and six constraints. The comparison of the results shows that our results are better for two objectives than that of compromising programming.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信