A best-path-updating information-guided ant colony optimization algorithm

被引：80
|
作者：
Ning, Jiaxu [1 ]
Zhang, Qin [1 ]
Zhang, Changsheng [1 ]
Zhang, Bin [1 ]
机构：
[1] Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Liaoning, Peoples R China
来源：
INFORMATION SCIENCES | 2018年 / 433卷
关键词：
Ant colony optimization; Swarm intelligence; Pheromone update mechanism; Pheromone smoothing mechanism; Constraint satisfaction problem; Traveling salesman problem; CONSTRAINT-SATISFACTION PROBLEMS; NEGATIVE-FEEDBACK;
D O I：
10.1016/j.ins.2017.12.047
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The ant colony optimization (ACO) algorithm is a type of classical swarm intelligence algorithm that is especially suitable for combinatorial optimization problems. To further improve the convergence speed without affecting the solution quality, in this paper, a novel strengthened pheromone update mechanism is designed that strengthens the pheromone on the edges, which had never been done before, utilizing dynamic information to perform path optimization. In addition, to enhance the global search capability, a novel pheromone smoothing mechanism is designed to reinitialize the pheromone matrix when the ACO algorithm's search process approaches a defined stagnation state. The improved algorithm is analyzed and tested on a set of benchmark test cases. The experimental results show that the improved ant colony optimization algorithm performs better than compared algorithms in terms of both the diversity of the solutions obtained and convergence speed. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码：142 / 162
页数：21
相关论文
共 50 条
  • [1] A food source-updating information-guided artificial bee colony algorithm
    Ning, Jiaxu
    Liu, Tingting
    Zhang, Changsheng
    Zhang, Bin
    [J]. NEURAL COMPUTING & APPLICATIONS, 2018, 30 (03): : 775 - 787
  • [2] A food source-updating information-guided artificial bee colony algorithm
    Jiaxu Ning
    Tingting Liu
    Changsheng Zhang
    Bin Zhang
    [J]. Neural Computing and Applications, 2018, 30 : 775 - 787
  • [3] Ant colony optimization for best path planning
    Hsiao, YT
    Chuang, CL
    Chien, CC
    [J]. IEEE INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES 2004 (ISCIT 2004), PROCEEDINGS, VOLS 1 AND 2: SMART INFO-MEDIA SYSTEMS, 2004, : 109 - 113
  • [4] An investigation of parameters in ant colony optimization for a path optimization algorithm
    Gholami, Farnood
    Mahjoob, M. J.
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS I-V, CONFERENCE PROCEEDINGS, 2007, : 463 - +
  • [5] Ant Colony Optimization algorithm for UAV path planning
    Konatowski, Stanislaw
    Pawlowski, Piotr
    [J]. 2018 14TH INTERNATIONAL CONFERENCE ON ADVANCED TRENDS IN RADIOELECTRONICS, TELECOMMUNICATIONS AND COMPUTER ENGINEERING (TCSET), 2018, : 177 - 182
  • [6] Ant Colony Optimization Algorithm for Robot Path Planning
    Xu, Q. L.
    Zhang, D. X.
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ELECTRICAL, AUTOMATION AND MECHANICAL ENGINEERING (EAME 2015), 2015, 13 : 821 - 823
  • [7] Research on the optimization of path information in the process of logistics distribution by improved ant colony algorithm
    Wang, Jiaxin
    [J]. Italian Journal of Pure and Applied Mathematics, 2019, (41): : 343 - 352
  • [8] RESEARCH ON THE OPTIMIZATION OF PATH INFORMATION IN THE PROCESS OF LOGISTICS DISTRIBUTION BY IMPROVED ANT COLONY ALGORITHM
    Wang, Jiaxin
    [J]. ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2019, (41): : 343 - 352
  • [9] An ant colony optimization algorithm with evolutionary experience-guided pheromone updating strategies for multi-objective optimization
    Zhao, Haitong
    Zhang, Changsheng
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 201
  • [10] A best firework updating information guided adaptive fireworks algorithm
    Haitong Zhao
    Changsheng Zhang
    Jiaxu Ning
    [J]. Neural Computing and Applications, 2019, 31 : 79 - 99
12345