Adaptive Binary PSO based Unit Commitment | Zendy

R. Santhi | Zendy; S. Subramanian | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Adaptive Binary PSO based Unit Commitment

Author(s) -

R. Santhi,

S. Subramanian

Publication year - 2011

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/1940-2591

Subject(s) - computer science , inertia , binary number , power system simulation , spinning , acceleration , mathematical optimization , population , unit (ring theory) , power (physics) , process (computing) , electric power system , mathematics , operating system , arithmetic , mathematics education , mechanical engineering , physics , demography , classical mechanics , quantum mechanics , sociology , engineering

This paper presents a binary PSO based solution technique for power system unit commitment. The intelligent generation of initial population and the repairing mechanism ensure feasible solution that satisfies the spinning reserve and unit minimum up/down constraints. The algorithm adoptively adjusts the inertia weight and the acceleration coefficients in order to enhance the search process and arrive at the global optimum. Numerical results on systems up to 100 generating units demonstrate the effectiveness of the proposed strategy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research