基于蚁群算法的轨道交通集群调度算法研究

Load balancing scheduling algorithm for rail transit cluster based on ant colony algorithm

负载均衡调度是轨道交通集群系统的一大核心功能,海量任务的实时、高效、均衡调度对轨道交通系统的可靠运行起着至关重要的作用。由于轨道交通集群系统的历史原因,各个子系统的实时负载情况无法获取。文中在分析现有的负载均衡调度算法的基础上,提出了一种基于蚁群算法的面向轨道交通异构集群的负载均衡动态调度算法,以信息素浓度作为各个节点负载程度的依据,从而实现动态型的负载均衡调度。仿真结果表明,在轨道交通领域,基于蚁群算法的负载均衡调度算法比遗传算法、Min-Min算法、Max-Min算法具有更高的任务吞吐量。

Load balancing scheduling is a core function of the rail transit cluster dispatching system（ RTCDS）. Massively real-time,efficient and balanced scheduling of mass tasks plays a crucial role in the reliable operation of the rail transit system. Due to the historical reasons of the RTCDS,the real-time load of each subsystem cannot be obtained. On the basis of comparing with the existing load balancing scheduling algorithms,this paper proposes a load balancing scheduling algorithm of RTCDS based on the heuristic ant colony algorithm. The algorithm uses the pheromone concentration as the basis of the load degree of each node,so as to achieve dynamic load balancing scheduling. Simulation results show that in the field of rail transit,the load balancing scheduling algorithm based on ant colony algorithm has higher task throughput than the genetic algorithm,Min-Min algorithm and Max-Min algorithm.