Table of Contents
Advances in Computer Engineering
Volume 2014, Article ID 436312, 14 pages
Research Article

A Water Flow-Like Algorithm for the Travelling Salesman Problem

Centre of Artificial Intelligent Technology, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia (UKM), 43650 Bangi, Selangor, Malaysia

Received 4 April 2014; Revised 6 July 2014; Accepted 9 July 2014; Published 7 August 2014

Academic Editor: Lijie Li

Copyright © 2014 Ayman Srour et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The water flow-like algorithm (WFA) is a relatively new metaheuristic that performs well on the object grouping problem encountered in combinatorial optimization. This paper presents a WFA for solving the travelling salesman problem (TSP) as a graph-based problem. The performance of the WFA on the TSP is evaluated using 23 TSP benchmark datasets and by comparing it with previous algorithms. The experimental results show that the proposed WFA found better solutions in terms of the average solution and the percentage deviation of the average solution from the best-known solution.