Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2925
Title: Improved genetic and Harmony Search Algorithms for single and multi stage expansion planning of power system
Authors: Nagothu, Keerthi Sudha
Arroju, Mounica
Maheswarapu, Sydulu
Keywords: Distribution network expansion planning
Distributed generators
Issue Date: 2013
Publisher: Proceedings of the 2013 IEEE 7th International Power Engineering and Optimization Conference, PEOCO 2013
Citation: 10.1109/PEOCO.2013.6564605
Abstract: Distribution network expansion planning problem is carried out to supply the forecasted demand of distribution network in a certain time in which optimal size and location of distribution substations and feeders should be determined. In this paper, this problem in the presence of different types of distributed generators is addressed. For this purpose, a new approach is applied to model several practical aspects such as pollution, investment and operation costs of distributed generators, purchased power form the main grid, dynamic planning, and uncertainties of load demand and electricity prices. The uncertainties are modeled using the probability distribution function and Monte-Carlo simulation is applied to insert them into the planning problem. Because the problem involves many variables and constraints and is a non-convex and large-scale one, improved harmony search algorithm is used to solve it. To show the effectiveness of the proposed model and solving approach, it is applied to the 9-node and 69-node standard radial distribution networks and a real system of western part of Iranian national 20 kV distribution grid. The results show that the harmony search algorithm can solve the problem in a better manner in comparison with other methods such as genetic algorithm and particle swarm optimization.
Description: NITW
URI: http://localhost:8080/xmlui/handle/123456789/2925
Appears in Collections:Electronics and Communication Engineering



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.