In this paper, a modification to the new problem solving algorithm called “Intelligent Water Drops” or simply IWD algorithm has been proposed. This algorithm is based on the dynamic of river systems and the actions that water drops do in the rivers. Based on the observation on the behavior of natural water drops, artificial water drops are developed which possesses some of the remarkable properties of the natural water drops. These ideas are embedded into the proposed algorithm for solving the Traveling Salesman Problem or the TSP. Here a local Heuristic function has been added to the original IWD algorithm, which measures the undesirability of an IWD to move from one node to another. Also it is suggested that, after a few number of iterations, the soils of all paths of the graph of the given TSP are reinitialized again with the initial soil except the paths of the total-best solution which are given less soil than initial soil. The modified IWD algorithm finds better tours and hopefully escapes local optimums.

1. Haibin Duan, Senqi Liu, and Xiujuan Lei (2008), Air robot path planning based on Intelligent Water Drops optimization, IEEE World Congress on Computational Intelligence, pp. 1397 – 1401
2. Hamed Shah_Hosseini (2007), Problem solving by intelligent water drops, Evolutionary Computation, 2007. CEC 2007. IEEE Congress, pp. 3226 – 3231
3. Hamed Shah-Hosseini (2008), Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem, International Journal of Intelligent Computing and Cybernetics, Vol. 1 Iss: 2, pp.193 – 212
4. Hamed Shah_Hosseini (2009), The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm, International Journal of Bio-Inspired Computation Volume 1, No.1/2, pp.71 – 79
5. Kamkar, Iman, Akbarzadeh-T, Mohammad-R., Yaghoobi, and Mahdi (2010), Intelligent water drops a new optimization algorithm for solving the Vehicle Routing Problem, Systems Man and Cybernetics (SMC), pp.4142 – 4146
6. Liu Wei and Zhou Yuren (2010), An Effective Hybrid Ant Colony Algorithm for Solving the Traveling Salesman Problem, Intelligent Computation Technology and Automation (ICICTA), Volume 1, pp. 497 – 500
7. Mohammad Reza Bonyadi, Mostafa Rahimi Azghadi and Hamed Shah-Hosseini (2008), Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem, Travelling Salesman Problem, pp. 202 – 236
8. Wei Zhou, Yuanzong Li (2010), An improved genetic algorithm for multiple traveling salesman problem, Informatics in Control, Automation and Robotics (CAR), Volume 1, pp. 493 – 495
9. Yunming Li (2010), Solving TSP by an ACO-and-BOA- based hybrid algorithm, Computer Application and System Modeling (ICCASM), Volume: 12, pp. 189 – 192
10. Zhong Liu and Lei Huang (2010), A mixed discrete particle swarm optimization for TSP, Advanced Computer Theory and Engineering (ICACTE), Volume 2, pp. 208 – 211.

water drops Traveling Salesman Problem heuristic tour local optimum