Solving the Travelling Salesman Problem using Ant Colony Optimization

แชร์
ฝัง
  • เผยแพร่เมื่อ 6 ก.ย. 2024

ความคิดเห็น • 14

  • @wolfinthesuit
    @wolfinthesuit 2 ปีที่แล้ว +23

    I hate those damn salesmen can't they solve they problems? I already have problems by my own!!

    • @ibrahimaba8966
      @ibrahimaba8966 2 ปีที่แล้ว +1

      😅😅 this is quite easy

  • @patrickstival6179
    @patrickstival6179 3 ปีที่แล้ว +2

    Nice video. I should probably try to implement this

  • @CosmicLF
    @CosmicLF ปีที่แล้ว

    You are amazing this helped me so much

  • @mohsenabdelaziz9476
    @mohsenabdelaziz9476 3 ปีที่แล้ว +1

    thanks alot for ur great work

  • @greglouis5779
    @greglouis5779 2 ปีที่แล้ว

    What if my graph have n number of nodes, how can I modify the ACO to travel from a specific source to a specific destination without passing through all the n number of nodes but only the nodes to the destination and that's it?

    • @learnbyexample24
      @learnbyexample24  2 ปีที่แล้ว

      You just have to sample paths from the source S to the destination D, rather than all sources and destinations.

  • @aenber
    @aenber ปีที่แล้ว

    Really good Video:) thank you 😊

  • @tamseel101
    @tamseel101 ปีที่แล้ว

    I used your code but it only generated graph. What do u do to auto solve after run?

    • @learnbyexample24
      @learnbyexample24  ปีที่แล้ว

      You got to check the key binding for the 'optimize' action.

  • @36nibs
    @36nibs 2 ปีที่แล้ว

    this doesnt account for alternative directions and axis since its an ant colony you should have 6 axis (up and down) of direction instead of 4 (compass directions)

    • @learnbyexample24
      @learnbyexample24  2 ปีที่แล้ว +1

      The graph is a planar embedding only, actual physical paths can be three dimensional sure.

  • @cheezeworm
    @cheezeworm ปีที่แล้ว

    tsp is not np-complete...