Abstract
Harmony search (HS) is a population-based metaheuristics search algorithm inspired from the musical process of searching for a perfect state of harmony. The pitch of each musical instrument determines the aesthetic quality, just as the fitness function value determines the quality of decision variables. In the musical improvisation process, all players sound pitches within possible range together to make one harmony. If all the pitches make a good harmony, each player stores in his memory that experience and the possibility of making a good harmony is increased next time. Even though HS has the ability to escape from local minima, it does not require differential gradients and initial value setting for the variables, is free from divergence and has strong ability to explore the regions of solution space in a reasonable time. However, it has lower exploitation ability in later period and it easily trapped into local optima and converges very slowly. To improve the exploitation ability of HS algorithm in later stage and provide global optimal solution, a novel and hybrid version of harmony search combined with random search algorithm is presented in the proposed research to solve single-area unit commitment problem of electric power system. The proposed algorithm is tested for standard IEEE systems consisting of 4, 10, 20 and 40 generating units. The effectiveness of proposed hybrid algorithm is compared with other well-known evolutionary, heuristics and metaheuristics search algorithms, and it has been found that performance of proposed algorithm is much better than of classical harmony search algorithm and improved harmony search algorithm as well as recently developed algorithms. Sensitivity analysis on proposed algorithm shows that low value of pitch adjustment rate results in better cost, and parametric test on proposed algorithm shows the rejection of the null hypothesis at the alpha significance level.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have