A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
This paper presents a new search methodology for different sizes of 0-1 Knapsack Problem (KP). The proposed methodology uses a modified scatter search as a meta-heuristic algorithm. Moreover, rough set theory is implemented to improve the initial features of scatter search. Thereby, the preliminary...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2015-07-01
|
Series: | Decision Science Letters |
Subjects: | |
Online Access: | http://www.growingscience.com/dsl/Vol4/dsl_2015_6.pdf |