Fuzzy Multi-Company Assignment Problem Using Intelligent Water Drops Algorithms

M. Esmaeili
{"title":"Fuzzy Multi-Company Assignment Problem Using Intelligent Water Drops Algorithms","authors":"M. Esmaeili","doi":"10.1109/CFIS49607.2020.9238734","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a new Meta-heuristic technique for solving fuzzy multi-company workers assignment problem (FMAP). This study tries to discover an optimal sloution with maximum-efficacity and minimum-cost, in manufacturing and services. In the FMAP problem, $n$ jobs are alloted to $m$ workers, which is selected from $K$ company, $(m > n)$; each job can be alloted only to one worker and each worker can either recive one job or not any jobs at all. Finally, To obtain the optimal solution to total cost, we design Intelligent Water Drops (IWD)s algorithms.","PeriodicalId":128323,"journal":{"name":"2020 8th Iranian Joint Congress on Fuzzy and intelligent Systems (CFIS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 8th Iranian Joint Congress on Fuzzy and intelligent Systems (CFIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CFIS49607.2020.9238734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we proposed a new Meta-heuristic technique for solving fuzzy multi-company workers assignment problem (FMAP). This study tries to discover an optimal sloution with maximum-efficacity and minimum-cost, in manufacturing and services. In the FMAP problem, $n$ jobs are alloted to $m$ workers, which is selected from $K$ company, $(m > n)$; each job can be alloted only to one worker and each worker can either recive one job or not any jobs at all. Finally, To obtain the optimal solution to total cost, we design Intelligent Water Drops (IWD)s algorithms.
基于智能水滴算法的模糊多公司分配问题
本文提出了一种求解模糊多公司员工分配问题(FMAP)的元启发式方法。本文试图在制造业和服务业中寻找效率最高、成本最低的最优解决方案。在FMAP问题中,$n$工作分配给$m$工人,这些工人从$K$公司中选择$(m > n)$;每个工作只能分配给一个工作人员,每个工作人员可以接收一个工作,也可以不接收任何工作。最后,为了获得总成本的最优解,我们设计了智能水滴(Intelligent Water Drops, IWD)算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信