Abstract
The unit commitment operation in power systems is a complex, non-linear, constrained optimization problem. The commitment and de-commitment decision presents a binary problem which needs discrete/binary optimization approaches. This paper presents a binary bat search algorithm (BBSA) to solve unit commitment (UC) problem. The bat search algorithm belongs to a meta heuristic class of optimization approaches inspired by natural echolocation behavior of bats. In order to solve binary UC problem, the real valued bat search process is mapped to binary search space using sigmoidal transformation function. The BBSA is then applied to test system with 10 thermal units. The effectiveness of the BBSA is verified against system dimension using test systems upto 100 units. Extensive numerical experiments are performed to test the effectiveness of BBSA and statistical analysis of simulation results are presented. The simulation results are presented, discussed and compared to various existing classical and heuristic approaches. The same demonstrate the superior performance of BBSA approach in solving UC problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
