Power Distribution Network Carrier Communication Route Hybrid Algorithm Based on Ant Colony
- 10.2991/icmmita-16.2016.60How to use a DOI?
- Electricity information acquisition system; ant colony algorithm; genetic algorithm.
In order to further improve the electricity information acquisition system performance, we put forward a kind of Routing Arithmetic Based on Hybrid Algorithm of Ant Colony Algorithm with Genetic and Simulated Annealing. The algorithm takes the hops, latency and packet loss rate factors into the path overhead cost as the optimal target, and the communication distance between the two nodes and the quality of the communication signal as the constraint conditions to solving the value of the minimum cost routing Generation under these conditions. The algorithm also improved the ant transfer rules and ant colony algorithm pheromone update rule. At the same time, in order to avoid the premature phenomenon of ant colony algorithm, we using genetic algorithm for population initialization, and combined with simulated annealing algorithm to solve the problem of genetic algorithm. The MATLAB simulation show that this algorithm has the advantages of low cost, high reliability and fast convergence to the optimal target and can effectively solve the problem of routing stability, for improving the reliability of power line carrier communication has a great significance.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Ya Li AU - Rusen Fan AU - Wei Jiang AU - Junjie Yang PY - 2017/01 DA - 2017/01 TI - Power Distribution Network Carrier Communication Route Hybrid Algorithm Based on Ant Colony BT - Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications PB - Atlantis Press SP - 338 EP - 343 SN - 2352-538X UR - https://doi.org/10.2991/icmmita-16.2016.60 DO - 10.2991/icmmita-16.2016.60 ID - Li2017/01 ER -