For the purpose of avoiding the disadvantage of improved harmony search (IHS) algorithm, an adaptive harmony
search-particle swarm optimization (AHSPSO) algorithm is presented. In the harmony memory of AHSPSO, every variable
is updated by using the PSO algorithm, then adjusted by adaptive parameters PAR and bw. So this algorithm can improve the
search efficiency of multidimension problems. Finally, the proposed AHSPSO algorithm is tested and contrasted with IHS,
PSO, and SA. The test results show the favorable abilities of accuracy and escaping local minimums.