I often use real-world examples to explain to my middle school math students why some of the more arcane things we do have applications. This video is really terrific and even my six graders understood it. They always ask what they’re ever going to do with some of the math subjects we cover, and now I can show them something practical.
The traveling salesman problem allows us to find the shortest or the longest path used to travel to all the given areas once and return to the starting point. There are various methods used to find this out. There is no perfect solution but an optimal solution can be selected and implemented.
This is amazing video! Lots of you tubers just start teaching the logic and solving the problem without stating the usage of the problem by relating it to real life scenarios.
I’d like to know more about this and how various methods work, but the highest math I’ve taken is college calculus (and that was 10ish years ago) and most of the material I’ve found seems way over my head, like I’m missing several years of college courses and all the terminology that would come with it.
I often use real-world examples to explain to my middle school math students why some of the more arcane things we do have applications. This video is really terrific and even my six graders understood it. They always ask what they’re ever going to do with some of the math subjects we cover, and now I can show them something practical.
Kargoman ?
The traveling salesman problem allows us to find the shortest or the longest path used to travel to all the given areas once and return to the starting point. There are various methods used to find this out. There is no perfect solution but an optimal solution can be selected and implemented.
This is amazing video! Lots of you tubers just start teaching the logic and solving the problem without stating the usage of the problem by relating it to real life scenarios.
Enroll in IT they said, it will be easy they said
Hi - perfect video - nice pics :-)
Just FYI: the current fastest exact Algorithm is: Bellmann-Held-Karp O(2^n)
Traveling Salesman Problem allows us to choose an optimal path, for example, when we need a school bus to visit many different houses in a city.
Explain the christofian 1.5 solution and give an heuristic example as well please
teacher I developed a heuristic and would like to share it. My heuristic uses topology and concentric circles. What do you think?.
try sorting all edge lengths, amount ½n^2, n is location count, then try the permutations until you have a guaranteed shortest loop path
so you travel edges, not permutating the target (cities, locations)
it gives even more permutations to test, but gives an actual solution
graph theory solution
try djisktra shortest path algorithm, breadth first on all location starting points
please note, not all permutations are unique routes
Wait... this makes no sense, why did you cut out the part with the farmer and the 3 holes in the wall?
Nice thanks
YES.
I’d like to know more about this and how various methods work, but the highest math I’ve taken is college calculus (and that was 10ish years ago) and most of the material I’ve found seems way over my head, like I’m missing several years of college courses and all the terminology that would come with it.
how the hell is this O(n!) ??
Have you tried slime mold?
Imagine being a Salesman and this actually happens (I k it can happen irl on godddd it's a joke)
THIS GUY'S VOICE NEEDS TO BE LESS MOISTURE-SMACKING
Euuuugh god I know
.
first
drink some water man
u can say thanks instead of this