Interactive permutation decision making based on genetic algorithm

M. Bashiri, M. Jalili
{"title":"Interactive permutation decision making based on genetic algorithm","authors":"M. Bashiri, M. Jalili","doi":"10.1109/IEEM.2010.5674427","DOIUrl":null,"url":null,"abstract":"Multiple Attribute Decision Making (MADM) is an important part of decision science which helps us to select a preferred alternative among many alternatives which are compared with conflicting criteria. So, many solution approaches have been introduced such as permutation method; Interactive Simple Additive Weighting Method (ISAW) an etc. The time of the solution is sensitive to the size of the problem (numbers of alternatives and criteria), so by using meta heuristic we are trying to conquer this problem. In this paper, first we want to find an initial solution with permutation method based on genetic algorithm then by using ISAW method we try to propose proper exchanges in each iteration. By the proposed approach we can find the best permutation of alternatives by improved Genetic Algorithm. Finally the proposed approach will be illustrated more by some numerical examples.","PeriodicalId":285694,"journal":{"name":"2010 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2010.5674427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Multiple Attribute Decision Making (MADM) is an important part of decision science which helps us to select a preferred alternative among many alternatives which are compared with conflicting criteria. So, many solution approaches have been introduced such as permutation method; Interactive Simple Additive Weighting Method (ISAW) an etc. The time of the solution is sensitive to the size of the problem (numbers of alternatives and criteria), so by using meta heuristic we are trying to conquer this problem. In this paper, first we want to find an initial solution with permutation method based on genetic algorithm then by using ISAW method we try to propose proper exchanges in each iteration. By the proposed approach we can find the best permutation of alternatives by improved Genetic Algorithm. Finally the proposed approach will be illustrated more by some numerical examples.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的交互式排列决策
多属性决策(MADM)是决策科学的一个重要组成部分,它可以帮助我们从众多具有冲突标准的备选方案中选择出最优的方案。因此,引入了许多求解方法,如置换法;交互式简单相加加权法(ISAW)等。解决方案的时间对问题的大小(备选方案和标准的数量)很敏感,所以通过使用元启发式,我们试图克服这个问题。本文首先利用基于遗传算法的置换方法求初始解,然后利用ISAW方法在每次迭代中提出适当的交换。该方法可以通过改进的遗传算法找到备选方案的最佳排列。最后将通过一些数值算例进一步说明所提出的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Standard Activity Measurement Plan Towards a knowledge-based taxonomy for value creation patterns in professional service firms: Cases of law firms in People's Republic of China Admission control of an M/M/1 queue with multiple deterioration states Compositive support system and evaluation system study on engineering equipment's use course management Evaluation of the solution for an optimal shelf allocation for SPA retailers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1