The Research Of Algorithm Of The Distribution Optical Repair Path

The electric power system occupies the important position in the national economies.The supply give The distribution network which supply direct power to own to the customers occupy 60% investment and 20% circulate in the whole power supply system.Its dependable and quantity directly relate to the national economy with people's daily life.Based on the GIS network analysis function, the distribution ORP algorithm is studied. At first, the different travelers' travel time and transportation information effect on travelers' path selecting mode are analyzed, then different time segment traffic models are established by using statistical analysis method. Secondly, the practical feature of distribution faults is analyzed, then the method and its mathematical model that how to transfer the distribution ORP problem into the urban transportation shortest path problem is gotten. Thirdly, after the Dijkstra shortest path algorithm with greedy strategy is analyzed, the Dijkstra algorithm with node-arc structure is gotten, which save storage space effectively. Fourthly, from the aspect of data structure and algorithm, the improved Dijkstra shortest algorithm is proposed, which improve the traditional operations of binheap optimal array. Fifthly, from the aspect of spatial location relationship with urban transportation network feature, the practical shortest path algorithm by studying a new greedy search strategy is gotten, which is determined by the maximum degree that combined by the current node, its nearest node and destination node. At last, based on above algorithms, the distribution ORP algorithm is proposed. Test show that the proposed algorithm has the practicability and flexibility, could meet the requirements.