Wow, that did not feel like 23 minutes. Love it when someone is so effective at teaching that the time flies by AND you absorb the information completely!
You are part of a new breed of educator. A true trail-blazer. Someone who can communicate very complicated concepts in a straight forward, easy-to-understand manner.
You are a genius, you pick up exactly those problems which get too little attention in the college. I think its a hard work you do, but your teaching skills are outstanding. Please keep it up. God bless you.
Neel, this is not the TSP solved here but the shortest path from SP to DB. There is no obligation to pass through every single node of the graph. Subtour elimination constraints need not be used in this particular problem. If you are interested in extending this problem to eliminate subtours, one alternative is to enforoce the MTZ constraints that should read: v(i)-u(j)
This was perfect. My only problem is that I had WAY TOO MANY variable cells (244 nodes and 2684 paths). Using OpenSolver works great, even when the model is already created.
Good day Mr Foltz, i am curious as to how you eliminated subtours from this solution...i am working on a TSP for a large problem and cant seem to eliminate subours...Thanks
Great Explanation. I just have one question: If instead of travelling from the police station to the barn, the troopers had to start and finish the trip at the police station? What would be the supply and demand values for the police station?
What a wonderful explaination. I was able to create it and worked like a charm. Just that I wanted to Project the OnRoute and Alternate Onroute. Please help. Thanks,
This is exactly what I was looking for and all worked great until I increased the number of variables. It seems to vary, but once I reach about 50 variables, the resulting path skips a bunch of nodes. If the resulting path should have been 1-2-3-4-5-6-7-8-9-10, the answer I get is something like 1-2 & 8-9-10. The path between 2 & 8 seems to get lost and is not added to the total distance. Everything works fine with a small quantity of variables. Has anyone had a similar experience, or been successful with a larger number of variables? Also, as a side note, Excel Solver has a limit of 200 variables. To get more variables (which I need), I need to purchase the professional version.
Wow, that did not feel like 23 minutes. Love it when someone is so effective at teaching that the time flies by AND you absorb the information completely!
You are part of a new breed of educator. A true trail-blazer. Someone who can communicate very complicated concepts in a straight forward, easy-to-understand manner.
You are a genius, you pick up exactly those problems which get too little attention in the college. I think its a hard work you do, but your teaching skills are outstanding. Please keep it up. God bless you.
You are one true saver Mr! Thank you for your effort!
Great explanations. Simplified so well, I wish every teacher I ever had worked like this :)
Neel, this is not the TSP solved here but the shortest path from SP to DB. There is no obligation to pass through every single node of the graph. Subtour elimination constraints need not be used in this particular problem. If you are interested in extending this problem to eliminate subtours, one alternative is to enforoce the MTZ constraints that should read: v(i)-u(j)
This helped me so much with my homework, thank you.
spread sheet not found
This was perfect. My only problem is that I had WAY TOO MANY variable cells (244 nodes and 2684 paths). Using OpenSolver works great, even when the model is already created.
Does anyone know how to do this for two routes in the same map?
Good Job! Very useful for my operational research course!!
Hongtao Ma Tomorrow's my final exam at this subject, if i fail you'll teach me in the next semester :D haha
The blog post doesnt work anymore :(
Good day Mr Foltz, i am curious as to how you eliminated subtours from this solution...i am working on a TSP for a large problem and cant seem to eliminate subours...Thanks
hi this problem about is chinese postman type? could you explain it
How did "From" label came up when typing SUMIF label...? pls help
why i cant add constraint ? keep saying the content empty
Great Explanation. I just have one question: If instead of travelling from the police station to the barn, the troopers had to start and finish the trip at the police station? What would be the supply and demand values for the police station?
What a wonderful explaination. I was able to create it and worked like a charm. Just that I wanted to Project the OnRoute and Alternate Onroute. Please help.
Thanks,
Very clear :) Thank youuuu !!!
Thank you Rosali!
Hey. Great and very helpful video. Do you have a easy way to find the second fastest route? :D
Hey Brandon, nice vid! Can you please update the spreadsheet link above because it doesn't work anymore. Thank you :)
This is exactly what I was looking for and all worked great until I increased the number of variables. It seems to vary, but once I reach about 50 variables, the resulting path skips a bunch of nodes. If the resulting path should have been 1-2-3-4-5-6-7-8-9-10, the answer I get is something like 1-2 & 8-9-10. The path between 2 & 8 seems to get lost and is not added to the total distance.
Everything works fine with a small quantity of variables. Has anyone had a similar experience, or been successful with a larger number of variables?
Also, as a side note, Excel Solver has a limit of 200 variables. To get more variables (which I need), I need to purchase the professional version.
OpenSolver is the way to go. It works the same way on the surface, but is way better than the regular Solver. (plus it's open source)
Well done! Please accept my appreciation!
Lovely😇