Optimal siting and sizing of distributed generation based on improved nondominated sorting genetic algorithm II

26Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

With the development of distributed generation technology, the problem of distributed generation (DG) planning become one of the important subjects. This paper proposes an Improved non-dominated sorting genetic algorithm-II (INSGA-II) for solving the optimal siting and sizing of DG units. Firstly, the multi-objective optimization model is established by considering the energy-saving benefit, line loss, and voltage deviation values. In addition, relay protection constraints are introduced on the basis of node voltage, branch current, and capacity constraints. Secondly, the violation constrained index and improved mutation operator are proposed to increase the population diversity of non-dominated sorting genetic algorithm-II (NSGA-II), and the uniformity of the solution set of the potential crowding distance improvement algorithm is introduced. In order to verify the performance of the proposed INSGA-II algorithm, NSGA-II and multiple objective particle swarm optimization algorithms are used to perform various examples in IEEE 33-, 69-, and 118-bus systems. The convergence metric and spacing metric are used as the performance evaluation criteria. Finally, static and dynamic distribution network planning with the integrated DG are performed separately. The results of the various experiments show the proposed algorithm is effective for the siting and sizing of DG units in a distribution network. Most importantly, it also can achieve desirable economic efficiency and safer voltage level.

Cite

CITATION STYLE

APA

Liu, W., Luo, F., Liu, Y., & Ding, W. (2019). Optimal siting and sizing of distributed generation based on improved nondominated sorting genetic algorithm II. Processes, 7(12). https://doi.org/10.3390/PR7120955

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free