Enhancement of SA algorithm by intelligent time schedule

In this paper we present a glancing review of how to define the time schedule of Simulated Annealing (SA) algorithm in different articles that applied them to solve the traveling salesman problem(TSP). In the following subjects we introduce a new definition of this concept in relation to other parameters. In other word, we claim a novel description of initial temperature,Markov chain and final temperature to the basic algorithm of SA that gives an introduction to New Time Schedule Simulated Annealing (NTSSA). In this method, the dynamic coincidence of time schedule parameters and temperature conditions is a possible happening among the searching process. In continuation we present the obtaining results of proposed algorithm in solving TSP in comparison with basic methods of SA and other intelligent optimization methods. The surprising improvement in results obtained by this approach shows the efficiency of NTSSA in contrast with other basic optimization methods.