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

Shafiekhani, Morteza, Badri, Ali, Shafie-khah, Miadreza and Catalão, João P.S. 2019. Strategic bidding of virtual power plant in energy markets: a bi-level multi-objective approach. International Journal of Electrical Power & Energy Systems 113 , pp. 208-219. 10.1016/j.ijepes.2019.05.023

Full text not available from this repository.

Abstract

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Engineering
Publisher:	Elsevier
ISSN:	0142-0615
Date of Acceptance:	10 May 2019
Last Modified:	20 Oct 2023 13:15
URI:	https://orca.cardiff.ac.uk/id/eprint/162413

Actions (repository staff only)

Edit Item