Let's start with this theme park.The example attractions we have here include a haunted house, a Ferris Wheel, roller coasters, etc...A total of 22 locations.Which order would be the fastest?Isn't this your area of expertise?Kanade?Ah, that's right....This is that...This an optimization problem...!!■Park Entrance
●Target LocationsTSP (Travelling Salesman Problem)In this problem, under the conditions of starting at the starting point and reaching all destination, you have to find the shortest route possible.
A common topic found among University experiments.
One of the most famous of optimization problems.
The example attractions we have here include a haunted house, a Ferris Wheel, roller coasters, etc...
A total of 22 locations.
Which order would be the fastest?
Isn't this your area of expertise?
Kanade?
Ah, that's right....
This is that...
This an optimization problem...!!
■Park Entrance
●Target Locations
TSP (Travelling Salesman Problem)
In this problem, under the conditions of starting at the starting point and reaching all destination, you have to find the shortest route possible.
A common topic found among University experiments.
One of the most famous of optimization problems.
Comments
Leave a comment