PROJECT TITLE :
Computational Study of Security Constrained Economic Dispatch With Multi-Stage Rescheduling
We tend to model post-contingency corrective actions in the security-constrained economic dispatch and contemplate multiple stages of rescheduling to meet totally different security constraints. The ensuing linear program isn't solvable by ancient LP methods because of its massive size. We have a tendency to devise and implement a series of algorithmic enhancements based on the Benders' decomposition methodology to ameliorate the computational difficulty. These enhancements embody reducing the number of subproblems, solving the LPs faster by using applicable solver choices, harnessing parallel computing and treating difficult contingencies separately by integrating an freelance “feasibility checker” process in the algorithm. In addition, we propose a set of on-line measures to diagnose and correct infeasibility issues encountered in the answer method. The resolution approach, coded directly in GAMS, is in a position to process the “N-one” contingency list in ten min for all large network cases (e.g., the Polish 2383-bus case) out there for experiments.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here