EADPSODV Technique for Solving UC Problem
M Ramu1, Pramod Kumar Irlapati2, S.V. Bharath Kumar Reddy3
1M Ramu, Electrical and Electronics Engineering, GITAM University, Visakhapatnam, India.
2Pramod Kumar, Electrical and Electronics Engineering, GITAM University, Visakhapatnam, India.
3S.V. Bharath Kumar Reddy, Electronics and Instrumentation Engineering, GITAM University, Visakhapatnam, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 2191-2195 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8591088619/2019©BEIESP | DOI: 10.35940/ijeat.F8591.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Unit Commitment problem (UC) is a large family of mathematical optimization problems usually either match the energy demand at minimum cost or maximize revenues from energy production. This paper proposes a new approach for solving Unit Commitment problem using the EADPSODV technique. In PSODV, the appropriate mutation factor is selected by applying Ant Colony search procedure in which internally a Genetic Algorithm (GA) is employed in order to develop the necessary Ant Colony parameters. In EADPSODV method the advantageous part is that, for determining the most feasible configuration of the control variables in the Unit Commitment. An initial observation and verification of the suggested process is carried on a 10-unit system which is extended to 40-unit system over a stipulated time horizon (24hr). The outcomes attained from the proposed EADPSODV approach indicate that EADPSODV provides effective and robust solution of Unit Commitment.
Keywords: Unit commitment, Economic Dispatch, ADPSODV.