I'm a new comer for coding and love to play around. After watching your excellent video, I got an idea about finding the path with maximum score. I got screwed up many time and along the way I learn your logic of your code. Then I finally got it by modifying your code. The first table, I change every cell with value of 100 to -10. On Solver I change Objective to Maximize. My Variable range is the same as your. My Constraints I put all the values of Total Out and Total in to be equal or less than zero (
Hello. Thank you for putting up your shortest path solution. I am trying to do something similar-but-more complex, and am having trouble, and I was wondering if you could give me some guidance. What I want to in Excel with shortest paths is: 1) layout a large m-by-n matrix of nodes, with distances in meters between them. I'll use pseudo-chess-board nomenclature with one axis being A-Z and one axis being numbered 1-n (calling nodes "A1", "C3", "F7", etc) 2) have the ability to request multiple shortest paths from (say) B3->F8, G2->A14, F2->R23, etc 3) partially congest a route based on previous paths. For example, if a route is found it may be tagged as 25% congested between two nodes. Another route may add to this. Eventually the route would be congested, and an alternative shortest path would have to be found. 4) ideally I'd like to make it iteratively optimise, but I realise that may be impossible to do in Excel, so the above congestion may have be sequentially built in Do you know of any examples where such a thing has been done? Thank you in advance, Adam
Nice video, you seem to know a lot, do you know what happens if i got positive cycles in my Graph, solver implies that the shortest path is one cycle with the first node and independent one with the last node, not making a path, even tho the conditions of sum 0 stays
It depends on the set up of your problem. The way I did it the last constraint is -1. If I had set it up as in-out then the first constraint is -1 and the last 1.
100 was just an arbitrarily large number such that solver would not pick any of those paths. You can use any number which is larger than the sum of any single route.
![ถามตรงๆ กับ อาจตุพร ทำไม ประเทศไทย ใครเป็นนายก ก็โดนด่า พอออกเเล้วคนคิดถึง!!?? l [Nickynachat]](http://i.ytimg.com/vi/3YFLMXxBGAs/mqdefault.jpg)
![[TH] VALORANT Champions Seoul - Lower Bracket Final - LEV vs TH](http://i.ytimg.com/vi/fyYkI80GG4o/mqdefault.jpg)
I'm a new comer for coding and love to play around.
After watching your excellent video, I got an idea about finding the path with maximum score.
I got screwed up many time and along the way I learn your logic of your code.
Then I finally got it by modifying your code.
The first table, I change every cell with value of 100 to -10.
On Solver I change Objective to Maximize.
My Variable range is the same as your.
My Constraints I put all the values of Total Out and Total in to be equal or less than zero (
The sound was very low...i was on the max volume but then also, need really quite environment to hear it...BTW really sweet voice and nice explanation
Hello.
Thank you for putting up your shortest path solution. I am trying to do something similar-but-more complex, and am having trouble, and I was wondering if you could give me some guidance.
What I want to in Excel with shortest paths is:
1) layout a large m-by-n matrix of nodes, with distances in meters between them. I'll use pseudo-chess-board nomenclature with one axis being A-Z and one axis being numbered 1-n (calling nodes "A1", "C3", "F7", etc)
2) have the ability to request multiple shortest paths from (say) B3->F8, G2->A14, F2->R23, etc
3) partially congest a route based on previous paths. For example, if a route is found it may be tagged as 25% congested between two nodes. Another route may add to this. Eventually the route would be congested, and an alternative shortest path would have to be found.
4) ideally I'd like to make it iteratively optimise, but I realise that may be impossible to do in Excel, so the above congestion may have be sequentially built in
Do you know of any examples where such a thing has been done?
Thank you in advance,
Adam
Working ❤ thanks
Thank you great video
Very Useful
Wonderful help and you have an excellent, beautiful, captivating voice. Thank you! :)
How did you come up with constraint 1,0,0,0,0,-1? 6:09
I followed this step by step and I am getting an answer that makes no sense for my problem
thank you !!
Nice video, but it will not work for some other examples. I tried this mothed several times. but the result is wrong
Nice video, you seem to know a lot, do you know what happens if i got positive cycles in my Graph, solver implies that the shortest path is one cycle with the first node and independent one with the last node, not making a path, even tho the conditions of sum 0 stays
Thanks a lot
done
thank you very much, but I'm think that the last constraint should be -1 ..!
It depends on the set up of your problem. The way I did it the last constraint is -1. If I had set it up as in-out then the first constraint is -1 and the last 1.
omg my volume is on max i still cant hear you
how to find all possible paths
All of these paths are possible. To determine the number of routes/combinations is a different type of problem (not optimization).
Why 3 can't goes to 2 and How do i know the arrow direction. Thanks
NOT WORKING
SORRY, WORKING
why 100 ?
100 was just an arbitrarily large number such that solver would not pick any of those paths. You can use any number which is larger than the sum of any single route.
@@doultonwiltshire7504 thanks a Lot doulton!