Travelling Salesman Problem (TSP) Simplified

preview_player
Показать описание
This tutorial is a very simple explanation of the Travelling Salesman Problem and the algorithm to solve it

Explanation here

Travelling Salesman Problem in Python

All Linear Programming Tutorials here
  1. Kindson The Genius
  2. Vehicle Routing
  3. Travelling Salesman Problem
  4. TSP
  5. Python
  6. Linear Programming
Рекомендации по теме
What is the 0:02:42

What is the Traveling Salesman Problem?

Travelling Salesman Problem 0:09:47

Travelling Salesman Problem (TSP) Simplified

The Traveling Salesman 0:30:27

The Traveling Salesman Problem: When Good Enough Beats Perfect

Tutorial - Introduction 0:05:09

Tutorial - Introduction to Traveling Sales Man Problem (TSP) n why it is NP Hard

4.7 Traveling Salesperson 0:15:25

4.7 Traveling Salesperson Problem - Dynamic Programming

Traveling Salesman Problem 0:02:23

Traveling Salesman Problem Visualization

Travelling salesman problem 0:05:55

Travelling salesman problem tsp simplified

Construction Heuristic For 0:24:09

Construction Heuristic For Traveling Salesman Problem (TSP) in Python

How an Ising 0:01:21

How an Ising machine solves the traveling salesman problem

Travelling Salesman Problem 0:31:16

Travelling Salesman Problem using Dynamic Programming - Easiest Approach with Code

Solving Travelling Salesman 0:04:31

Solving Travelling Salesman Problem(TSP) using Excel Solver

Traveling Salesman Problem 0:20:28

Traveling Salesman Problem | Dynamic Programming | Graph Theory

Simulated Annealing Visualization: 0:03:00

Simulated Annealing Visualization: Solving Travelling Salesman Problem

Solving Travelling Salesman 0:06:38

Solving Travelling Salesman (TSP) Using 2 Opt Algorithm in Python

7.3 Traveling Salesman 0:24:42

7.3 Traveling Salesman Problem - Branch and Bound

Effective Optimization Solver 0:08:04

Effective Optimization Solver for Travelling Salesman Problem (TSP)

2-opt explaind | 0:01:34

2-opt explaind | TSP optimization tutorial and visualization

Traveling Salesperson Problem 0:08:37

Traveling Salesperson Problem (TSP) - Formulation-2

TSP Approximation Algorithms 0:12:46

TSP Approximation Algorithms | Solving the Traveling Salesman Problem

L-5.4: Traveling Salesman 0:14:12

L-5.4: Traveling Salesman Problem | Dynamic Programming

R9. Approximation Algorithms: 0:31:59

R9. Approximation Algorithms: Traveling Salesman Problem

4.7 [New] Traveling 0:17:18

4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula

Traveling Salesman Problem 0:07:18

Traveling Salesman Problem | Part-1/3 | Dynamic program | Design & Algorithms | Lec-49 | Bhanu P...

The Subtour LP 0:51:01

The Subtour LP for the Traveling Salesman Problem

Комментарии
Автор

You have clear and informative videos. They have helped me to learn especially SQL programming

a_l
Автор

Hello Kindson! Thanks for the tutorial! Are you going to make a follow up video about solving the problem in python?

marcinzaremba
Автор

Question. D to D should be ZERO right? Am I wrong?

aspoonfulofknowledge
Автор

Hi, sorry to comment 3 years after the video, but this seems like the method you explained doesn't actually get you the shortest path because it doesn't look ahead at future costs/distances.
In your example:
You said A C B D A is the shortest path, with a total of 14 (1+1+5+7)
But there's another path, A C D B A that has a total of 11 (1+2+5+3) because it avoids the highest cost/distance path.

This simplified solution is a bit misleading.

JustaBean