基于改进烟花算法的以太网通信链路调度方法  

Ethernet Communication Link Scheduling MethodBased on Improved Fireworks Algorithm

作　　者：王宏志 郭嫚嫚 胡黄水[1] 武莎莎 WANG Hongzhi;GUO Manman;HU Huangshui;WU Shasha(School of Computer Science and Engineering,Changchun University of Technology,Changchun 130012,China)

机构地区：[1]长春工业大学计算机科学与工程学院,长春130012

出　　处：《吉林大学学报（理学版）》2021年第2期359-364,共6页Journal of Jilin University:Science Edition

基　　金：吉林省发改委产业技术研究与开发项目(批准号:2018C039-2).

摘　　要：针对工业以太网通信链路调度延时大及效率较低的问题,提出一种基于改进烟花算法的实时周期消息任务调度(CVFWA)方法.以降低网络传输时延为目标,首先,将传统烟花算法的连续解空间映射到实时周期序列调度问题的离散解空间;其次,为增加种群的多样性,在高斯变异过程中引入变异系数;最后,采用基于中位数锦标赛的选择策略代替欧氏距离选择策略.仿真结果表明,该方法能使实时周期消息序列在最短时间内完成队列调度,有效降低了网络时延,提高了全局搜索效率.Aiming at the problems of large delay and low efficiency of industrial Ethernet communication link scheduling,we proposed a real-time periodic message task scheduling method based on an improved firework algorithm(CVFWA).In order to achieve the goal of reducing the network transmission delay.Firstly,the continuous solution space of the traditional firework algorithm was mapped to the discrete solution space of the real-time periodic sequence scheduling problem.Secondly,in order to increase the diversity of population,the coefficient of variation was introduced in the process of Gaussian variation.Finally,the selection strategy based on the median tournament was adopted instead of Euclidean distance selection strategy.Simulation results show that the proposed method can make real-time period ic message sequence complete queue scheduling in the shortest time,effectively reduce network delay and improve global search efficiency.

关 键 词：工业以太网 通信链路调度 烟花算法 变异系数 中位数锦标赛 

分 类 号：TP393.1[自动化与计算机技术—计算机应用技术]