Using fuzzy numbers in knapsack problems

文化大學機構典藏 CCUR > 理工學院 > 理學院 > 應數系 > 期刊論文 > Item 987654321/3020

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/3020

题名:	Using fuzzy numbers in knapsack problems
作者:	Lin FT Yao JS
贡献者:	應數系
关键词:	fuzzy sets optimization knapsack problem multiconstraint 0/1 knapsack problem signed distance ranking
日期:	2001
上传时间:	2009-12-11 12:07:55 (UTC+8)
摘要:	This paper investigates knapsack problems in which all of the weight coefficients are fuzzy numbers. This work is based on the assumption that each weight coefficient is imprecise due to the use of decimal truncation or rough estimation of the coefficients by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. Our work intends to extend the original knapsack problem into a more generalized problem that would be useful in practical situations. As a result, our study shows that the fuzzy knapsack problem is an extension of the crisp knapsack problem, and that the crisp knapsack problem is a special case of the fuzzy knapsack problem. (C) 2001 Elsevier Science B.V. All rights reserved.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH Volume: 135 Issue: 1 Pages: 158-176
显示于类别:	[應數系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	Text	510	检视/开启

在CCUR中所有的数据项都受到原著作权保护.