3-opt explaind (and k-opt) | TSP optimization tutorial and visualization

preview_player
Показать описание
This video explains how 3-opt, (and k-opt briefly) heuristic for TSP (travelling salesman problem) works.
Link to 2-opt video:
Traveling Salesman Problem playlist:

Register at top cryptocurrency exchange platform via my link to help support the channel:
There will be no additional commissions for you but I will get 20% cut of your commissions.
  1. Rudi dev
  2. tsp
  3. travelling salesman problem
  4. 3opt
  5. 3-opt
  6. 3-opt algorithm
Рекомендации по теме
3-opt explaind (and 0:02:11

3-opt explaind (and k-opt) | TSP optimization tutorial and visualization

2-opt explaind | 0:01:34

2-opt explaind | TSP optimization tutorial and visualization

Page Replacement 3 0:05:23

Page Replacement 3 OPT

How does the 0:03:26

How does the 3-opt algorithm for TSP work? (3 Solutions!!)

TSP: 3-opt visualization 0:02:41

TSP: 3-opt visualization

The Traveling Salesman 0:30:27

The Traveling Salesman Problem: When Good Enough Beats Perfect

Travelling Salesman Problem: 0:04:14

Travelling Salesman Problem: 2-opt + 3-opt with restarts.

2-opt vs 3-opt 0:01:51

2-opt vs 3-opt comparison

Algoritmo de melhorias 0:19:39

Algoritmo de melhorias de rotas - Algoritmo 3-opt para o problema do Caixeiro Viajante

F-1 international students, 0:00:28

F-1 international students, CPT, OPT, OPT-STEM, H1B, EB3

CP2021 'A k-opt 0:19:50

CP2021 'A k-opt based constraint for the TSP'

3 opt 0:03:42

3 opt

OPT Timeline Explained. 0:01:01

OPT Timeline Explained. #msinus #mastersdegree #mastersinus #telugu #f1visa #opt

Traveling Salesman Problem 0:03:41

Traveling Salesman Problem Optimized: Use 2-opt to find a path through 1000 cities in 16 minutes

Traveling Salesperson Problem 0:10:21

Traveling Salesperson Problem (TSP) - Heuristics

ESA.1.7 On the 0:26:31

ESA.1.7 On the Approximation Ratio of the $k$ Opt and Lin Kernighan Algorithm for Metric and Graph T

3 opt investigación 0:02:00

3 opt investigación de operaciones

Even Computers Can't 0:06:45

Even Computers Can't Solve This Problem

Algorithms for NP-Hard 0:11:58

Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 2/2]

Solving Travelling Salesman 0:06:38

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

Python Code of 0:03:25

Python Code of the 2-Opt Algorithm for Solving the Travelling Salesman Problems (TSP)

GCSE Maths - 0:05:37

GCSE Maths - What on Earth are Surds??? And How do You Simplify Them? (Part 1/3) #40

Work Authorizations, CPT, 0:13:26

Work Authorizations, CPT, OPT, EAD Explained | How to work in the USA as an International Student

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

Nice explanation, but I have some questions.
1.- You said that the selected edges must not be sharing the same vertex, but how can I know which of the edges I have to select?
2.- Why did you reverse the white edges? What is the criteria to change the direction of the edges? Do you have a reference like an article or a book?
3.- How do you determine the new connection? Im talking about how do you know what vertex will be connected with what vertex after the tour change ?
4.-Where did you get that formula to get number of combinations?



I hope I was clear with my doubts. Thank you.

crb
Автор

nice animations, very helpful! I would have appreciated a better pronunciaton of the person explaining, however this video was very helpful.
Could you also share the references (books, papers) you use to make this video? Thanks

justbehappii