2015
DOI: 10.5267/j.dsl.2015.2.001
|View full text |Cite
|
Sign up to set email alerts
|

A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem

Abstract: 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 results of applying the proposed approach on some benchmark dataset appear that the proposed method was capable of providing better results in terms of time and quality of solutions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 39 publications
0
3
0
Order By: Relevance
“…However, this method did not consider the actual disassembly data. SS has successfully used to solve the mixed-model assembly line sequencing and knapsack problems [109,[111][112][113][114][115][116].…”
Section: Image Processingmentioning
confidence: 99%
“…However, this method did not consider the actual disassembly data. SS has successfully used to solve the mixed-model assembly line sequencing and knapsack problems [109,[111][112][113][114][115][116].…”
Section: Image Processingmentioning
confidence: 99%
“…In the first one with full certainty and by using knowledge B , the collection of objects is categorized as the members of the set X . In the same way, by using the knowledge that belongs to the complement of X , the collection of objects can be identified without any uncertainty (Rezazadeh, 2015).…”
Section: Rough and Grey Set Theorymentioning
confidence: 99%
“…The positive region or lower approximation of X is the collection of those objects that can be classified with full certainty as members of the set X, using knowledge B. Similarly, the negative region is the collection of objects with which it can be determined without any ambiguity, using knowledge that belongs to the compliment of X (Rezazadeh, 2015) Author…”
Section: Rough Set Theorymentioning
confidence: 99%