Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection Network

Ameen Shaheen, Azzam Sleit and Saleh Al-Sharaeh

Modern Applied Science, 2018, vol. 12, issue 8, 142

Abstract: Travelling Salesman Problem (TSP) is one of the most popular NP-complete problems for the researches in the field of computer science which focused on optimization. TSP goal is to find the minimum path between cities with a condition of each city must to visit exactly once by the salesman. Grey Wolf Optimizer (GWO) is a new swarm intelligent optimization mechanism where it success in solving many optimization problems. In this paper, a parallel version of GWO for solving the TSP problem on a Hypercube Interconnection Network is presented. The algorithm has been compared to the alternative algorithms. Algorithms have been evaluated analytically and by simulations in terms of execution time, optimal cost, parallel runtime, speedup and efficiency. The algorithms are tested on a number of benchmark problems and found parallel Gray wolf algorithm is promising in terms of speed-up, efficiency and quality of solution in comparison with the alternative algorithms. Â

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/76080/42502 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/76080 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:12:y:2018:i:8:p:142

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().