Ants and multiple knapsack problem

被引：5
|
作者：
Boryczka, Urszula [1 ]
机构：
[1] Univ Silesia, Inst Comp Sci, Bedzinska 39, Sosnowiec, Poland
来源：
6TH INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT APPLICATIONS, PROCEEDINGS | 2007年
关键词：
ant colony optimization; multiple knapsack problem; combinatorial optimization;
D O I：
10.1109/CISIM.2007.12
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper a new optimization algorithm based on ant colony metaphor (ACO)and a new approach for the Multiple Knapsack Problem is presented. The MKP is the problem of assigning a subset of n items to m distinct knapsacks, such that the total profit sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several difficulties in adaptation as well as the trail representation of the solutions of MKP or a dynamically changed heuristic function applied in this approach. Presented results show the power of the ACO approach for solving this type of subset problems.
引用
收藏
页码：149 / +
页数：2
相关论文
共 50 条
  • [1] A PTAS for the multiple knapsack problem
    Chekuri, C
    Khanna, S
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 213 - 222
  • [2] MULTIPLE-CHOICE KNAPSACK PROBLEM
    SINHA, P
    ZOLTNERS, AA
    OPERATIONS RESEARCH, 1979, 27 (03) : 503 - 533
  • [3] Learning from the opposite: Strategies for Ants that solve Multidimensional Knapsack Problem
    Rojas-Morales, Nicolas
    Maria-Cristina Riff, R.
    Elizabeth Montero, U.
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 193 - 200
  • [4] Multiple criteria dynamic programming and multiple knapsack problem
    Sitarz, Sebastian
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 228 : 598 - 605
  • [5] Parameterized Approximation Scheme for the Multiple Knapsack Problem
    Jansen, Klaus
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 665 - 674
  • [6] A successive approximation algorithm for the multiple knapsack problem
    Zhenbo Wang
    Wenxun Xing
    Journal of Combinatorial Optimization, 2009, 17 : 347 - 366
  • [7] A new upper bound for the multiple knapsack problem
    Detti, Paolo
    COMPUTERS & OPERATIONS RESEARCH, 2021, 129
  • [8] Evolutionary game algorithm for multiple knapsack problem
    Jun, Y
    Liu, XD
    Lu, H
    IEEE/WIC INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS, 2003, : 424 - 427
  • [9] Strategic oscillation for the quadratic multiple knapsack problem
    Carlos García-Martínez
    Fred Glover
    Francisco J. Rodriguez
    Manuel Lozano
    Rafael Martí
    Computational Optimization and Applications, 2014, 58 : 161 - 185
  • [10] Multiple knapsack problem for racking selection model
    Anbiyaa, Danan
    Setyawan, Erlangga Bayu
    Purba, Humiras Hardi
    TARUMANAGARA INTERNATIONAL CONFERENCE ON THE APPLICATIONS OF TECHNOLOGY AND ENGINEERING, 2019, 508
12345