Inspiration of Ant Colony Optimization

Поділитися
Вставка
  • Опубліковано 15 лип 2024
  • To watch the rest of the videos, click here: www.udemy.com/antcolonyoptimi...
    In this course, you will learn about combinatorial optimization problems and algorithms including the Ant Colony Optimization.

КОМЕНТАРІ • 60

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

    Excellent tutorial on ACO... the best on youtube

  • @KcdActrosmp
    @KcdActrosmp 5 років тому +5

    Don't kill 🐜 s appreciate them... well put

  • @shahulrahman2516
    @shahulrahman2516 5 років тому +9

    Fantastic explanation. And the "Moment of Silence" part was awesome

  • @mohammadalirashidioun9738
    @mohammadalirashidioun9738 4 місяці тому

    You are an inspiration in this field

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

    Thank you sir. It was easy to follow through.

  • @user-wz3gi5hv9l
    @user-wz3gi5hv9l 4 роки тому +2

    Thank you~ I have been reading your article recently and it has helped me a lot :)

  • @atheer1988ch
    @atheer1988ch 4 роки тому +5

    thank you.... but the percentage is 3/5 = 60% for blue path..... and 40% for red..... the summation of all probabilities must is equal to 100% for the same sample space.

  • @doditsuprianto4304
    @doditsuprianto4304 5 років тому +1

    nice explanation

  • @theodoregiannilias5140
    @theodoregiannilias5140 3 роки тому +7

    I really appreciate your approaches and your sharing of knowledge. Good job man keep it like this I wish you the very best.

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

      I guess Im randomly asking but does anyone know a way to get back into an Instagram account?
      I somehow lost the account password. I appreciate any tips you can offer me!

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

      @Justin August instablaster ;)

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

      @Malachi Oakley thanks for your reply. I got to the site on google and Im waiting for the hacking stuff now.
      Looks like it's gonna take quite some time so I will reply here later when my account password hopefully is recovered.

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

      @Malachi Oakley It did the trick and I actually got access to my account again. I am so happy:D
      Thanks so much, you saved my account!

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

      @Justin August glad I could help xD

  • @Da_Mewster
    @Da_Mewster 2 місяці тому

    This was wonderful. One thing I notice though is that ants don't usually travel in a straight line, even on flat surfaces. Why is this?

  • @tommyeagen3763
    @tommyeagen3763 5 років тому +2

    i will definitely appreciate them

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

    Aliii bud yani hamishe baram soal bud ke chera in murcheha gomo gur nemishan xd
    Fantasic!

  • @verlouiegautani6667
    @verlouiegautani6667 4 роки тому +2

    From now on i'm gonna appreciate the ants. Lol 😂
    Can you give an application of ACO in Geometry? Thanks ☺️

  • @yusufbaseera1731
    @yusufbaseera1731 4 роки тому

    Please tutorials algorithm next cos it's well explained from here

  • @mandakasayam11
    @mandakasayam11 5 років тому +1

    great

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

    Very cool

  • @robins6293
    @robins6293 5 років тому +3

    Mistake at 17:44. Probabilities for up: 40%, down: 60% , if I am not mistaken.

    • @thealimirjalili
      @thealimirjalili  5 років тому +2

      Opps, or at least, it should be 80 - 20 :D

  • @dr.bonginkosithango454
    @dr.bonginkosithango454 Рік тому

    Genius!

  • @sunny10528
    @sunny10528 4 роки тому

    This is really well-taught! Thank You :)

  • @elhamrasoulidezfouli9915
    @elhamrasoulidezfouli9915 4 роки тому

    I can not thank you enough for your help with modeling concepts. I am gonna be your student on Udemy

  • @uiuxshoaib
    @uiuxshoaib 4 роки тому +1

    Thank you so much Brother. Best explanation ever.

  • @janhvibhosle3852
    @janhvibhosle3852 5 років тому +1

    Sir, you really explain the things excellent. Thank you very much.

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

    How to make such simulation with moving particles?

  • @nirajshukla4887
    @nirajshukla4887 4 роки тому

    Hello do you have video on dragonfly algorithm? If u have then pls load

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

    AOA sir i also want to run this.kindly tell which framework u used ?

  • @ShafiqIslam
    @ShafiqIslam 8 місяців тому

    Prof. Why u stopped making videos??? They are impressive.

  • @fatimazahra-nd9nu
    @fatimazahra-nd9nu 3 роки тому

    how we can detect community in network using ACO

  • @everythingissexy1880
    @everythingissexy1880 4 роки тому +1

    In the last problem , what if both of them go to the longest path and then will come back from it and so on ...? of course I know that when the agents are too many this may occur rarely but when we have few number of agents we should oblige them to go to different path at first time or make them choose it randomly? and also what if we do not know the number of the paths, so what should we done?

    • @Firestorm-tq7fy
      @Firestorm-tq7fy 3 роки тому

      Exactly the question i need a answer for too. I don't wan't to blame anyone, but the video was for amateurs...

  • @UnaidedCommando
    @UnaidedCommando 5 років тому +1

    Concerning Probabilities. Is it actually 100% certain all Ants will stick to the most efficient route?
    Or will there nonetheless, even with immensly strong Pheromones, be a stray ant which would decide to take another patch once again?
    Even if a single ant is irrelevant in the big picture?
    Cheers

    • @thealimirjalili
      @thealimirjalili  5 років тому

      Yes, one problem of this algorithm is trapping in loops if we do not give ants the chanec to choose randomly edges on a graph. I have explained this here: ua-cam.com/video/783ZtAF4j5g/v-deo.html

  • @bhargavamanikanta5242
    @bhargavamanikanta5242 4 роки тому

    Very good explanation.Thank u so much.

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

    dude...!! its so cool, fantastic explanation, best teacher and ever seen in my life.....supeer

  • @ms_1918
    @ms_1918 4 роки тому

    what an excellent explanation.thanks Sir

  • @youcefGRAINAT
    @youcefGRAINAT 5 років тому +1

    Thank you for this video, But please , do you have its application using MATLAB programming ?

    • @thealimirjalili
      @thealimirjalili  5 років тому +1

      Yes, I have implemented this in Matlab already

    • @youcefGRAINAT
      @youcefGRAINAT 5 років тому

      @@thealimirjalili do you sell it or you give it to your student ?

  • @abashesdas5186
    @abashesdas5186 4 роки тому +2

    at 17:48 how can you tell 20% and 90% probability as their sum exceed 100% ???

  • @sudhanshutiwari7089
    @sudhanshutiwari7089 5 років тому

    I wish I had a teacher like you in my college

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

    They can wait for sometime at the water then the can know the shortest one

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

    Yeah - appreciate them instead of killing them.

  • @sarahebal4391
    @sarahebal4391 5 років тому

    Thank you for the good explanation, sir what are the ant colony optimization applications plz ?

    • @thealimirjalili
      @thealimirjalili  5 років тому +1

      Any sort of problem with discrete variables.

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

      @@thealimirjalili sir how can we use metaheuristic methods such as WOA which is used for continuous optimization in discrete optimization problems?

  • @alamgir2k158
    @alamgir2k158 5 років тому

    I am intrest in swqrm intelligence plz suggest me good links and vedios

  • @yicai7
    @yicai7 4 роки тому +1

    Feel like a math pro after watching it