Strategic bidding of virtual power plant in energy markets: A bi-level multi-objective approach

• Type: Article in International Scientific Journal
• Date: 2019

Authors

Morteza Shafiekhania (Author) Other; Ali Badri (Author) Other; Miadreza Shafie-khah (Author) Other; João P. S. Catalão (Author) FEUP

Journal

Title: International Journal of Electrical Power & Energy Systems

Vol. 113

Pages: 208-219

ISSN: 0142-0615

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 73 Citations

Scopus - 90 Citations

INSPEC

Other information

Authenticus ID: P-00Q-M1E

DOI: 10.1016/j.ijepes.2019.05.023

Abstract (EN): This paper represents a model for finding the strategic bidding equilibrium of a virtual power plant in a joint energy and regulation market in the presence of rivals. A bi-level mathematical program with equilibrium constraints (MPEC) is represented for modeling the behavior of each producer. The upper level deals with profit maximization of each strategic unit and the lower level encompasses social welfare maximization. This is the first objective of the presented model. Power transfer distribution factors (PTDFs) are employed to model transmission constraints. The proposed bi-level problem is converted to a traceable mixed integer linear programming problem using duality theory and Karush-Kahn-Tucker (KKT) optimization conditions. Simultaneous solution of all MPECs forms an equilibrium problem with equilibrium constraints (EPEC). Solving the resulting EPEC using diagonalization algorithm and game theory, a market Nash equilibrium is obtained. Another goal is to solve the bi-level problem in a bi-objective way using the augmented epsilon constraint method, which maximizes the profit and minimizes the emissions of virtual power plant units. The proposed model is tested on a standard IEEE-24 bus system and the results indicate that, at the equilibrium point, the profit of a virtual power plant and GenCo will be less than in the initial state.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12