No description available.

Tese de mestrado. Engenharia Electrotécnica e de Computadores (Especialização em Energias Renováveis). Faculdade de Engenharia. Universidade do Porto. 2007

No description available.

abstract: Due to great challenges from aggressive environmental regulations, increased demand due to new technologies and the integration of renewable energy sources, the energy industry may radically change the way the power system is operated and designed. With the motivation of studying and planning the future power system under these new challenges, the development of the new tools is required. A network equivalent that can be used in such planning tools needs to be generated based on an accurate power flow model and an equivalencing procedure that preserves the key characteristics of the original system. Considering the pervasive use of the dc power flow models, their accuracy is of great concern. The industry seems to be sanguine about the performance of dc power flow models, but recent research has shown that the performance of different formulations is highly variable. In this thesis, several dc power-flow models are analyzed theoretically and evaluated numerically in IEEE 118-bus system and Eastern Interconnection 62,000-bus system. As shown in the numerical example, the alpha-matching dc power flow model performs best in matching the original ac power flow solution. Also, the possibility of applying these dc models in the various applications has been explored and demonstrated. Furthermore, a novel hot-start optimal dc power-flow model based on ac power transfer distribution factors (PTDFs) is proposed, implemented and tested. This optimal-reactance-only dc model not only matches the original ac PF solution well, but also preserves the congestion pattern obtain from the OPF results of the original ac model. Three improved strategies were proposed for applying the bus-aggregation technique to the large-scale systems, like EI and ERCOT, to improve the execution time, and memory requirements when building a reduced equivalent model. Speed improvements of up to a factor of 200 were observed. / Dissertation/Thesis / M.S. Engineering 2013

No description available.

No description available.

The UK and the world are moving away from central energy resource to distributed generation (DG) in order to lower carbon emissions. Renewable energy resources comprise a big percentage of DGs and their optimal integration to the grid is the main attempt of planning/developing projects with in electricity network. Feasibility and thorough conceptual design studies are required in the planning/development process as most of the electricity networks are designed in a few decades ago, not considering the challenges imposed by DGs. As an example, the issue of voltage rise during steady state condition becomes problematic when large amount of dispersed generation is connected to a distribution network. The efficient transfer of power out or toward the network is not currently an efficient solution due to phase angle difference of each network supplied by DGs. Therefore optimisation algorithms have been developed over the last decade in order to do the planning purpose optimally to alleviate the unwanted effects of DGs. Robustness of proposed algorithms in the literature has been only partially addressed due to challenges of power system problems such multi-objective nature of them. In this work, the contribution provides a novel platform for optimum integration of distributed generations in power grid in terms of their site and size. The work provides a modified non-sorting genetic algorithm (NSGA) based on MATPOWER (for power flow calculation) in order to find a fast and reliable solution to optimum planning. The proposed multi-objective planning tool, presents a fast convergence method for the case studies, incorporating the economic and technical aspects of DG planning from the planner‟s perspective. The proposed method is novel in terms of power flow constraints handling and can be applied to other energy planning problems.

This dissertation presents a new algorithm for optimal power flow in distribution systems. The new algorithm, Discrete Ascent Optimal Programming (DAOP), will converge to the same solution as the Lagrange multiplier approach as demonstrated by example. An intuitive discussion illustrating the path of convergence is presented along with a theorem concerning convergence. Because no partial derivatives, solutions of simultaneous equations, or matrix operations are required, the DAOP algorithm is simple to apply and program. DAOP is especially suited for programming with pointers. Advantages of the new algorithm include its simplicity, ease of incorporating inequality constraints, and the ability to predict the number of steps required to reach a solution. In addition to optimal power flow, the algorithm, heuristic in nature, can be applied to switch placement design, reconfiguration, and economic dispatch. The basic principles of the algorithm have been used to devise a phase balancing routine which has been implemented in the Distribution Engineering Workstation (DEWorkstation) software package sponsored by the Electric Power Research Institute (EPRI). The new algorithm presented in this dissertation works toward a solution by performing a series of calculations within a finite number of steps. At the start of the algorithm, the assumption is made that no power is flowing in the system. Each step adds a discrete unit of load to the system in such a fashion as to minimize loss. As progress toward the solution is made, more and more load is satisfied and the losses in the system continue to increase. The algorithm is terminated when all system load is satisfied. When the algorithm is finished, the sources which should supply each load have been identified along with the amount of power delivered by each source. Discussion will show that the method will converge to a solution that is within the discrete step size of the optimum. The algorithm can be thought of as an ascent method because the cost (losses) continually increases as more and more load is satisfied. Hence, the name Discrete Ascent Optimal Programming (DAOP) has been given to the algorithm. The new algorithm uses the topology of the power system such that the entire system is not considered at each step. Therefore, DAOP is not an exhaustive state enumeration scheme. Only those portions of the system containing loads most closely connected (via least loss paths) to the sources are first considered. As loads become supplied during the course of the solution, other loads are considered and supplied until the system is fully loaded. / Ph. D.

With distributed generation being introduced in the meshed distribution networks under increased loading conditions, maintaining the system voltage stability will become one of the major concerns. The conventional approach of repetitive power flow solutions fails to obtain the critical loading point as Jacobian becomes singular before maximum loading point. Continuation power flow methods, based on the predictor-corrector scheme, overcome this difficulty with the use of parameterization techniques. Continuation power flow tools, already developed for transmission systems, need to be extended to handle three phase unbalanced distribution systems. This research work contributes towards development of a robust and efficient three phase unbalanced continuation power flow tool for voltage stability assessment of shipboard power systems and terrestrial distribution systems. The developed continuation power flow method is based on adaptive step length control and pseudo arc length/local parameterization technique, which have been tested on several I test systems and a shipboard power system.

It is expected that the grid of the future differs from the current system by the increased integration of distributed generation, distributed storage, demand response, power electronics, and communications and sensing technologies. The consequence is that the physical structure of the system becomes significantly more distributed. The existing centralized control structure is not suitable any more to operate such a highly distributed system. This thesis is dedicated to providing a promising solution to a class of energy management problems in power systems with a high penetration of distributed resources. This class includes optimal dispatch problems such as optimal power flow, security constrained optimal dispatch, optimal power flow control and coordinated plug-in electric vehicles charging. Our fully distributed algorithm not only handles the computational complexity of the problem, but also provides a more practical solution for these problems in the emerging smart grid environment. This distributed framework is based on iteratively solving in a distributed fashion the first order optimality conditions associated with the optimization formulations. A multi-agent viewpoint of the power system is adopted, in which at each iteration, every network agent updates a few local variables through simple computations, and exchanges information with neighboring agents. Our proposed distributed solution is based on the consensus+innovations framework, in which the consensus term enforces agreement among agents while the innovations updates ensure that local constraints are satisfied.