模糊多目标运输问题:折衷近最优解的实编码遗传算法

Ravi Kumar R, Radha Gupta, Karthiyayini O, Ravinder Singh Kuntal, Vatsala G A
{"title":"模糊多目标运输问题:折衷近最优解的实编码遗传算法","authors":"Ravi Kumar R, Radha Gupta, Karthiyayini O, Ravinder Singh Kuntal, Vatsala G A","doi":"10.1109/ICATIECE45860.2019.9063620","DOIUrl":null,"url":null,"abstract":"In this article a comparative study on the effectiveness of Real-coded Genetic Algorithm (RGA) approach in finding the compromised near-to-optimal solution and to by-pass the allocation rule of (m+n−1) for a Fuzzified Multi-Objective Transportation Problem (FMOTP) is discussed. For this purpose, some benchmark problems with well-defined membership function were considered and several changes have been made in the execution of Genetic Algorithm with real codes. The performance of the RGA Approach in obtaining the compromised near-to-optimal solution is compared with the traditional methods, namely as Interactive approach and Fuzzy programming approach. The obtained results reveal that, the applied RGA technique is more advantageous and effective after incorporating some changes according to the problem statement. This approach gives more than one compromised near-to-optimal solutions as well as bypasses the allocation rule of (m +n − 1), which is a great advantage in solving FMOTP. Two numerical examples have been considered and discussed to demonstrate this advent.","PeriodicalId":106496,"journal":{"name":"2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fuzzified Multi-Objective Transportation Problem: A Real coded Genetic Algorithm approach to the Compromised near-to-Optimal solution\",\"authors\":\"Ravi Kumar R, Radha Gupta, Karthiyayini O, Ravinder Singh Kuntal, Vatsala G A\",\"doi\":\"10.1109/ICATIECE45860.2019.9063620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article a comparative study on the effectiveness of Real-coded Genetic Algorithm (RGA) approach in finding the compromised near-to-optimal solution and to by-pass the allocation rule of (m+n−1) for a Fuzzified Multi-Objective Transportation Problem (FMOTP) is discussed. For this purpose, some benchmark problems with well-defined membership function were considered and several changes have been made in the execution of Genetic Algorithm with real codes. The performance of the RGA Approach in obtaining the compromised near-to-optimal solution is compared with the traditional methods, namely as Interactive approach and Fuzzy programming approach. The obtained results reveal that, the applied RGA technique is more advantageous and effective after incorporating some changes according to the problem statement. This approach gives more than one compromised near-to-optimal solutions as well as bypasses the allocation rule of (m +n − 1), which is a great advantage in solving FMOTP. Two numerical examples have been considered and discussed to demonstrate this advent.\",\"PeriodicalId\":106496,\"journal\":{\"name\":\"2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICATIECE45860.2019.9063620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICATIECE45860.2019.9063620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文比较研究了实数编码遗传算法(RGA)在求解模糊化多目标运输问题(FMOTP)的折衷近最优解和绕过(m+n−1)分配规则方面的有效性。为此,考虑了一些具有良好定义的隶属度函数的基准问题,并在实际代码中对遗传算法的执行进行了一些修改。将RGA方法与传统的交互式方法和模糊规划方法进行了比较,得到了折衷的近最优解。结果表明,根据问题表述进行相应的调整后,应用RGA技术更具有优势和有效性。这种方法给出了多个折衷的接近最优解,并且绕过了(m +n−1)的分配规则,这在解决FMOTP方面具有很大的优势。本文考虑并讨论了两个数值例子来证明这一点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fuzzified Multi-Objective Transportation Problem: A Real coded Genetic Algorithm approach to the Compromised near-to-Optimal solution
In this article a comparative study on the effectiveness of Real-coded Genetic Algorithm (RGA) approach in finding the compromised near-to-optimal solution and to by-pass the allocation rule of (m+n−1) for a Fuzzified Multi-Objective Transportation Problem (FMOTP) is discussed. For this purpose, some benchmark problems with well-defined membership function were considered and several changes have been made in the execution of Genetic Algorithm with real codes. The performance of the RGA Approach in obtaining the compromised near-to-optimal solution is compared with the traditional methods, namely as Interactive approach and Fuzzy programming approach. The obtained results reveal that, the applied RGA technique is more advantageous and effective after incorporating some changes according to the problem statement. This approach gives more than one compromised near-to-optimal solutions as well as bypasses the allocation rule of (m +n − 1), which is a great advantage in solving FMOTP. Two numerical examples have been considered and discussed to demonstrate this advent.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信