Comparative Study Of Metaheuristic Algorithms Using Knapsack Problem

被引：0
|
作者：
Sapra, Dikscha [1 ]
Sharma, Rashi [1 ]
Agarwal, Arun Prakash [2 ]
机构：
[1] AUUP, ASET, Dept CSE, Noida, India
[2] AUUP, Amity Sch Engn & Technol, Noida, India
来源：
PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, DATA SCIENCE AND ENGINEERING (CONFLUENCE 2017) | 2017年
关键词：
Metaheuristic algorithms; Knapsack Problem; Local Search; Tabu Search; Scatter Search;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper aims to discuss and compare various metaheuristic algorithms applied to the "Knapsack Problem". The Knapsack Problem is a combinatorial optimization maximization problem which requires to find the number of each weighted item to be included in a hypothetical knapsack, so the total weight is less than or equal to the required weight. To come to an optimized solution for such a problem, a variety of algorithms can possibly be used. In this paper, Tabu Search, Scatter Search and Local Search algorithms are compared taking execution time, solution quality and relative difference to best known quality, as metrics to compute the results of this NP-hard problem.
引用
收藏
页码：134 / 137
页数：4
相关论文
共 50 条
  • [1] Comparative Study of Several Intelligent Algorithms for Knapsack Problem
    Zhang, Jing
    [J]. 2011 2ND INTERNATIONAL CONFERENCE ON CHALLENGES IN ENVIRONMENTAL SCIENCE AND COMPUTER ENGINEERING (CESCE 2011), VOL 11, PT A, 2011, 11 : 163 - 168
  • [2] Construction Site Layout Planning Problem Using Metaheuristic Algorithms: A Comparative Study
    Kaveh, Ali
    Vazirinia, Yasin
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF CIVIL ENGINEERING, 2019, 43 (02) : 105 - 115
  • [3] Construction Site Layout Planning Problem Using Metaheuristic Algorithms: A Comparative Study
    Ali Kaveh
    Yasin Vazirinia
    [J]. Iranian Journal of Science and Technology, Transactions of Civil Engineering, 2019, 43 : 105 - 115
  • [4] Recent metaheuristic algorithms with genetic operators for high-dimensional knapsack instances: A comparative study
    Abdel-Basset, Mohamed
    Mohamed, Reda
    Elkomy, Osama M.
    Abouhawwash, Mohamed
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 166
  • [5] Comparative study between exact and metaheuristic approaches for virtual machine placement process as knapsack problem
    Saloua El Motaki
    Ali Yahyaouy
    Hamid Gualous
    Jalal Sabor
    [J]. The Journal of Supercomputing, 2019, 75 : 6239 - 6259
  • [6] Comparative study between exact and metaheuristic approaches for virtual machine placement process as knapsack problem
    El Motaki, Saloua
    Yahyaouy, Ali
    Gualous, Hamid
    Sabor, Jalal
    [J]. JOURNAL OF SUPERCOMPUTING, 2019, 75 (10): : 6239 - 6259
  • [7] A hybrid metaheuristic for the Knapsack Problem with Forfeits
    Giovanni Capobianco
    Ciriaco D’Ambrosio
    Luigi Pavone
    Andrea Raiconi
    Gaetano Vitale
    Fabio Sebastiano
    [J]. Soft Computing, 2022, 26 : 749 - 762
  • [8] A hybrid metaheuristic for the Knapsack Problem with Forfeits
    Capobianco, Giovanni
    D'Ambrosio, Ciriaco
    Pavone, Luigi
    Raiconi, Andrea
    Vitale, Gaetano
    Sebastiano, Fabio
    [J]. SOFT COMPUTING, 2022, 26 (02) : 749 - 762
  • [9] Solving 0/1 Knapsack Problem Using Metaheuristic Techniques
    Adeyemo, Hayatullahi
    Ahmed, Moataz
    [J]. 2017 9TH IEEE-GCC CONFERENCE AND EXHIBITION (GCCCE), 2018, : 62 - 67
  • [10] A comparative study of metaheuristic algorithms for Dartboard Design
    Trichas, Ioannis
    Drosos, Christos
    Vlachos, Aristidis
    [J]. 5TH INTERNATIONAL CONFERENCE ON INFORMATION, INTELLIGENCE, SYSTEMS AND APPLICATIONS, IISA 2014, 2014, : 403 - +
12345