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 条
  • [41] A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack Problem
    Xia, Youxin
    Gao, Chao
    Li, JinLong
    [J]. BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 : 513 - 522
  • [42] Hybrid Genetic Algorithm for Solving Knapsack Problem
    Tharanipriya, P. G.
    Vishnuraja, P.
    [J]. 2013 INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND EMBEDDED SYSTEMS (ICICES), 2013, : 416 - 420
  • [43] A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem
    Haddar, Boukthir
    Khemakhem, Mahdi
    Hanafi, Said
    Wilbaut, Christophe
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 55 : 1 - 13
  • [44] A hybrid approach for the zero-one multidimensional knapsack problem
    Vasquez, M
    Hao, JK
    [J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (04): : 415 - 438
  • [45] A discrete binary version of bat algorithm for multidimensional knapsack problem
    Sabba, Sara
    Chikhi, Salim
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2014, 6 (02) : 140 - 152
  • [46] A new ant colony optimization algorithm for the multidimensional Knapsack problem
    Kong, Min
    Tian, Peng
    Kao, Yucheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) : 2672 - 2683
  • [47] RECURSIVE BRANCH AND BOUND ALGORITHM FOR THE MULTIDIMENSIONAL KNAPSACK PROBLEM.
    Thesen, Arne
    [J]. Naval Research Logistics, 1975, 22 (02): : 341 - 353
  • [48] A new hybrid combinatorial genetic algorithm for multidimensional knapsack problems
    Guoming Lai
    Dehui Yuan
    Shenyun Yang
    [J]. The Journal of Supercomputing, 2014, 70 : 930 - 945
  • [49] An efficient binary differential evolution algorithm for the multidimensional knapsack problem
    Yichao He
    Xinlu Zhang
    Wenbin Li
    Jinghong Wang
    Ning Li
    [J]. Engineering with Computers, 2021, 37 : 745 - 761
  • [50] An efficient binary differential evolution algorithm for the multidimensional knapsack problem
    He, Yichao
    Zhang, Xinlu
    Li, Wenbin
    Wang, Jinghong
    Li, Ning
    [J]. ENGINEERING WITH COMPUTERS, 2021, 37 (01) : 745 - 761
12345