Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm
Solving the Traveling Salesman Problem Using Hydrological Cycle Algorithm作者机构：School of Engineering Computer and Mathematical Sciences Auckland University of Technology Auckland New Zealand
出 版 物：《American Journal of Operations Research》 (美国运筹学期刊（英文）)
年 卷 期：2018年第8卷第3期
页 面：133-166页
学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题：Water-Based Optimization Algorithms Nature-Inspired Computing Discrete Optimization Problems NP-Hard Problems
摘 要：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.
维普期刊数据库