Travelling Salesman Problem using Hill Climbing in Python | Artificial Intelligence
Вставка
- Опубліковано 20 січ 2021
- Hill climbing is a mathematical optimization algorithm, which means its purpose is to find the best solution to a problem which has a (large) number of possible solutions. Explaining the algorithm (and optimization in general) is best done using an example. In the Travelling salesman problem, we have a salesman who needs to visit a number of cities exactly once, after which he returns to the first city. The distances between each pair of cities are known, and we need to find the shortest route. As you can imagine, there is (often) a large number of possible solutions (routes) to a specific Travelling salesman problem; the goal is to find the best (i.e. the shortest) solution.
🔗Important Links:
Artificial Intelligence Playlist: • Artificial Intelligence
Steepest Ascent Hill Climbing: • Steepest Ascent Hill C...
Article Credit: towardsdatascience.com/how-to...
🌐Join our community:
Android App(Codes+Videos): play.google.com/store/apps/de...
Facebook: / thinkxacademy
Twitter: / thinkxacademy
Instagram: / thinkxacademy
#artificialintelligence #python #hillclimbing
Thanks man! that really helped. Your playlist is great. Carry on!
Thanks for appreciation keep learning and supporting me😊
Thankyou. I was pretty confused with all the functions. I have now a better understanding about how this code works, and generally how to go about it.
This is Indded one of the best explanation of the problems based on TSP
Thanks🙌🏻Check out our channel and share our content to support us😊
Thank you for this great explaination.
Thanks😀 Share our videos to help this channel grow💯
Great job.It was very helpful
Thanks bro👍🏻
I need hill climbing approach for solving suduko...any idea where to get that.
Please help 🙏🙏
thanks a lot man👍👍
Welcome😀Share our content to help this channel grow😄
thanks man!
Keep learning 💯
What type of search does this use? Is it the Best-First search, Greedy Best First search, Beam search, A* search methods, Breadth-First Search, Uniform Cost Search, Depth First Search, or Iterative Deepening Depth First Search methods?
sir can you make a video on genetic algorithm
Can we implement this if we have coordinates of the cities? for ex. x and y
Use the coordinates to calculate the distance between the cities first using distance formula then proceed with the same algo
how can i do that?
Is it possible to make the user input his own distances and it will still work?
Yes you can take user input distances but as I have discussed before due to limitations of hill climbing like local optima the algorithm may not give the correct answer
@@ThinkXAcademy Yea I noticed since I was having errors. Thank you!
are you sure that get_neighbors function returns all possible combinations of paths, as I tested it, and I think it not !
Yes it will fail in case of disconnected graphs. You will have to handle that edge case.
can you do it on java please
i need code source here please
It is available here: www.thinkxacademy.com/Artificial%20Intelligence
Thanks..! But i need cheapest insertion heuristic's algorithm in python:(
Oh yes i will create a video on that in this AI playlist👍🏻
@@ThinkXAcademy thank youu 💪🏻
Btw, i need that algorithm for my essay😅
No problem this algorithm seems pretty interesting i will work on it and will definitely create a video tutorial👍🏻
@@ThinkXAcademy thanks, i wish the best for you🙏🏻💪🏻
Good explanation but reduce the video time ..
source--code pls
You can see code on our website here: www.thinkxacademy.com