A modified elite ACO based avoiding premature convergence for traveling salesmen problem

The traveling salesman problem (tsp) is one of the most important and famous combinational optimization problems that aims to find the shortest tour. in this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. solving this problem seems hard despite of program statement is simple and leads this problem belonging to np-hard problems. in this paper, the researchers present a modified elite ant system (eas) which is different from common eas. there is a linear function used here for increasing coefficient pheromone of the best route activated when a better solution is achieved. this process avoids the premature convergence and makes better solutions. the results on several standard instances show that this new algorithm gains more efficient solutions compared to other algorithms.