American Journal of Operations Research

Volume 8, Issue 3 (May 2018)

ISSN Print: 2160-8830   ISSN Online: 2160-8849

Google-based Impact Factor: 1.04  Citations  h5-index & Ranking

Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm

HTML  XML Download Download as PDF (Size: 368KB)  PP. 133-166  
DOI: 10.4236/ajor.2018.83010    713 Downloads   1,960 Views  Citations


In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movement of water drops in the natural hydrological cycle. The HCA performance is tested on various geometric structures and standard benchmarks instances. The HCA has successfully solved TSPs and obtained the optimal solution for 20 of 24 benchmarked instances, and near-optimal for the rest. The obtained results illustrate the efficiency of using HCA for solving discrete domain optimization problems. The solution quality and number of iterations were compared with those of other metaheuristic algorithms. The comparisons demonstrate the effectiveness of the HCA.

Share and Cite:

Wedyan, A. , Whalley, J. and Narayanan, A. (2018) Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm. American Journal of Operations Research, 8, 133-166. doi: 10.4236/ajor.2018.83010.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.