{"title":"基于智能水滴算法的模糊多公司分配问题","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":"{\"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}","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
摘要
本文提出了一种求解模糊多公司员工分配问题(FMAP)的元启发式方法。本文试图在制造业和服务业中寻找效率最高、成本最低的最优解决方案。在FMAP问题中，$n$工作分配给$m$工人，这些工人从$K$公司中选择$(m > n)$;每个工作只能分配给一个工作人员，每个工作人员可以接收一个工作，也可以不接收任何工作。最后，为了获得总成本的最优解，我们设计了智能水滴(Intelligent Water Drops, IWD)算法。
Fuzzy Multi-Company Assignment Problem Using Intelligent Water Drops Algorithms
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
