На главнуюЛюди и блогиПохожее видеоЕще от: IMAmaths

Travelling Salesman Problem

Оценок: 119 | Просмотров: 15024
Demonstration of the Travelling Salesman Problem from the Large Maths Outreach and Careers Kit developed by the Institute of Mathematics and its Applications as part of the National HE STEM Programme.
Категория: Люди и блоги
Html code for embedding videos on your blog
Текстовые комментарии (23)
florianreichelt (1 год назад)
Very nice!:)
Just Vince B (1 год назад)
I could solve that problem in 10 minutes.
Goliath Mitchell (2 года назад)
That's wassup
GGboOmErs (2 года назад)
actually, for 10 cities it would be 10!/2 since the circuits forward and backward are the same. #mathteacher
Brendan Brosnahan (2 года назад)
Is Chess a traveling salesman problem
Amy de Buitléir (4 года назад)
Or you could just ask a slime mould to find a good route: Computation of the Travelling Salesman Problem by a Shrinking Blob, arXiv:1303.4969 [cs.ET] arxiv.org/abs/1303.4969
Jacob Truesdale (4 года назад)
What was the reason that you can't just start at city A and find the shortest distance to the next city? If the problem is that you end up farthest away from your starting point couldn't you work both forwards and backwards so take city A's two closest companions (B and C) and then work closest to B, Closest to C and slowly create your path?
Jacob Truesdale (4 года назад)
+Michael Bauers Ok that make sense. I never quite understood what an NP problem is but what you said makes a lot of sense. Thanks
Michael Bauers (4 года назад)
Of course you can iteratively solve it.  It's labeled as NP hard though.  As the number of cities increase, the solution time goes up a lot.  NP hard may suggest, but it's not proved, that there is no polynomial time algorithm.  Also note that any city may be the starting point - you can't just find the optimal solution for one starting city, as that may not be the optimal solution
peuchs (4 года назад)
Just get a longer rope !!
MTastatnhgevv (4 года назад)
"The Mathematical Mystery Tour" Is that a Beatles reference?
eagles4christ (5 лет назад)
If you have indeed solved it by this method (I can't see how this is helping at all) then by all means post a video or something explaining it.
Anirban Mandal (5 лет назад)
It will just take a minute or so to solve the problem using this method
Anirban Mandal (5 лет назад)
There is a way ,by using triangle inequality and well ordering principle one can actually find a solution. Does anyone want to know?(Triangle inequality states that the sum of two sides of a triangle is greater than the third side and the well ordering principle states thet every subset of positive real numbers has a least element)
pantz4452 (5 лет назад)
Please dont stop making videos. I always think of you for inspiration in my studies
lalo kuyo (5 лет назад)
There are already algorithms for these type of problems, one is called Floyd algorithm (: check it out
David Raethel (5 лет назад)
Shortest or efficient? Please say shortest or I'll really go nuts :)
TheWritersMind (5 лет назад)
Gives us Zero.
TheWritersMind (5 лет назад)
if i was a programmer this is what i would do. we want to find the shortest distance overall yes? what i would do is measure the distance between each city, and find the direction each city is in relation to each other and the starting city. if you need to find the path that passes through all the city's i think that if we were using vectors to describe this, the outcome of the resultant vector (scalar in this case) would have to equal zero. so we must find the combonation of vectors that (cont)
wdfomfg (5 лет назад)
not at all.
Oskar Sørensen (5 лет назад)
Is this the P vs. NP Millennium Prize Problem?
Ungoogleable o_O (5 лет назад)
with the string on the board it's not the generalized version of the TSP that is so astounding hard
interestingtrawl (5 лет назад)

Хотите оставить комментарий?

Присоединитесь к YouTube, или войдите, если вы уже зарегистрированы.