Multilayer optimisation for day-ahead energy planning in microgrids

In the search for low carbon, reliable and affordable ways to provide electricity, an increased attention is going to the microgrid, a small-scale power system that uses a combination of energy generation and storage devices to serve local customers. The most promising feature of the microgrid is its flexibility to act as a standalone source of electricity for remote communities, and to be connected to the main power system, selling and purchasing power as required. Additionally, a microgrid can be considered as a coordinated system approach for incorporating intermittent renewable sources of energy. Microgrid customers can have power from their batteries or distributed generators, they can buy it from the utility grid, or they can reduce their consumption.When designing a new optimal planning tool for a microgrid, a major challenge (and opportunity) is to decide on what units to operate in order to meet the demand. The question is what mix will provide the performance needed at the lowest cost, or with the lowest possible emissions. Unfortunately, both objectives are often contradictory. Generally, low costs mean high emissions, and vice versa. A microgrid system operator may care more about achieving lower costs rather than lower emissions. Given the preferences, the operator needs to decide how to configure and operate the microgrid while satisfying all technical requirements, such as voltage stability and power balance. In order to control and manage the microgrid units in real-time while fully exploiting the benefit of long-term prediction, an off-line optimisation approach imposes itself to devise the online microgrid management. In this PhD thesis, an efficient multilayer control approach is developed which obtains a day-ahead unit commitment method to provide an economically and environmentally viable unit commitment (UC) that is physically feasible in terms of voltage violations. With the multilayer control approach, the future operational states of the controllable units within the microgrid are determined ahead of time. The proposed concept follows the idea of a day-ahead coordination including the unit commitment problem (scheduling layer), an off-line power flow calculation (executive layer) and a security check with feedback control (adjustment layer). Since the complete multilayer control concept works on a day-ahead time scale, the model can be considered as an off-line optimisation approach. The power reference set points provided by the multilayer control approach can, in turn, be used for an online microgrid implementation to achieve real-time system state updates

Collective Intelligence for Optimal Power Flow Solution Using Ant Colony Optimization

This paper presents the performance ant collective intelligence efficiency for electrical network. Solutions for Optimal Power Flow (OPF) problem of a power system deliberate via an ant colony optimization metaheuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power flow of transmission lines. Simulation results on the IEEE 30-bus electrical network show that the ant colony optimization method converges quickly to the global optimum

DYNAMIC VOLTAGE SCALING FOR PRIORITY-DRIVEN SCHEDULED DISTRIBUTED REAL-TIME SYSTEMS

Energy consumption is increasingly affecting battery life and cooling for real- time systems. Dynamic Voltage and frequency Scaling (DVS) has been shown to substantially reduce the energy consumption of uniprocessor real-time systems. It is worthwhile to extend the efficient DVS scheduling algorithms to distributed system with dependent tasks. The dissertation describes how to extend several effective uniprocessor DVS schedul- ing algorithms to distributed system with dependent task set. Task assignment and deadline assignment heuristics are proposed and compared with existing heuristics concerning energy-conserving performance. An admission test and a deadline com- putation algorithm are presented in the dissertation for dynamic task set to accept the arriving task in a DVS scheduled real-time system. Simulations show that an effective distributed DVS scheduling is capable of saving as much as 89% of energy that would be consumed without using DVS scheduling. It is also shown that task assignment and deadline assignment affect the energy- conserving performance of DVS scheduling algorithms. For some aggressive DVS scheduling algorithms, however, the effect of task assignment is negligible. The ad- mission test accept over 80% of tasks that can be accepted by a non-DVS scheduler to a DVS scheduled real-time system

Hybrid - Particle Swarm Optimization and Differential Evolution for Reduction of Real Power Loss and Preservation of Voltage Stability Limits

In this paper, a Hybrid algorithm based on - Particle Swarm Optimization (PSO) and Differential Evolution (DE) is used for solving reactive power dispatch problem. It needs progressing the population to create the individual optimal positions by means of the PSO algorithm, and then the algorithm come in DE phase and progresses the individual optimal positions by smearing the DE algorithm. In order to comprehend co-evolution of DE and PSO algorithm, an information-sharing mechanism is presented, which progresses the capability of the algorithm to fence out of the local optimum. Additionally, in optimization procedure, we espouse the hybrid inertia weight stratagem, time-varying acceleration coefficients tactic and arbitrary scaling factor stratagem. The proposed Hybrid algorithm based on - Particle Swarm Optimization and Differential Evolution (H-PSDE) has been tested on standard IEEE 30, 57,118 bus test systems and simulation results show clearly about the better performance of the proposed algorithm in reducing the real power loss. Keywords:Optimal Reactive Power; Transmission loss; Particle Swarm Optimization; Differential Evolution; Global Search; Local Search; Inertia Weight

Optimal distributed generation planning based on NSGA-II and MATPOWER

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonThe 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

Multiprocessor System-on-Chips based Wireless Sensor Network Energy Optimization

