Prescriptive Analytics: TSP and Subtour Elimination Constraints
Quiz by Dipti Pisharodi
Feel free to use or edit a copy
includes Teacher and Student dashboards
Measure skillsfrom any curriculum
Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.
- edit the questions
- save a copy for later
- start a class game
- automatically assign follow-up activities based on students’ scores
- assign as homework
- share a link with colleagues
- print as a bubble sheet
- Q1
What is the primary goal of the Traveling Salesman Problem?
To visit as many cities as possible
To find the longest possible route
To maximize the number of sales
To minimize the total travel distance
60s - Q2
How many possible paths are there in the TSP for "n" cities?
n^2
n
2^n
n!
60s - Q3
Which of the following is a real-world application of TSP?
Route planning for delivery services
Scheduling flights for pilots
Route planning for delivery services AND Deciding the order of songs in a concert
Deciding the order of songs in a concert
60s - Q4
Why are Subtour Elimination Constraints used in TSP?
To ensure the sales target is met
To prevent the formation of smaller loops within the solution
To reduce the complexity of the problem
To increase the number of possible routes
60s - Q5
What is a potential downside of using TSP and Subtour Elimination Constraints for large datasets?
It is computationally intensive
It requires physical travel to implement
It is less secure than other methods
It only provides approximate solutions
30s