Services paths planning for Electric Power Communication Network based on improved Ant Colony Optimization

Services paths planning for Electric Power Communication Network (EPCN) is mainly designed by artificial pre-assignment and Dijkstra´s algorithm. These algorithms commonly assign services on the shortest path to ensure the time delay. However, assigning too many services on one short line to reduce time delay may increase the risk. Therefore, to balance both the requirements of low-risk and low-delay of the network, this paper proposes a services paths planning method for EPCN based on improved Ant Colony Optimization (ACO). In this algorithm, the interferon is applied to extend the ACO framework, by which we not only achieve the load-balancing of services, which successfully reduce the global risk, but also take the need that services paths should be as short as possible into account in order to improve the quality of service.