期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2018
卷号：96
期号：18
出版社：Journal of Theoretical and Applied
摘要：This paper presents an algorithm based on Grey Wolf Optimizer (GWO) for solving the Traveling Salesman Problem (TSP), which is called (GWO-TSP). Traveling Salesman Problem is a well-known NP-Hard problem in optimization which aims at finding the shortest path between cities, where each city must be visited exactly once. The GWO is a recently established meta-heuristic algorithm for solving optimization problems which has successfully solved many optimization problems. GWO-TSP has been compared with well-regarded algorithms such as: Chemical Reaction Optimization (CRO) and Genetic algorithm (GA). In addition, GWO-TSP has been evaluated analytically and by using simulations in terms of error rate and execution time. The algorithms are tested on a number of benchmark problems. Experimental results show that GWO is promising in terms of optimal cost, error rate and standard deviation in comparison with other algorithms.
关键词：Grey Wolf Optimizer; Traveling Salesman Problem; Optimization Problems; Meta-Heuristic.
