A Water Flow-Like Algorithm for the Travelling Salesman Problem. (7th August 2014)

• Record Type: Journal Article
• Authors: Srour, Ayman; Othman, Zulaiha Ali; Hamdan, Abdul Razak
• Other Names: Li Lijie Academic Editor.
• Is Part Of: Advances in computer engineering. Volume 2014(2014)
• Publication Date: 2014-08-07
• Subjects: Computer engineering -- Periodicals; Computer engineering; Periodicals; 621.39
• DOI: 10.1155/2014/436312
• Languages: English
• ISSNs: 2356-6620

Abstract

Abstract : 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.