Bee colony algorithm for the Multidimensional Knapsack Problem

被引：0
|
作者：
Nhicolaievna, Papova Nhina [1 ]
Van Thanh, Le [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Moscow, Russia
来源：
IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II | 2008年
关键词：
Bee Colony Optimization; Multidimensional Knapsack Problem;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we present a new algorithm based on the Bee Colony Optimization (BCO) meta-heuristic for the Multidimensional Knapsack Problem (MKP), the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource constraints. We show that our new algorithm obtains better results than Ant Colony Optimization algorithms and on most instances it reaches best known solutions. Especially we propose an efficient algorithm to produce randomly new solutions.
引用
收藏
页码：84 / 88
页数：5
相关论文
共 50 条
  • [41] RECURSIVE BRANCH AND BOUND ALGORITHM FOR THE MULTIDIMENSIONAL KNAPSACK PROBLEM.
    Thesen, Arne
    [J]. Naval Research Logistics, 1975, 22 (02): : 341 - 353
  • [42] 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
  • [43] 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
  • [44] 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
  • [45] A Fast Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem
    Bonyadi, Mohammad Reza
    Michalewicz, Zbigniew
    [J]. 2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [46] Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm
    Mkaouar, Arij
    Htiouech, Skander
    Chabchoub, Habib
    [J]. 2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [47] Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem
    Fidanova, Stefka
    [J]. 2020 5TH IEEE INTERNATIONAL CONFERENCE ON RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (IEEE - ICRAIE-2020), 2020,
  • [48] A CUDA Based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization
    Fingler, Henrique
    Caceres, Edson N.
    Mongelli, Henrique
    Song, Siang W.
    [J]. 2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2014, 29 : 84 - 94
  • [49] Solving a timetabling problem with an artificial bee colony algorithm
    Chen, Tinggui
    Xu, Chonghuan
    [J]. World Transactions on Engineering and Technology Education, 2015, 13 (03): : 438 - 442
  • [50] A Discrete Artificial Bee Colony Algorithm for TSP Problem
    Li, Li
    Chong, Yurong
    Tan, Lijing
    Niu, Ben
    [J]. BIO-INSPIRED COMPUTING AND APPLICATIONS, 2012, 6840 : 566 - +
12345