Abstract: Highlights•This paper deals with well-known and highly studied Travelling Salesman Problem.•A discrete GWO algorithm has been proposed for Travelling Salesman Problem.•In order to make a discrete version of GWO, 2-opt algorithms has been incorporated with classical GWO.•The computational results show the effectiveness of the proposed method.
Loading