In this chapter, we present the validated particle swarm optimization (PSO) search and optimization technique developed by the First Author, which is based on dynamic error scaling of the weightings Omega and Delta in speed and position equations. The dynamic scaled/corrective action is based on a judicious selection of the error and its. This ensures efficient search and fast convergence to optimality condition with a reduced computational burden. The primary challenge is to find an optimal scheme to relate the error in each iteration, to the direction of particles. The primary goal is to find a scheme that moves particles toward the optimal solution. Several algorithms are presented for this purpose. The presented algorithms are compared to the conventional PSO method for multiple case studies. The algorithms are also used to solve a reactive market clearing problem. A new index is also introduced in this chapter which considers the convergence speed and the accuracy and compares the performance of the presented algorithms. Experimental results from case studies in which these proposed algorithms were tested show good performance from both an accuracy and convergence speed point of view.
|Title of host publication||Classical and Recent Aspects of Power System Optimization|
|Number of pages||29|
|Publication status||Published - 20 Jun 2018|