Sieve Optimization Method A Survey and Applications

الموضوعات

علوم تطبيقية وتكنولوجية

الملخص

In this study we deal with 0/1 knapsack problem, which is one of combinatorial problems knownas NP-hard, where one, has to maximize the benefit of objects in a knapsack without exceeding itscapacity. We have done a survey and implementation of this approach, known as Sieve approach isbased on the sieving operation idea used to sift grains by translating it on an algorithmic tool. Wheregenerates randomly and iteratively a great number of feasible solutions by batches. The implementationis done on a 0/1 knapsack problem and the results are compared to show the approach efficiency. Thefindings show that our proposed method can give better solutions in large instances items than othermethod in combinatorial optimization. The performance of our approach has been tested on well-knowndataset.

روابط وملفات

التعريف والنوع

رقم الوثيقة

0c05e01c-59ab-419e-9c25-b26763dc2f96

رقم العقد

0

نوع الوسائط

Crawler

نوع المحتوى

الرسائل العلمية

صيغة المصدر

ماستر (LMD)

نوع الملف

pdf text

أسماء الملفات

191710_1.pdf

بيانات النشر

ألقاب المؤلفين

[{"name_ar":"Allaoua Hemmak","title_ar":"اشراف","title_en":"Supervision"},{"name_ar":"Brahim Bouderah","title_ar":"اشراف","title_en":"Supervision"},{"name_ar":"Sara Bouchareb","title_ar":"اعداد","title_en":"Preparation"}]

اللغة

English

المصدر والدورية

اسم المصدر

Sieve Optimization Method A Survey and Applications

المحتوى والصفحات

عدد الصفحات

0

إشراف وإعداد

الإشراف

Allaoua Hemmak, Brahim Bouderah

الإعداد

Sara Bouchareb

الاقتباسات الببليوغرافية