Application of opposition-based differential evolution algorithm to generation expansion planning problem

12Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Generation Expansion Planning (GEP) is one of the most important decision-making activities in electric utilities. Least-cost GEP is to determine the minimum-cost capacity addition plan (i.e., the type and number of candidate plants) that meets forecasted demand within a pre specified reliability criterion over a planning horizon. In this paper, Differential Evolution (DE), and Oppositionbased Differential Evolution (ODE) algorithms have been applied to the GEP problem. The original GEP problem has been modified by incorporating Virtual Mapping Procedure (VMP). The GEP problem of a synthetic test systems for 6-year, 14-year and 24-year planning horizons having five types of candidate units have been considered. The results have been compared with Dynamic Programming (DP) method. The ODE performs well and converges faster than DE.

Cite

CITATION STYLE

APA

Karthikeyan, K., Kannan, S., Baskar, S., & Thangaraj, C. (2013). Application of opposition-based differential evolution algorithm to generation expansion planning problem. Journal of Electrical Engineering and Technology, 8(4), 686–693. https://doi.org/10.5370/JEET.2013.8.4.686

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free