A Water Flow-Like Algorithm for the Travelling Salesman Problem | Zendy

Ayman Srour | Zendy; Zulaiha Ali Othman | Zendy; Abdul Razak Hamdan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Water Flow-Like Algorithm for the Travelling Salesman Problem

Author(s) -

Ayman Srour,

Zulaiha Ali Othman,

Abdul Razak Hamdan

Publication year - 2014

Publication title -

advances in computer engineering

Language(s) - English

Resource type - Journals

eISSN - 2356-6620

pISSN - 2314-7601

DOI - 10.1155/2014/436312

Subject(s) - travelling salesman problem , benchmark (surveying) , mathematical optimization , combinatorial optimization , metaheuristic , lin–kernighan heuristic , algorithm , graph , mathematics , computer science , christofides algorithm , 2 opt , combinatorics , geodesy , geography

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research