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
关键词
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 条
  • [41] Improved ant colony optimization algorithm and its application to solve pipe routing design
    Wu, Lei
    Tian, Xue
    Wang, Hongyan
    Liu, Qi
    Xiao, Wensheng
    ASSEMBLY AUTOMATION, 2019, 39 (01) : 45 - 57
  • [42] 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
  • [43] Probabilistic model of ant colony optimization for Multiple Knapsack Problem
    Fidanova, Stefka
    LARGE-SCALE SCIENTIFIC COMPUTING, 2008, 4818 : 545 - 552
  • [44] Bee colony algorithm for the Multidimensional Knapsack Problem
    Nhicolaievna, Papova Nhina
    Van Thanh, Le
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 84 - 88
  • [45] An integrated ant colony optimization algorithm to solve job allocating and tool scheduling problem
    Zhang, Xu
    Wang, Shilong
    Yi, Lili
    Xue, Hong
    Yang, Songsong
    Xiong, Xin
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2018, 232 (01) : 172 - 182
  • [46] A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem
    Yuelin Gao
    Hongguang Wu
    Wanting Wang
    Applied Intelligence, 2023, 53 : 7326 - 7342
  • [47] A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem
    Gao, Yuelin
    Wu, Hongguang
    Wang, Wanting
    APPLIED INTELLIGENCE, 2023, 53 (06) : 7326 - 7342
  • [48] A Hybrid Ant Colony and Genetic Algorithm to solve the Container Stacking Problem at Seaport Terminal
    Ndiaye, Ndeye Fatma
    Yassine, Adnan
    Diarrassouba, Ibrahima
    2014 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS & TRANSPORT (ICALT 2014), 2014, : 247 - 252
  • [49] Experimental estimate of using the ant colony optimization algorithm to solve the routing problem in FANET
    Maistrenko, Vasily A.
    Alexey, Leonov V.
    Danil, Volkov A.
    2016 INTERNATIONAL SIBERIAN CONFERENCE ON CONTROL AND COMMUNICATIONS (SIBCON), 2016,
  • [50] The ant colony optimal algorithm based on neighborhood search to solve the traveling salesman problem
    Pang, Huanli
    Li, Yonghe
    Song, Xianmin
    INFORMATION TECHNOLOGY AND COMPUTER APPLICATION ENGINEERING, 2014, : 41 - 44