Partner selection in a manufacturing virtual enterprise based on intuitionistic fuzzy sets

Bin Huang, Liang Chen
{"title":"Partner selection in a manufacturing virtual enterprise based on intuitionistic fuzzy sets","authors":"Bin Huang, Liang Chen","doi":"10.1504/IJMTM.2014.066694","DOIUrl":null,"url":null,"abstract":"In this paper, a new method based on intuitionistic fuzzy sets is proposed to solve the partner selection problem in a manufacturing virtual enterprise. Based on the concept of average delivery time satisfaction degree, the formulated partner selection problem is interpreted so as to maximise the score of average delivery time satisfaction degree. The model takes into account the factors of average delivery time satisfaction degree, due date, cost and the precedence of tasks. To solve the problem, an improved particle swarm optimisation (PSO) algorithm is proposed. Finally, the simulation of a numerical example and comparisons with the standard PSO algorithm demonstrate that the improved PSO algorithm can effectively improve the searching quality, and the method is effective.","PeriodicalId":38792,"journal":{"name":"International Journal of Manufacturing Technology and Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Manufacturing Technology and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJMTM.2014.066694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, a new method based on intuitionistic fuzzy sets is proposed to solve the partner selection problem in a manufacturing virtual enterprise. Based on the concept of average delivery time satisfaction degree, the formulated partner selection problem is interpreted so as to maximise the score of average delivery time satisfaction degree. The model takes into account the factors of average delivery time satisfaction degree, due date, cost and the precedence of tasks. To solve the problem, an improved particle swarm optimisation (PSO) algorithm is proposed. Finally, the simulation of a numerical example and comparisons with the standard PSO algorithm demonstrate that the improved PSO algorithm can effectively improve the searching quality, and the method is effective.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于直觉模糊集的制造业虚拟企业合作伙伴选择
提出了一种基于直觉模糊集的制造虚拟企业合作伙伴选择方法。基于平均交货时间满意度的概念,对拟定的合作伙伴选择问题进行解释,使平均交货时间满意度得分最大化。该模型考虑了平均交货时间满意度、到期日、成本和任务优先级等因素。为了解决这一问题,提出了一种改进的粒子群优化算法。最后,通过数值算例的仿真以及与标准粒子群算法的比较,验证了改进粒子群算法能有效提高搜索质量,表明该方法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Manufacturing Technology and Management
International Journal of Manufacturing Technology and Management Engineering-Industrial and Manufacturing Engineering
CiteScore
0.70
自引率
0.00%
发文量
6
期刊介绍: IJMTM is a refereed and authoritative source of information in the field of manufacturing technology and management and related areas.
期刊最新文献
Simulation of EPC Consortium Partnership Stability and Data Based on Prospect Theory Building win-win value networks for product-service systems' delivery Digital Packaging Design Method of Intelligent Products Based on Internet of Things Technology An adaptive compensation control method for the transmission error of the mechanical system based on the characteristic model A path planning algorithm of intelligent transportation robot based on extended Kalman filter
×
引用
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