Meta-Heuristics Approach to Knapsack Problem in Memory Management
Emmanuel Ofori Oppong, Stephen Opoku Oppong, Dominic Asamoah, Nuku Atta Kordzo Abiew
Asian Journal of Research in Computer Science · pp. 1–10 · Published 6 Apr 2019
10.9734/ajrcos/2019/v3i230087Abstract
The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset of items whose weight sum does not exceed a prescribed capacity and whose value is maximum. The classical 0-1 Knapsack Problem arises when there is one knapsack and one item of each type. This paper considers the application of classical 0-1 knapsack problem with a single constraint to computer memory management. The goal is to achieve higher efficiency with memory management in computer systems. This study focuses on using simulated annealing and genetic algorithm for the solution of knapsack problems in optimizing computer memory. It is shown that Simulated Annealing performs better than the Genetic Algorithm for large number of processes.
Cited by 13
Mohamed Abdel-Basset, Reda Mohamed, Seyedali Mirjalili · Computers & industrial engineering · 2020
Rui Wang, Weixu Zong, Shui-Bing He · USENIX Annual Technical Conference · 2024
Adel Sulaiman, Marium Sadiq, Yasir Mehmood · Symmetry · 2022
Related research
- An Intelligent Tuned Harmony Search Algorithm for Optimum Design of Steel Framed Structures to AISC-LRFD — shares topic coverage
- A Genetic Algorithm with Neighborhood Search to Solve Integer and Linear Programming Problems — shares topic coverage
- An Optimized Genetic Approach for Scheduling Task Duplication in Parallel Systems — shares topic coverage
- Genetic Algorithm Based on K-means-Clustering Technique for Multi-objective Resource Allocation Problems — shares topic coverage
- A Genetic Algorithm in Green Cloud Computing — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
13
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.