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 条
  • [21] Greedy algorithm for the general multidimensional knapsack problem
    Akcay, Yalcin
    Li, Haijun
    Xu, Susan H.
    ANNALS OF OPERATIONS RESEARCH, 2007, 150 (01) : 17 - 29
  • [22] Guided genetic algorithm for the multidimensional knapsack problem
    Abdellah Rezoug
    Mohamed Bader-El-Den
    Dalila Boughaci
    Memetic Computing, 2018, 10 : 29 - 42
  • [23] Competitive Decision Algorithm for Multidimensional Knapsack Problem
    Xiong Xiao-hua
    Ning Ai-bing
    Ma Liang
    Wang An-bao
    2009 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (16TH), VOLS I AND II, CONFERENCE PROCEEDINGS, 2009, : 161 - +
  • [24] Hybrid Heuristic Algorithm for the Multidimensional Knapsack Problem
    Atilgan, Can
    Nuriyev, Urfat
    2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI), 2012,
  • [25] Discrete Artificial Bee Colony Algorithm for Multiple Knapsack Problems
    Wei, Xinhong
    Zhang, Kai
    PROCEEDINGS OF THE 4TH CONFERENCE ON SYSTEMS SCIENCE, MANAGEMENT SCIENCE AND SYSTEMS DYNAMICS, SSMSSD10, VOL 4, 2011, : 123 - 126
  • [26] Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem
    Ren Z.-G.
    Zhao S.-Y.
    Huang S.-S.
    Liang Y.-S.
    Ren, Zhi-Gang (renzg@mail.xjtu.edu.cn), 1600, Northeast University (31): : 1178 - 1184
  • [27] On the performance of the Ant Colony System for solving the multidimensional knapsack problem
    Parra-Hernández, R
    Dimopoulos, N
    2003 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS, AND SIGNAL PROCESSING, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2003, : 338 - 341
  • [28] A new ant colony optimization applied for the multidimensional knapsack problem
    Kong, Min
    Tian, Peng
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 142 - 149
  • [29] An Ant Colony Optimization algorithm for solving the Multidimensional Knapsack Problems
    Ji, Junzhoug
    Huang, Zhen
    Liu, Chunnian
    Liu, Xuejing
    Zhong, Ning
    PROCEEDINGS OF THE IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY (IAT 2007), 2007, : 10 - +
  • [30] A quantum artificial bee colony algorithm based on quantum walk for the 0-1 knapsack problem
    Huang, Yuwei
    Zhou, Tianai
    Xu, Gang
    Wang, Lefeng
    Lu, Yong
    Ma, Li
    Zhang, Kejia
    Chen, Xiu-bo
    PHYSICA SCRIPTA, 2024, 99 (09)
12345