Search

This paper presents a novel method to determine the optimal routing of medium voltage distribution networks in sparse rural areas. The objective is evaluated through minimizing the net present cost of the network over a selected time period. A problem specific genetic algorithm is proposed to address the optimal network routing problem and compute the optimized topology throughout a geographically constrained region. The proposed method simultaneously considers nonfixed candidate lines to overcome search space restrictions through a variable length encoding structure and the use of Steiner points, and a shortest path algorithm to traverse between point-to-point connections in the constrained region. Geographical restrictions on network routing are considered through the formation of a rasterized map. The network is modeled at the branch level and considers both greenfield and expansion planning to highlight the effects of accessibility restrictions. The optimization model is applied to a real rural distribution network in the South–West of Western Australia. Alternative network topologies are found to provide significant improvements over the existing network and traditional reconfiguration based methods for evaluating the minimum cost sparse rural distribution network. [ABSTRACT FROM AUTHOR]

Market and network integration of distributed energy resources can be facilitated by their coordination within a virtual power plant (VPP). However, VPP operation subject to network limits and different market and physical uncertainties is a challenging task. This paper introduces a framework that co-optimizes the VPP provision of multiple market (e.g., energy, reserve), system (e.g., fast frequency response, inertia, upstream reactive power), and local network (e.g., voltage support) services with the aim of maximizing its revenue. To ensure problem tractability, while accommodating the uncertain nature of market prices, local demand, and renewable output and while operating within local network constraints, the framework is broken down into three sequentially coordinated optimization problems. Specifically, a scenario-based robust optimization for day-ahead resource scheduling, with linearized power flows, and two receding horizon optimizations for close-to-real-time dispatch, with a more accurate second-order cone relaxation of the power flows. The results from a real Australian case study demonstrate how the framework enables effective deployment of VPP flexibility to maximize its multi-service value stack, within an uncertain operating environment, and within technical limits. [ABSTRACT FROM AUTHOR]

The increasing uptake of electric vehicles suggests that vehicle charging will have a significant impact on the electricity grid. Finding ways to shift this charging to off-peak periods has been recognized as a key challenge for integration of electric vehicles into the electricity grid on a large scale. In this paper, electric vehicle charging is formulated as a receding horizon optimization problem that takes into account the present and anticipated constraints of the distribution network over a finite charging horizon. The constraint set includes transformer and line limitations, phase unbalance, and voltage stability within the network. By using a linear approximation of voltage drop within the network, the problem solution may be computed repeatedly in near real time, and thereby take into account the dynamic nature of changing demand and vehicle arrival and departure. It is shown that this linear approximation of the network constraints is quick to compute, while still ensuring that network constraints are respected. The approach is demonstrated on a validated model of a real network via simulations that use real vehicle travel profiles and real demand data. Using the optimal charging method, high percentages of vehicle uptake can be sustained in existing networks without requiring any further network upgrades, leading to more efficient use of existing assets and savings for the consumer. [ABSTRACT FROM PUBLISHER]

This letter introduces a deterministic global optimization methods for unit commitment (UC) problem based on outer approximation method (OAM). The proposed Multi-cuts OAM (MCs-OAM) decomposes the UC problem into a mixed integer linear programming (MILP) master problem and several nonlinear programming (NLP) subproblems, whereas only one NLP in classic OAM. After elaborately designing the terminating criterion for solving the bigger but tighter MILP master problems, MCs-OAM can obtained higher quality solutions with fewer main iterations and less total CPU times, although solving more NLPs consumes more CPU times than OAM. The numerical results on 42 test systems of up to 200 units show that the MCs-OAM is very promising for large scale UC problems because that it can obtain high-quality solutions in reasonable time. [ABSTRACT FROM AUTHOR]