An improved ant colony algorithm to solve knapsack problem

被引：0
|
作者：
Li Shuang [1 ,2 ]
Wang Shuliang [3 ]
Zhang Qiuming [1 ]
机构：
[1] China Univ Geosci, Sch Comp, Wuhan 430074, Peoples R China
[2] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430072, Peoples R China
[3] Wuhan Univ, Int Sch Software, Wuhan 430072, Peoples R China
来源：
GEOINFORMATICS 2006: REMOTELY SENSED DATA AND INFORMATION | 2006年 / 6419卷
关键词：
ant colony optimization algorithm; Knapsack Problem; evolutionary computing;
D O I：
10.1117/12.713269
中图分类号：
TP7 [遥感技术];
学科分类号：
081102 ; 0816 ; 081602 ; 083002 ; 1404 ;
摘要：
Ant colony optimization algorithm is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems. In this paper the algorithm is used for solving the knapsack problem. It is improved in selection strategy and information modification, so that it can not easily run into the local optimum and can converge at the global optimum. The experiments show the robustness and the potential power of this kind of meta heuristic algorithm.
引用
收藏
页数：7
相关论文
共 50 条
  • [1] Solution to 0/1 knapsack problem based on improved ant colony algorithm
    Shi Han-xiao
    [J]. Proceedings of 2005 Chinese Control and Decision Conference, Vols 1 and 2, 2005, : 955 - +
  • [2] Solution to 0/1 knapsack problem based on improved ant colony algorithm
    Shi, Hanxiao
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON INFORMATION ACQUISITION, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2006, : 1062 - 1066
  • [3] Improved ant colony algorithm to solve UUV cluster task planning problem
    Wang H.
    E X.
    Zhang K.
    Yi D.
    Niu S.
    [J]. Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2022, 43 (09): : 238 - 254
  • [4] 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,
  • [5] 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
  • [6] Using the Improved Ant Colony Algorithm to Solve the Chinese TSP
    Sun Jing
    Bai Yan-ping
    Hu Hong-ping
    Lu Jin-na
    [J]. PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION ENGINEERING, 2014, 111 : 116 - 119
  • [7] A Modified Ant Colony Algorithm to Solve the Shortest Path Problem
    Yuan, Yabo
    Liu, Yi
    Wu, Bin
    [J]. 2014 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTERNET OF THINGS (CCIOT), 2014, : 148 - 151
  • [8] Design of Ant Colony - based algorithm Ant Route for solve the OSPF problem
    Tupia Anticona, Manuel
    Estrada Villegas, Carina
    [J]. CERMA 2007: ELECTRONICS, ROBOTICS AND AUTOMOTIVE MECHANICS CONFERENCE, PROCEEDINGS, 2007, : 386 - +
  • [9] Research on an Improved Optimization Algorithm Based on Ant Colony to Solve WBC Scanning Routing Problem
    Sun, Minglei
    Wang, Qiwei
    Xie, Quanxian
    [J]. 2013 ICME INTERNATIONAL CONFERENCE ON COMPLEX MEDICAL ENGINEERING (CME), 2013, : 76 - 79
  • [10] A new ant colony optimization for the knapsack problem
    Zhao, Peiyi
    Zhao, Peixin
    Zhang, Xin
    [J]. 7TH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED INDUSTRIAL DESIGN & CONCEPTUAL DESIGN, 2006, : 219 - 221
12345