Solve the Traveling salesman problem (Genetic Algorithm, Ant Colony Optimization)

preview_player
Показать описание

In this Video we gonna Solve the traveling salesman problem using 3 solutions
. Brute force Approach (random, lexicographic ordering)
. Genetic Algorithm
. Ant colony optimization (ACS, ELITIST, MAX-MIN)

Intro: (0:00)
Brute-Force: (1:28)
Genetic-Algorithm: (2:14)
Ant-Colony-optimization: (3:05)
Visualization: (5:35)
outro: (8:45)

Documentations:

found me on:

Thanks for watching and subscribe.

music:
"Savfk - Instructions For Living A Life" is under a Creative Commons (CC BY-SA 3.0) license.

#genetic-algorithm #ant-colony-optimization # tsp #travelingsalesmanproblem #graph #visualization
Рекомендации по теме
Комментарии
Автор

Minor correction here 0:49. Only the decision version (i.e. is there a tour with cost less than c) is NP-Complete. The general problem of finding the cheapest tour is NP-Hard, but not NP-complete.

Great video regardless!

radifire
Автор

When intro rolled, I felt like Superman :)

suzanne
Автор

How to implement multiple traveling salesman problem using NSGA-2 in python.

theWorldOfIss
Автор

How to use the code, now I have a little confuse.

jujeep
Автор

How to solve multiple traveling salesman problem using NSGA-2 in python? Help me brother 🙏🙏🙏

theWorldOfIss
Автор

What name of background music at 4:00?

tvybert
Автор

Can you make a script for taxiway route in airport??

brigasazura