Open AccessOptimization of Unit Commitment Problem with Third Order Polynomials using Grasshopper Optimization Algorithm
Author(s) -
Karthikeyan P. R,
S. Subramanian,
Elanchezhian. E. B
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.c6313.118419
Subject(s) - mathematical optimization , power system simulation , scheduling (production processes) , economic dispatch , generator (circuit theory) , computer science , regular polygon , electric power system , algorithm , power (physics) , mathematics , physics , geometry , quantum mechanics
This paper deals with a Unit Commitment (UC) problem of a power plant aimed to find the optimal scheduling of the generating units involving cubic cost functions. The problem has non convex generator characteristics, which makes it very hard to handle the corresponding mathematical models. However, grasshopper optimization algorithm (GOA) has reached a high efficiency, in terms of solution accuracy and computing time for such non convex problems. Hence, GOA is applied for scheduling of generators with higher order cost characteristics, and turns out to be computationally solvable. In particular, we represent a model that takes into account the accurate higher order generator cost functions along with ramp limits, and turns to be more general and efficient than those available in the literature. The behavior of the model is analyzed through proposed technique on modified IEEE-24 bus system and IEEE-30 bus system.