Full Length Article
DOI: https://doi.org/10.54216/IJNS.170205
Single Valued Trapezoidal Neutrosophic Travelling Salesman Problem with Novel Greedy Method: The Dhouib-Matrix-TSP1 (DM-TSP1)
Travelling salesman problem (TSP) is a prominent computational problem where trail technique is used to calculate all the possible travel and choose the best one. Since there is no branching or back tracking in greedy algorithms, determining the run time is much easier than the existing methods and hence, in this paper, a novel greedy method called Dhouib-Matrix-TSP1 is proposed as the first resolution of TSP to get the optimal solution using single valued trapezoidal neutrosophic numbers with several numerical examples. Also, results have been analyzed with graphical solutions.
Souhail Dhouib,
Said Broumi,
M. Lathamaheswari
visibility
58157
download
4928