An application of parallel ACO algorithm in power network node code multi-scheme optimization

In order to increase solution speed for nodal admittance matrix of mathematical model of modern power network, a node code scheme with minimal new-adding nonzero injection elements is needed. To this point, a new algorithm for node code optimization based on the parallel ant colony optimization (ACO) algorithm is designed in this paper. Compared with traditional node code optimization methods, the new means can jump away from local optimal solution, find global optimal solutions quickly, and can find lots of global optimal code schemes one time by building a dynamic optimal solution base in the process of optimizing. It enhances the computing efficiency of electric power network model and increases freeness of network node code. The validity and flexibility of this new optimization algorithm are demonstrated by the simulation results of IEEE14 and IEEE30 bus test system.