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

КОМЕНТАРІ • 36

  • @MuhammadUsman-fl7lo
    @MuhammadUsman-fl7lo 3 роки тому +2

    Thanks man! that really helped. Your playlist is great. Carry on!

    • @ThinkXAcademy
      @ThinkXAcademy  3 роки тому +1

      Thanks for appreciation keep learning and supporting me😊

  • @abdulsammadsaeed1199
    @abdulsammadsaeed1199 Рік тому +1

    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.

  • @siddharthpangotra4662
    @siddharthpangotra4662 3 роки тому +2

    This is Indded one of the best explanation of the problems based on TSP

    • @ThinkXAcademy
      @ThinkXAcademy  3 роки тому

      Thanks🙌🏻Check out our channel and share our content to support us😊

  • @saurabhgiram9973
    @saurabhgiram9973 2 роки тому

    Thank you for this great explaination.

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому

      Thanks😀 Share our videos to help this channel grow💯

  • @arsamhmdi8374
    @arsamhmdi8374 2 роки тому

    Great job.It was very helpful

  • @its_niraj01
    @its_niraj01 2 роки тому

    I need hill climbing approach for solving suduko...any idea where to get that.
    Please help 🙏🙏

  • @omkarsonawane1113
    @omkarsonawane1113 2 роки тому +2

    thanks a lot man👍👍

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому +1

      Welcome😀Share our content to help this channel grow😄

  • @topadda8386
    @topadda8386 2 роки тому +2

    thanks man!

  • @samouda717
    @samouda717 Рік тому

    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?

  • @shivamdubey4783
    @shivamdubey4783 Рік тому

    sir can you make a video on genetic algorithm

  • @saurabhgiram9973
    @saurabhgiram9973 2 роки тому

    Can we implement this if we have coordinates of the cities? for ex. x and y

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому

      Use the coordinates to calculate the distance between the cities first using distance formula then proceed with the same algo

    • @laurafreitas8058
      @laurafreitas8058 2 роки тому

      how can i do that?

  • @panayiotispp
    @panayiotispp 3 роки тому +2

    Is it possible to make the user input his own distances and it will still work?

    • @ThinkXAcademy
      @ThinkXAcademy  3 роки тому

      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

    • @panayiotispp
      @panayiotispp 3 роки тому +1

      @@ThinkXAcademy Yea I noticed since I was having errors. Thank you!

  • @CodePhiles
    @CodePhiles 2 роки тому

    are you sure that get_neighbors function returns all possible combinations of paths, as I tested it, and I think it not !

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому +1

      Yes it will fail in case of disconnected graphs. You will have to handle that edge case.

  • @dionisiusa.ddagho1299
    @dionisiusa.ddagho1299 Рік тому

    can you do it on java please

  • @nouraber5781
    @nouraber5781 2 роки тому

    i need code source here please

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому

      It is available here: www.thinkxacademy.com/Artificial%20Intelligence

  • @faridrisqf
    @faridrisqf 2 роки тому

    Thanks..! But i need cheapest insertion heuristic's algorithm in python:(

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому +1

      Oh yes i will create a video on that in this AI playlist👍🏻

    • @faridrisqf
      @faridrisqf 2 роки тому

      @@ThinkXAcademy thank youu 💪🏻

    • @faridrisqf
      @faridrisqf 2 роки тому

      Btw, i need that algorithm for my essay😅

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому +1

      No problem this algorithm seems pretty interesting i will work on it and will definitely create a video tutorial👍🏻

    • @faridrisqf
      @faridrisqf 2 роки тому +1

      @@ThinkXAcademy thanks, i wish the best for you🙏🏻💪🏻

  • @user-fq8xf1yw1d
    @user-fq8xf1yw1d 10 місяців тому

    Good explanation but reduce the video time ..

  • @bigdaystv5856
    @bigdaystv5856 2 роки тому +1

    source--code pls

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому +1

      You can see code on our website here: www.thinkxacademy.com