A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads. (15th January 2016)

• Record Type: Journal Article
• Authors: Soares, João; Fotouhi Ghazvini, Mohammad Ali; Vale, Zita; de Moura Oliveira, P.B.
• Is Part Of: Applied energy. Volume 162(2016)
• Page Start: 1074
• Page End: 1088
• Publication Date: 2016-01-15
• Subjects: Electric vehicles -- Multi-objective optimization -- Parallel computing -- Pareto front -- Particle swarm optimization -- Smart grid; Power (Mechanics) -- Periodicals; Energy conservation -- Periodicals; Energy conversion -- Periodicals; 621.042
• DOI: 10.1016/j.apenergy.2015.10.181
• Languages: English
• ISSNs: 0306-2619

Abstract

Highlights: A multi-objective framework for smart grid management considering minimum reserve. The min. reserve is incorporated in the model in addition to the cost minimization. The day-ahead model for VPP aims to increase reliability and reduce uncertainty. Two-stage weighted sum approach using distributed and parallel computing. 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.