Please use this identifier to cite or link to this item:
|Title:||A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads|
Paulo Moura Oliveira
|Abstract:||In this paper, a multi-objective framework is proposed for the daily operation of a Smart Grid (SG) with high penetration of sensitive loads. The Virtual Power Player (VPP) manages the day-ahead energy resource scheduling in the smart grid, considering the intensive use of Distributed Generation (DG) and Vehicle-To-Grid (V2G), while maintaining a highly reliable power for the sensitive loads. This work considers high penetration of sensitive loads, i.e. loads such as some industrial processes that require high power quality, high reliability and few interruptions. The weighted-sum approach is used with the distributed and parallel computing techniques to efficiently solve the multi-objective problem. A two-stage optimization method is proposed using a Particle Swarm Optimization (PSO) and a deterministic technique based on Mixed-Integer Linear Programming (MILP). A realistic mathematical formulation considering the electric network constraints for the day-ahead scheduling model is described. The execution time of the large-scale problem can be reduced by using a parallel and distributed computing platform. A Pareto front algorithm is applied to determine the set of non-dominated solutions. The maximization of the minimum available reserve is incorporated in the mathematical formulation in addition to the cost minimization, to take into account the reliability requirements of sensitive and vulnerable loads. A case study with a 180-bus distribution network and a fleet of 1000 gridable Electric Vehicles (EVs) is used to illustrate the performance of the proposed method. The execution time to solve the optimization problem is reduced by using distributed computing.|
|Appears in Collections:||CRIIS - Articles in International Journals|
Files in This Item:
|2.88 MB||Adobe PDF||View/Open Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.