A new approach for evaluation of fuzzy travelling salesmen problem using Dijkstras algorithm and Ranking method

Key Points

• To introduce a new approach for optimizing the fuzzy travelling salesman problem using Dijkstra's algorithm and a ranking method.
• Implemented Dijkstra's algorithm for finding the shortest paths in a graph.
• Utilized a ranking method to evaluate and optimize problem solutions.
• Conducted comparative analyses on generated results.
• Demonstrated a significant reduction in computational time compared to traditional methods.
• Achieved higher accuracy in route optimization for the travelling salesman problem.