Solving the knapsack problem with imprecise weight coefficients using genetic algorithms

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

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

题名:	Solving the knapsack problem with imprecise weight coefficients using genetic algorithms
作者:	Lin, Feng-Tse
贡献者:	應數系
关键词:	genetic algorithms fuzzy sets knapsack problem fuzzy knapsack problem
日期:	2008
上传时间:	2009-11-06 15:44:37 (UTC+8)
摘要:	This paper investigates solving the knapsack problem with imprecise weight coefficients using genetic algorithms. This work is based on the assumption that each weight coefficient is imprecise due to decimal truncation or coefficient rough estimation by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. We investigate the possibility of using genetic algorithms in solving the fuzzy knapsack problem without defining membership functions for each imprecise weight coefficient. The proposed approach simulates a fuzzy number by distributing it into some partition points. We use genetic algorithms to evolve the values in each partition point so that the final values represent the membership grade of a fuzzy number. The empirical results show that the proposed approach can obtain very good solutions within the given bound of each imprecise weight coefficient than the fuzzy knapsack approach. The fuzzy genetic algorithm concept approach is different, but gives better results than the traditional fuzzy approach. (c) 2007 Elsevier B.V. All rights reserved.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH Volume: 185 Issue: 1 Pages: 133-145
显示于类别:	[應數系] 期刊論文

文件中的档案:

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

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

数据加载中.....