Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.