Answers are grounded in this paper and cite their sources.
This approach demonstrates the efficiency of gray wolf optimization in solving competitive traveling salesman problem in different pathways.
In this paper a Gray Wolf Optimization (GWO) algorithm is presented to solve the Competitive Traveling Salesman Problem (CTSP). In CTSP, there are numbers of non-cooperative salesmen their goal is visiting a larger possible number of cities with lowest cost and most gained benefit. Each salesman will get a benefit when he visits unvisited city before all other salesmen. Two approaches have been used in this paper, the first one called static approach, it is mean evenly divides the cities among salesmen. The second approach is called parallel at which all cities are available to all salesmen and each salesman tries to visit as much as possible of the unvisited cities. The algorithms are executed for 1000 times and the results prove that the GWO is very efficient giving an indication of the superiority of GWO in solving CTSP.
No takes yet. Share an insight, caveat, or question.
Taha et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: