🎴 Flashcard Mode
Optimization in Transportation: Routing, Scheduling, and Traffic Management
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which algorithm is commonly used for solving the Traveling Salesman Problem (TSP)?
AnswerClick to flip back
A
Nearest Neighbor Algorithm
💡 Explanation:
The Nearest Neighbor Algorithm is a heuristic approach for solving the TSP. It starts from a randomly selected city and iteratively adds the nearest unvisited city to the route until all cities are visited.