Solving the 0/1 knapsack problem using rough sets and genetic algorithms

勤益科大機構典藏 > 管理學院 > 工業工程與管理系(所) > 【工業工程與管理系所】期刊論文 > Item 987654321/6842

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/6842

题名:	Solving the 0/1 knapsack problem using rough sets and genetic algorithms
作者:	楊旭豪
贡献者:	工業工程與(工程)管理系
日期:	2011-07
上传时间:	2017-12-17 11:04:33 (UTC+8)
摘要:	This article proposes a methodology that introduces attribute reduction of rough sets into crossover of genetic algorithms (GAs), and then uses the methodology to develop two algorithms. The first algorithm selects the crossover points, either by attribute reduction or randomly; the second selects the crossover points solely by attribute reduction, with no crossover otherwise. We test the methodology on the solving of the 0/1 knapsack problem, due to the problem's NP-hard complexity, and we compare the experiment results to those of typical GAs. According to the results, the introduction of attribute reduction increases the mean and decreases the standard deviation of the final solutions, especially in the presence of tighter capacity, i.e. attribution reduction leads to better solution quality and more tightly clustered solutions. Moreover, the mean number of iterations required to terminate the algorithm and that required to reach maximal profits are significantly reduced.
關聯:	Journal of the Chinese Institute of Industrial Engineers
显示于类别:	[工業工程與管理系(所)] 【工業工程與管理系所】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

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