动态调度策略与竞争机制融合的蚁群优化算法

张海南; 游晓明; 刘升

Chinese

您当前的位置：

首页 >

文章列表页 >

动态调度策略与竞争机制融合的蚁群优化算法

更新时间：2026-09-04

- 动态调度策略与竞争机制融合的蚁群优化算法
- Ant colony optimization algorithm based on dynamic scheduling strategy and competition mechanism
- 微电子学与计算机 2019年36卷第7期页码：36-42
- 作者机构：
  
  上海工程技术大学机构电子电气工程学院,上海,201620
- 作者简介：
- 基金信息：
  
  国家自然科学基金 61673258国家自然科学基金 61075115国家自然科学基金 61403249国家自然科学基金 61603242
- DOI：
  中图分类号：
- 纸质出版：2019
- 稿件说明：
移动端阅览
张海南, 游晓明, 刘升. 动态调度策略与竞争机制融合的蚁群优化算法[J]. 微电子学与计算机, 2019, 36(7): 36-42.

ZHANG Hai-nan, YOU Xiao-ming, LIU Sheng. Ant colony optimization algorithm based on dynamic scheduling strategy and competition mechanism[J]. 2019, 36(7): 36-42.
张海南, 游晓明, 刘升. 动态调度策略与竞争机制融合的蚁群优化算法[J]. 微电子学与计算机, 2019, 36(7): 36-42. DOI：

ZHANG Hai-nan, YOU Xiao-ming, LIU Sheng. Ant colony optimization algorithm based on dynamic scheduling strategy and competition mechanism[J]. 2019, 36(7): 36-42. DOI：

摘要

针对蚁群算法收敛速度较慢与易陷入局部最优的问题

提出了动态调度策略与竞争机制融合的蚁群优化算法.该算法重点引入调度策略

随迭代时期的变化

通过反馈系数将路径信息实时反馈给调度算子

引导蚂蚁动态选择路径

在广阔的空间中充分探索最优解

避免蚁群陷入局部最优.另将蚁群分为双子群竞争搜索最优解

并给予不同的激励

从而平衡算法的多样性与收敛速度.通过14个经典旅行商问题(Traveling Salesman Problem)实例进行验证

该算法能以较少的迭代次数取得最优解或接近最优解

表明算法的有效性及其优越性.

Abstract

Aiming at the problem that the ant colony algorithm has slow convergence speed and easy to fall into local optimum

an ant colony optimization algorithm combining dynamic scheduling strategy and competition mechanism is proposed. The algorithm focuses on introducing the scheduling strategy. The algorithm focuses on introducing the scheduling strategy

with the change of the iteration period

the path information is fed back to the scheduling operator in real time through the feedback coefficient

guiding the ants to dynamically select the path

and fully exploring the optimal solution in the broad space to avoid the ant colony falling into the local optimum. In addition

the ant colony is divided into two sub-group competitive search optimal solutions

and different incentives are given to balance the diversity and convergence speed of the algorithm. The algorithm is verified by 14 examples of Traveling Salesman Problem

the algorithm can obtain the optimal solution or the near optimal solution with fewer iterations

indicating the effectiveness and superiority of the algorithm.

关键词

Keywords

references

曹弋, 杨忠振, 左忠义.基于地铁停车换乘的区域差异性停车收费策略[J].交通运输系统工程与信息, 2017, 17(3):12-18. DOI: 12

PRAKASAM A, SAVARIMUTHU N. Novel local restart strategies with hyper-populated ant colonies for dynamic optimization problems[J]. Neural Computing % Applications, 2018(1):1-14. DOI: 1

郑松, 侯迪波, 周泽魁.动态调整选择策略的改进蚁群算法[J].控制与决策, 2008, 23(2):225-228. DOI: 225

GÓMEZCABRERO D, RANASINGHE D N. Fine-tuning the ant colony system algorithm through particle swarm optimization[J]. Cancer Research, 2018, 25(25):73-77. DOI: 73

马继辉, 余明捷, 陈鑫杰, 等.基于Hama并行蚁群算法模型及TSP应用研究[J].交通运输系统工程与信息, 2016, 16(3):168-173. DOI: 168

许凯波, 鲁海燕, 程毕芸, 等.求解TSP的改进信息素二次更新与局部优化蚁群算法[J].计算机应用, 2017, 37(6):1686-1691. DOI: 1686

赵娟平, 高宪文, 刘金刚, 等.移动机器人路径规划的参数模糊自适应窗口蚁群优化算法[J].控制与决策, 2011, 26(7):1096-1100. DOI: 1096

MAHMOOD K, KAMAL S, KHAN H M. Dynamic optimization of network routing problemthrough ant colony optimization (ACO)[J]. IEEE Transactions on Cybernetics, 2012, 28(5):629-640. DOI: 629

ELLOUMI W, ABED H E, ABRAHAM A, et al. A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP[J]. Applied Soft Computing, 2014, 25(C):234-241. DOI: 234

梁豪默, 王智学, 刘艺.遗传增强蚁群优化算法[J].微电子学与计算机, 2018, 35(8):101-104. DOI: 101

万正宜, 彭玉旭.求解旅行商问题的改进型量子蚁群算法[J].计算机工程与应用, 2016, 52(22):59-63. DOI: 59

DORIGO M, MANIEZZO V, COLORNI A. Ant system: optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems Man % Cybernetics Part B Cybernetics A Publication of the IEEE Systems Man % Cybernetics Society, 1996, 26(1):29-31. DOI: 29

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

AlN/GaN混合缓冲层双异质结p-GaN HEMT直流特性仿真

基于改进RT-DETR的航拍小目标检测算法

V型沟槽SiC中子探测器的蒙特卡洛分析

注意力机制与改进密集卷积引导的信息隐藏模型

一种用于极低压boost系统的高效率电荷泵