Transmission network planning with N-1 security criterion based on improved multi-objective genetic algorithm

Transmission network expansion planning is an essential part of power system planning, and as a multi-objective optimization programming problem, it is often turned into single objective programming problem to analyze home and abroad presently, and then plenty of methods can be applied in sovling the single objective programming problem. However, in this transformation process many human factors will inevitably be mixed into it to some extent and conflicting goals are often hard to reconcile, so that the solution which satisfies the single objective is easy to fall into local optimum and hard to achieve balance between the original objectives. In this paper, application of Pareto multi-objective genetic algorithm, which has rised in recent years, in transmission network expansion planning is proposed so as to reconcile the conflicting goals in transmission network expansion planning. With the advantage of this algorithm the "N-1" security criteria is considered as one of the objectives in the form of the penalty function to meet with the high reliability requirements of transmission network. In addition, the elites saving strategy is introduced into the multi-objective genetic algorithm in this paper to not only avoid the loss of outstanding individuals but also improve the convergence speed. Furthermore, to reduce the number of iterations and improve computational efficiency, fault ordering method is successfully adopted in "N-1" security check. Finally, IEEE Garver-6 system is simulated and the results reveal that the solution can be acquired in one step optimization and satisfy the“N-1”security criterion of transmission network when “N-1”is taken into account as an objective; and the Pareto multi-objective genetic algorithm in this paper can provide the optimal solution based on balanced multiple objectives compared to traditonal single objective genetic algorithm.