A new AS Algorithm to solve the zero-one knapsack problem

被引：3
|
作者：
Wang, Yuanni [1 ]
Ge, Fei [1 ]
Li, Xiang [1 ]
Zhu, Li [1 ]
机构：
[1] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Hubei, Peoples R China
来源：
PROGRESS IN INTELLIGENCE COMPUTATION AND APPLICATIONS, PROCEEDINGS | 2007年
关键词：
AS Algorithm; zero-one knapsack; optimization;
D O I：
10.1145/1321753.1321767
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
AS Algorithm has been successfully applied to solve the TSP problem and combinatorial optimization problem. For using it to solve the zero-one knapsack problem, this paper compares the difference between the zero-one knapsack and the TSP problem. It expands the scope of application to solve the zero-one knapsack problem. Meanwhile, some parameters have been optimized. The experiment indicates that the strength of the AS algorithm and the potention for solving the combinatorial optimization problems as a heuristic algorithm.
引用
收藏
页码：285 / 288
页数：4
相关论文
共 50 条
  • [1] A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem
    Chen, Qing
    Shao, Yuxiang
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL I, 2010, : 185 - 188
  • [2] A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem
    Chen, Qing
    Shao, Yuxiang
    APPLIED INFORMATICS AND COMMUNICATION, PT I, 2011, 224 : 315 - +
  • [3] A New Approach to the Restart Genetic Algorithm to Solve Zero-One Knapsack Problem
    Montazeri, Mojtaba
    Kiani, Rasoul
    Rastkhadiv, Seyed Saleh
    2017 IEEE 4TH INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED ENGINEERING AND INNOVATION (KBEI), 2017, : 50 - 53
  • [4] A HEURISTIC ALGORITHM FOR THE MULTIDIMENSIONAL ZERO-ONE KNAPSACK-PROBLEM
    MAGAZINE, MJ
    OGUZ, O
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (03) : 319 - 326
  • [5] A BOUND AND BOUND ALGORITHM FOR THE ZERO-ONE MULTIPLE KNAPSACK-PROBLEM
    MARTELLO, S
    TOTH, P
    DISCRETE APPLIED MATHEMATICS, 1981, 3 (04) : 275 - 288
  • [6] Amplitude Angle Modulated Bat Algorithm With Application to Zero-One Knapsack Problem
    Huang, Xingwang
    Li, Peijia
    Pu, Yunming
    IEEE ACCESS, 2019, 7 : 27957 - 27969
  • [7] SOLUTION OF THE ZERO-ONE MULTIPLE KNAPSACK-PROBLEM
    MARTELLO, S
    TOTH, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 4 (04) : 276 - 283
  • [8] THE ZERO-ONE KNAPSACK-PROBLEM WITH EQUALITY CONSTRAINT
    KAUFMAN, L
    PLASTRIA, F
    TUBEECKX, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 19 (03) : 384 - 389
  • [9] MERGING AND SORTING APPLIED TO ZERO-ONE KNAPSACK PROBLEM
    AHRENS, JH
    FINKE, G
    OPERATIONS RESEARCH, 1975, 23 (06) : 1099 - 1109
  • [10] A hybrid approach for the zero-one multidimensional knapsack problem
    Vasquez, M
    Hao, JK
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (04): : 415 - 438
12345