| The core of cable laying system is the calculation of cable route algorithm. In this paper, the path laying of cable laying system was studied, and its mathematical model was build.The layout of cable laying is a set of trees which are mutually independent but also related to each other, when break up the whole into parts, every route laying is a problem of Manhattan distance Steiner minimum spanning tree under three-dimensional degree constraint. It can be broken down two parts as and vertical high. And the emphasis of solving Manhattan distance Steiner minimum spanning tree under horizontal plane degree constraint is on two aspects, to determine the number and location of auxiliary point and degrees of processing. The question belongs to NP problem which can not use accurate algorithm. The traditional methods by bottleneck limit, have the large quantity of calculation, and the traditional algorithm can only solve the shortest Manhattan distance between two equipment, need to introduce a kind of intelligent algorithm to optimize and improve the system performance. In view that the search path of nature ant colony is a tree, in accordance with the layout of cable in the power plants cable laying, At the same time, the ant colony algorithm is a kind of discrete optimization algorithm, which is suitable to be used in graph to find the probability of path, these are associated with the cable laying extremely, and can solve two and more than two equipment Manhattan distance Steiner minimum spanning tree under the three-dimensional degree constraint, compared with the traditional algorithm, Ant Colony Optimization is better. So the article chose the Ant Colony Optimization(ACO), and made corresponding modification to the moving rule of ants. Through the example simulation, and did a large number of research about parameters, verified the effectiveness of the proposed algorithm. |
PDF Full Text Request