Shortest Path Problem: Formulation & Solution Using Solver

[@karamjeetsingh-f5z]

Thank you for this video and for explaining the concept. I have two questions which i hope you can answer regardimg this 1) If i want the path to cover all nodes then how to set the constraint 2) Does the concept allow two way direction like if a point is located at dead end and the only way possible is revisiting the prior nodes Really hop you can guide me on this. Thanks

[@aplepaple9195]

Really neatly explained. Cheers man, I wish my lecturer could do that…

[@jiran1234]

Thank you

[@kitirolai]

If the path is a double-way, for example, like b can go c and c can go b in the video, what will be the difference in the constraint?

[@jafacam]

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

[@رِهامعدنانحنونأبوالهيل]

Hlello What is the name of the program that we program this disktra's and prim 's algorithm on? And what is the algorithm for each grant? And thank you✨

[@raphaelnunes9419]

thank you. i used it. have a good day!

[@jiran1234]

Thank you

[@hfdez]

Hello: Thank you, I used a lot.Hossein Fathi

[@jiran1234]

Thank you

[@dhiazalfanadifah996]

its very useful for me, Thank you so much

[@jiran1234]

You are most welcome

[@yashvichauhan1198]

Why are we using 100 or large numbers where no distance is given ??

[@jiran1234]

You can select any large number, but the condition is, it should be larger than any other number in the distance matrix.

[@mykavillafranca8313]

Hi Sir, May I ask if you own the Linear integer programming formulation of a shortest path problem presented in your YT video, so that I may cite you in my research studies? Hoping for a positive response. Thank you.

[@jiran1234]

If you find it useful, you are free to do that. This is a standard formulation, but I have adapted the same for this explanation.

[@mykavillafranca8313]

@@jiran1234 Thanks for the response, sir. In connection with that, may I know the reference (author) you cite for your equation? Hoping for a positive response. Thank you so much.

[@yassineakkes6422]

Good work Plz Can you give us Excel file ?

[@magnusiversen3115]

Do you have a method for solving minimum spanning tree in excel?

[@jiran1234]

Yes, we can do it using easily downloadable external excel add in

[@eka6176]

thank you for tutorial.

[@michaellee7046]

why do we need to add the "large" numbers?

[@jiran1234]

Where there is no connection between the nodes in the network, you are not allowed to take that route and this can be assured in Excel calculation by putting a very large positive number ( much larger than any number in the distance matrix).

[@Andybandy]

Can you show us in Python? Thanks for the video

[@jiran1234]

I am sorry, I have not worked using python.

[@hfdez]

please continue

[@jiran1234]

Please feel free to ask any questions.