A hybrid of rough sets and genetic algorithms for solving the 0-1 multidimensional knapsack problem

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

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

题名:	A hybrid of rough sets and genetic algorithms for solving the 0-1 multidimensional knapsack problem
作者:	楊旭豪
贡献者:	工業工程與(工程)管理系
日期:	2013-09
上传时间:	2017-09-30 13:16:59 (UTC+8)
摘要:	The multidimensional 0-1 knapsack problem (MKP) is a well-known NP-hard combinatorial optimization problem. This paper uses a methodology that integrates a reduct of rough sets (RS) into the crossover operator of a genetic algorithm (GA) to solve the MKP. Two algorithms are presented in this paper; one selects the crossover points either randomly or via the reduct, whereas the other selects the crossover points solely by the reduct. The performance of these two algorithms was compared with a standard GA using test cases from the literature. According to the experimental results, this integration obtains both better quality and more clustered solutions, and could possibly improve the performance if some mechanisms are developed in the algorithm. The results justify the integration and demonstrate an alternative for improving the performance of the GA. © 2013 ISSN 1349-4198. (23 refs)
關聯:	International Journal of Innovative Computing Information and Control
显示于类别:	[工業工程與管理系(所)] 【工業工程與管理系所】期刊論文

文件中的档案:

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

检视Licence

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