The Traveling Salesman Problem: When Good Enough Beats Perfect

The Traveling Salesman Problem: When Good Enough Beats Perfect

Reducible

1 год назад

261,425 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

Cubic Central
Cubic Central - 08.11.2023 08:01

This is one of the greatest computer science videos I have ever seen. Wow.

Ответить
Will Jadson e Vania
Will Jadson e Vania - 31.10.2023 03:20

teacher I developed a heuristic and would like to share it. My heuristic uses topology and concentric circles. What do you think?.

Ответить
Funzelwicht
Funzelwicht - 15.10.2023 01:06

Sooooo well explained and animated, so good!

Ответить
Akshay Uppala
Akshay Uppala - 22.09.2023 08:14

If I could make presentations like this, I could die happy.

Ответить
Madheswaran M
Madheswaran M - 10.09.2023 07:21

How to like a video multiple times? The explanation and animation was phenomenal. Great job!

Ответить
Jacob Allessio
Jacob Allessio - 07.09.2023 19:33

Slime mold is my favorite solution to this problem

Ответить
Zach H
Zach H - 31.08.2023 18:34

Here I am just trying to figure out the optimal route for sea of thieves sailing, and now I'm learning computer science... whoops

Ответить
Mohab Mostafa
Mohab Mostafa - 18.08.2023 13:52

Can someone tell me why is this solution wrong:
Start from a random city
Go from every city to the shortest city from it

Ответить
Canberk UYAR
Canberk UYAR - 16.07.2023 15:17

amazing video... thanks for clear and interesting visualization!

Ответить
Star Platinum
Star Platinum - 08.07.2023 15:49

2 opt optimal ?

Ответить
Omar Abbadi
Omar Abbadi - 10.06.2023 03:35

U just gained a sub

Ответить
Acheiropoietos
Acheiropoietos - 08.05.2023 01:31

So when are you going travelling? Mandala.

Ответить
Rocknrolladube
Rocknrolladube - 07.05.2023 01:51

Think factorials!

Ответить
Anthony DeRose
Anthony DeRose - 05.05.2023 15:28

You probably just figure out which path light would take from each point and use that.😂

Ответить
Essen Dossev
Essen Dossev - 29.04.2023 17:11

I wish you would provide a link for the documentary you used to advertise curiosity stream (The Secret Rules of Modern Living: Algorithms), since I've already got an account with them and am interested in the documentary, but I'm not able to find it when searching the site.

Ответить
Steffen Bryde
Steffen Bryde - 27.04.2023 16:13

I have a proposal that presents a modular framework for a scalable and efficient solution to the Traveling Salesman Problem (TSP) in logistical networks. The approach combines a machine learning-based discovery process that incorporates both historical and real-time data streams, graph representation, efficient algorithms, blockchain technology, metaheuristic algorithms, and reinforcement learning to optimize routing in dynamic logistical networks.

I have a paper ready that should be conceptually sound and I'm about ready to begin establishing proof-of-concept. I will have to make a team or contact a company before I continue my project as it is a monumental task for me alone. This project have a huge potential and I'm excited to work on it!

Ответить
Leo Glisic
Leo Glisic - 18.04.2023 06:16

Absolutely love your videos. If you're willing to accept feedback, there's far too much background music. Makes it hard for me to think and focus on what you're saying. Only expressing this to help you improve, cause you're crushing it!

Ответить
BetterBelle
BetterBelle - 26.03.2023 21:51

Annealing sounds a lot like an idea used in Reinforcement Learning where during training you actually allow the agent to select a suboptimal choice (according to what the agent knows at the time) in order to explore other states.

Funny enough, this exact idea is being used to train networks that can solve TSPs and other NP-Hard problems.

Ответить