Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
Thanks for showing off Solver's amazing features!
The solver stop after around 1 minute even I left my 'time limit' setting blank. How could yours run over time limit?
Can I do multiple visit as some location requires visit in every 2/4/8wks
Good question. You would have to break that into seperate trips. This will just work for one Trip if I remember right.
Which chapter did you find this problem ?
Hi can you please help with the MTSP code
Hi Scott can you help with another TSP?
Can you share that excel file
Yes, it is here: bit.ly/execfile1
@@Prof_C Thank you so much!! 🙏
And how would you define the objective function of this problem mathematicaly for example Minimise total distance z =
I think you can express the objective function as follows: Minimize Total Distance z = Σ[i=1, n] √(xi - x)^2 + (yi -y)^2, where n = no. of stores, and x & y are the respective store coordinates.
Is this consider with genetic algorithm?
do you know how to do it in latitude and longitude, can you give formula for distance if its real coordinates?
you can use haversine formula or Lambert's
Thanks Brother, i got the great technique
i need help with tsp also city to city
How do I download the file to follow along?
bit.ly/execfile1
@@Prof_C Thanks a lot. Your video has been really helpful for me .
Thanks for showing off Solver's amazing features!
The solver stop after around 1 minute even I left my 'time limit' setting blank. How could yours run over time limit?
Can I do multiple visit as some location requires visit in every 2/4/8wks
Good question. You would have to break that into seperate trips. This will just work for one Trip if I remember right.
Which chapter did you find this problem ?
Hi can you please help with the MTSP code
Hi Scott can you help with another TSP?
Can you share that excel file
Yes, it is here: bit.ly/execfile1
@@Prof_C Thank you so much!! 🙏
And how would you define the objective function of this problem mathematicaly for example
Minimise total distance z =
I think you can express the objective function as follows: Minimize Total Distance z = Σ[i=1, n] √(xi - x)^2 + (yi -y)^2, where n = no. of stores, and x & y are the respective store coordinates.
Is this consider with genetic algorithm?
do you know how to do it in latitude and longitude, can you give formula for distance if its real coordinates?
you can use haversine formula or Lambert's
Thanks Brother, i got the great technique
i need help with tsp also city to city
How do I download the file to follow along?
bit.ly/execfile1
@@Prof_C Thanks a lot. Your video has been really helpful for me .