Hybrid Heuristic Algorithm for the Multidimensional Knapsack Problem

被引：0
|
作者：
Atilgan, Can [1 ]
Nuriyev, Urfat [1 ]
机构：
[1] Ege Univ, Izmir, Turkey
来源：
2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI) | 2012年
关键词：
Knapsack problem; Boolean variables; hybrid heuristic; greedy algorithm; core approach;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this work, a new hybrid heuristic algorithm for the 0/1 multidimensional knapsack problem is proposed. In the algorithm, Lagrange multipliers for every constraint are determined to reduce the problem to single dimension and some initial solutions are obtained with greedy algorithms. Then, these solutions are improved with iterative procedures. In order to test efficiency of the algorithm, computational experiments were done on some library problems in literature. It was observed that the algorithm has high efficiency in terms of solutions and time.
引用
收藏
页数：4
相关论文
共 50 条
  • [1] A hybrid heuristic for the multiple choice multidimensional knapsack problem
    Mansi, Raid
    Alves, Claudio
    Valerio de Carvalho, J. M.
    Hanafi, Said
    [J]. ENGINEERING OPTIMIZATION, 2013, 45 (08) : 983 - 1004
  • [2] A New Hybrid Algorithm for the Multidimensional Knapsack Problem
    Zhang, Xiaoxia
    Liu, Zhe
    Bai, Qiuying
    [J]. BIO-INSPIRED COMPUTING AND APPLICATIONS, 2012, 6840 : 191 - 198
  • [3] A HEURISTIC ALGORITHM FOR THE MULTIDIMENSIONAL ZERO-ONE KNAPSACK-PROBLEM
    MAGAZINE, MJ
    OGUZ, O
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (03) : 319 - 326
  • [4] BPSOBDE: A Binary Version of Hybrid Heuristic Algorithm for Multidimensional Knapsack Problems
    Zhang, Li
    Li, Hong
    [J]. 2017 13TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2017, : 54 - 58
  • [5] A randomized heuristic repair for the multidimensional knapsack problem
    Martins, Jean P.
    Ribas, Bruno C.
    [J]. OPTIMIZATION LETTERS, 2021, 15 (02) : 337 - 355
  • [6] A randomized heuristic repair for the multidimensional knapsack problem
    Jean P. Martins
    Bruno C. Ribas
    [J]. Optimization Letters, 2021, 15 : 337 - 355
  • [7] A hybrid distribution estimation algorithm for solving multidimensional knapsack problem
    Wang, Ling
    Wang, Sheng-Yao
    Fang, Chen
    [J]. Kongzhi yu Juece/Control and Decision, 2011, 26 (08): : 1121 - 1125
  • [8] A new heuristic for solving the multichoice multidimensional knapsack problem
    Parra-Hernández, R
    Dimopoulos, NJ
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2005, 35 (05): : 708 - 717
  • [9] A Genetic Algorithm for the Multidimensional Knapsack Problem
    P.C. Chu
    J.E. Beasley
    [J]. Journal of Heuristics, 1998, 4 : 63 - 86
  • [10] A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem
    Garcia, Jose
    Moraga, Paola
    Valenzuela, Matias
    Pinto, Hernan
    [J]. MATHEMATICS, 2020, 8 (04)
12345