摘要
在IT运维人员数量有限的情况下,研究基于遗传算法的IT运维人员就近调度方法。对IT运维人员调度任务进行编码,在此基础上,确定初始种群;利用遗传算法,建立IT运维人员就近调度模型;结合交叉操作和变异操作,生成就近调度方案。通过实验的方式证明,设计的调度方法在对故障案例生成调度方案时,计算时间最长不超过95s,调度成本也符合IT行业运维的要求,具备极高的应用价值。
Absrtact:under the condition that the number of it operation and maintenance personnel is limited,the nearest scheduling method of it operation and maintenance personnel based on genetic algorithm is studied.Coding the scheduling tasks of it operation and maintenance personnel,and determining the initial population on this basis;The genetic algorithm is used to establish the nearest scheduling model of it operation and maintenance personnel;Combining the crossover operation and mutation operation,the nearest scheduling scheme is generated.Through experiments,it is proved that the designed scheduling method can generate the scheduling scheme for fault cases with the longest calculation time of not more than 95s,and the scheduling cost also meets the requirements of IT industry operation and maintenance,and has high application value.
作者
陈瑞
Chen Rui(Shenzhen Power Supply Bureau Co.,LTD.,Shenzhen 518010,China)
出处
《长江信息通信》
2022年第12期139-141,共3页
Changjiang Information & Communications
关键词
遗传算法
IT运维人员
就近调度
初始种群
调度模型
genetic algorithm
It operation and maintenance personnel
Dispatch nearby
Initial population
Scheduling model
作者简介
陈瑞(1982-),男,广东深圳,研究生,高级工程师,研究方向:工商管理。
