Harmony search (HS) is a new swarm intelligent algorithm inspired by the process of music improvisation. Over the past decade, HS algorithm has been applied to many practical engineering problems. However, for some complex practical problems, there are some remaining issues such as premature convergence, low optimization accuracy and slow convergence speed. To address these issues, this paper proposes a novel intelligent global harmony search algorithm based on improved search stability strategy (NIGHS). In the search process, NIGHS uses the adaptive mean of harmony memory library to build a stable trust region around the global best harmony, and proposes a new coupling operation based on linear proportional relation, so that the algorithm can adaptively adjust the ability of exploration and exploitation in the search process and avoid premature convergence. In addition, the dynamic Gauss fine-tuning is adopted in the stable trust region to accelerate the convergence speed and improve the optimization accuracy. The common CEC2017 test functions are employed to test the proposed algorithm, the results show that NIGHS algorithm has a faster convergence speed and better optimization accuracy compared to the HS algorithm and its improved versions.