Wireless Sensor Network (WSN) is an integrated part of the Internet-of-Things (IoT) used to monitor the physical or environmental conditions without human intervention. In WSN one of the major challenges is energy consumption reduction both at the sensor nodes and network levels. High energy consumption not only causes an increased carbon footprint but also limits the lifetime (LT) of the network. Network-on-Chip (NoC) based Multiprocessor System-on-Chips (MPSoCs) are becoming the de-facto computing platform for computationally extensive real-time applications in IoT due to their high performance and exceptional quality-of-service. In this thesis a task scheduling problem is investigated using MPSoCs architecture for tasks with precedence and deadline constraints in order to minimize the processing energy consumption while guaranteeing the timing constraints. Moreover, energy-aware nodes clustering is also performed to reduce the transmission energy consumption of the sensor nodes. Three distinct problems for energy optimization are investigated given as follows: First, a contention-aware energy-efficient static scheduling using NoC based heterogeneous MPSoC is performed for real-time tasks with an individual deadline and precedence constraints. An offline meta-heuristic based contention-aware energy-efficient task scheduling is developed that performs task ordering, mapping, and voltage assignment in an integrated manner. Compared to state-of-the-art scheduling our proposed algorithm significantly improves the energy-efficiency. Second, an energy-aware scheduling is investigated for a set of tasks with precedence constraints deploying Voltage Frequency Island (VFI) based heterogeneous NoC-MPSoCs. A novel population based algorithm called ARSH-FATI is developed that can dynamically switch between explorative and exploitative search modes at run-time. ARSH-FATI performance is superior to the existing task schedulers developed for homogeneous VFI-NoC-MPSoCs. Third, the transmission energy consumption of the sensor nodes in WSN is reduced by developing ARSH-FATI based Cluster Head Selection (ARSH-FATI-CHS) algorithm integrated with a heuristic called Novel Ranked Based Clustering (NRC). In cluster formation parameters such as residual energy, distance parameters, and workload on CHs are considered to improve LT of the network. The results prove that ARSH-FATI-CHS outperforms other state-of-the-art clustering algorithms in terms of LT.University of Derby, Derby, U

A survey on scheduling and mapping techniques in 3D Network-on-chip

Network-on-Chips (NoCs) have been widely employed in the design of multiprocessor system-on-chips (MPSoCs) as a scalable communication solution. NoCs enable communications between on-chip Intellectual Property (IP) cores and allow those cores to achieve higher performance by outsourcing their communication tasks. Mapping and Scheduling methodologies are key elements in assigning application tasks, allocating the tasks to the IPs, and organising communication among them to achieve some specified objectives. The goal of this paper is to present a detailed state-of-the-art of research in the field of mapping and scheduling of applications on 3D NoC, classifying the works based on several dimensions and giving some potential research directions

Real-Time Active-Reactive Optimal Power Flow with Flexible Operation of Battery Storage Systems

In this paper, a multi-phase multi-time-scale real-time dynamic active-reactive optimal power flow (RT-DAR-OPF) framework is developed to optimally deal with spontaneous changes in wind power in distribution networks (DNs) with battery storage systems (BSSs). The most challenging issue hereby is that a large-scale ‘dynamic’ (i.e., with differential/difference equations rather than only algebraic equations) mixed-integer nonlinear programming (MINLP) problem has to be solved in real time. Moreover, considering the active-reactive power capabilities of BSSs with flexible operation strategies, as well as minimizing the expended life costs of BSSs further increases the complexity of the problem. To solve this problem, in the first phase, we implement simultaneous optimization of a huge number of mixed-integer decision variables to compute optimal operations of BSSs on a day-to-day basis. In the second phase, based on the forecasted wind power values for short prediction horizons, wind power scenarios are generated to describe uncertain wind power with non-Gaussian distribution. Then, MINLP AR-OPF problems corresponding to the scenarios are solved and reconciled in advance of each prediction horizon. In the third phase, based on the measured actual values of wind power, one of the solutions is selected, modified, and realized to the network for very short intervals. The applicability of the proposed RT-DAR-OPF is demonstrated using a medium-voltage DN

Modified sub-gradient based combined objective technique and evolutionary programming approach for economic dispatch involving valve-point loading, enhanced prohibited zones and ramp rate constraints

A security constrained non-convex power dispatch problem with prohibited operation zones and ramp rates is formulated and solved using an iterative solution method based on the feasible modified sub-gradient algorithm (FMSG). Since the cost function, all equality and inequality constraints in the nonlinear optimization model are written in terms of the bus voltage magnitudes, phase angles, off-nominal tap settings, and the Susceptance values of static VAR (SVAR) systems, they can be taken as independent variables. The actual power system loss is included in the current approach and the load flow equations are inserted into the model as the equality constraints. The proposed modified sub gradient based combined objective technique and evolutionary programming approach (MSGBCAEP) with as decision variable and cost function as fitness function is tested on the IEEE 30-bus 6 generator test case system. The absence of crossover operation and adoption of fast judicious modifications in initialization of parent population, offspring generation and normal distribution curve selection in EP enables the proposed MSGBCAEP approach to ascertain global optimal solution for cost of generation and emission level shown in Table 6 and displayed in Figure 2 and Figure 3 respectively

Conic optimisation for electric vehicle station smart charging with battery voltage constraints

This paper proposes a new convex optimisation strategy for coordinating electric vehicle charging, which accounts for battery voltage rise, and the associated limits on maximum charging power. Optimisation strategies for coordinating electric vehicle charging commonly neglect the increase in battery voltage which occurs as the battery is charged. However, battery voltage rise is an important consideration, since it imposes limits on the maximum charging power. This is particularly relevant for DC fast charging, where the maximum charging power may be severely limited, even at moderate state of charge levels. First, a reduced order battery circuit model is developed, which retains the nonlinear relationship between state of charge and maximum charging power. Using this model, limits on the battery output voltage and battery charging power are formulated as second-order cone constraints. These constraints are integrated with a linearised power flow model for three-phase unbalanced distribution networks. This provides a new multiperiod optimisation strategy for electric vehicle smart charging. The resulting optimisation is a second-order cone program, and thus can be solved in polynomial time by standard solvers. A receding horizon implementation allows the charging schedule to be updated online, without requiring prior information about when vehicles will arrive