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

NCUTIR > College of Management > Development of Industrial Engineering and Management > 【工業工程與管理系所】期刊論文 > Item 987654321/6202

Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/6202

Title:	A hybrid of rough sets and genetic algorithms for solving the 0-1 multidimensional knapsack problem
Authors:	楊旭豪
Contributors:	工業工程與(工程)管理系
Date:	2013-09
Issue Date:	2017-09-30 13:16:59 (UTC+8)
Abstract:	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)
Relation:	International Journal of Innovative Computing Information and Control
Appears in Collections:	[Development of Industrial Engineering and Management] 【工業工程與管理系所】期刊論文

Files in This Item:

There are no files associated with this item.

View Licence