Maximize reward S. T. Deviation <= H1 (H1 is say any threshold value) & Total times(s, d) <= H2 (s is Source, d is Destination, H2 is limit on total time)
blackwinter Just fabulous sir... Thanks for all the time and effort u putted to arrange these all resources for me. It's a lot really a lot help. Thank u sooo much and that video is really helpful... And this algorithm seems really powerful than traditional brute force... Will make a cop code for it soon sir.. Really thanks a lot... Just one question sir.. When to stop doing iterations... ?
blackwinter sir.... Awesome... Will put a counter there for threshold and... Will make a ga for knapsack first and then will try for multidimensions... . Really thanks a lot sir.. And specially for that video.. Even in 5 mins explains soo well.. Thank u soo much sir
blackwinter great sir... And sir the textual answer u written cleared all... Really... Found that no of genes in chromosomes r *n which not found in video but from ur answer.... Thanks sir Will come with hw soon
blackwinter sir... Plz can u tell me about multidimensional knapsack problem.... I actually don't know about it an did not even found a single understandable code for it on internet... Just know that this problem will be solved by multidimensional knapsack problem... Here we have a drone which moves from point a to point b and in between there are tasks and for each task we have been given a reward and a time is taken by it.. Till yet it seems to be 0/1 knapsack problem but. There's a variation that a fixed path is given which needed to be followed on choice that if that path is followed then no deviation cost will be added and if path is not followed then deviation cost will be added... We have to find and optimal path of tasks such that reward is maximum and the time for tasks is minimum also deviation cost is minimum... Here H1 is the limit of deviation that more than it deviation cannot be used in the path And H2 is the total time limit for drone to fly
blackwinter aaaawwwwweeesomeeee sir.... A c code 😱😱😱... thaaaaaanku sooooo ooo much.. 😱😱😱😱 Will try to learn it 😱 Thanks a lot sir... And this code will help others tooo who r trying to learn it... Ur answer + code.. All complete 😊 Thanks a lot sir