The gravitational search algorithm(GSA) has the characteristics of faster convergence speed and stronger exploitation performance than the traditional optimization algorithm, but the GSA is vulnerable to premature convergence and local optimum, and its search ability is weak. Therefore, this paper proposes the gravitational search algorithm based on improved Tent chaos(ITC-GSA). Firstly, the Tent chaotic map is improved to initialize the population. Using the characteristics of randomness, ergodicity and regularity of Tent chaotic sequence, the initial population randomness and ergodicity are within the feasible domain, and the global search ability of the algorithm is enhanced. Then, the dynamic adjustment strategy of the gravity constant G is introduced to improve the convergence speed and convergence accuracy of the algorithm. Moreover, maturity indicators are designed to determine the maturity of the population, and Tent chaos search is used to effectively suppress the premature convergence of the algorithm for helping the population jump out of the local optimum. Finally, through simulations of 10 benchmark functions, experiments show that the proposed algorithm can effectively overcome the shortcomings of the GSA's vulnerability to premature convergence and local optimization, and improve the algorithm's convergence speed and optimization accuracy.