Please use this identifier to cite or link to this item:
|Title:||Optimal power flow solution using self-evolving brain-storming inclusive teaching-learning-based algorithm|
Optimal power flow
|Source:||Krishnanand, K.R.,Hasani, S.M.F.,Panigrahi, B.K.,Panda, S.K. (2013). Optimal power flow solution using self-evolving brain-storming inclusive teaching-learning-based algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7928 LNCS (PART 1) : 338-345. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-38703-6_40|
|Abstract:||In this paper, a new hybrid self-evolving algorithm is presented with its application to a highly nonlinear problem in electrical engineering. The optimal power flow problem described here focuses on the minimization of the fuel costs of the thermal units while maintaining the voltage stability at each of the load buses. There are various restrictions on acceptable voltage levels, capacitance levels of shunt compensation devices and transformer taps making it highly complex and nonlinear. The hybrid algorithm discussed here is a combination of the learning principles from Brain Storming Optimization algorithm and Teaching-Learning-Based Optimization algorithm, along with a self-evolving principle applied to the control parameter. The strategies used in the proposed algorithm makes it self-adaptive in performing the search over the multi-dimensional problem domain. The results on an IEEE 30 Bus system indicate that the proposed algorithm is an excellent candidate in dealing with the optimal power flow problems. © 2013 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.