Solving Travelling Salesman Problem(TSP) using Excel Solver

preview_player
Показать описание
Given a distance matrix, the optimal path for TSP is found using evolutionary solver module available with Microsoft Excel.

Video made using Screencast-o-Matic free version.
Рекомендации по теме
Комментарии
Автор

No useless explanations, straight to the point! Great work!

robertmainville
Автор

!!!!If you have a issue read this!!!! Set your starting point = to the final point. In this example the cell I11 should read; =B11. What you will see initially is a 1 after deselecting the I11

crisbra
Автор

Thanks! I am going to use this for actually planning my trip, like the salesman. I'm on a holiday in Australia, and wanted to find out the shortest, (possibly cheapest), route between destinations.

joonatankylmaniemi
Автор

It's a long time that I try to use excel to solve TSP. You give me for the easy step to use. thank you very much.

samkorat
Автор

Hey Jeffy, nice video. I found it interesting that you showed how to solve the TSP using the evolutionary algorithm on Solver. I`ve always solved it as an exact method, and I found it very simple to apply with GA. Thanks for this!

luana-almeida
Автор

Thank you so much Jeffy Joseph. I am sure you have made the lives of many of us a lot easier by this simple TSP algorithm. Cheers!

purushottamdutt
Автор

YOOO Mr Joseph, shout out to Thanks to you, I can get my Assignment done.

HELLO MR SILVAM

shakirmohamed
Автор

hello, it's really helpful but how can i do, if i want to know the best combination between 1, 3, and 4 for example not all of them ??? i really need to know how to do that please !!! and thank you very much

soukainasadqi
Автор

Thanks very useful. Just a minor tweak for my start point and it works well. One thing I noted if re-running it the constraints have to be edited to include 'dif' again as that was lost.

stewarthackley
Автор

SO SIMPLE. I LOVE YOU . YOU SAVED MY ASSIGNMENT.

chanjiamin
Автор

Thanks by share the solution, I suggest in the solver add the constraint I11=B11

gust
Автор

Thank you for making a smart video! I did my task of TSP using this video!

stsuboi
Автор

Thank you for sharing this. It's clear and straight to the point!

holenweg
Автор

Should we add the distance from the last node to initial node to the objective?

ijjazmohamed
Автор

So useful and simple, But how can i set a starting point, supposing that 1 is the centre of distrubution where the trucks or vehicles are supposed to come back again?

haidarsandouk
Автор

Which method is used in this video to solve TSP? I tried the same problem using zero- one programming in excel solver (simplex algorithm) and it gives the same result but involves many constraints..

aparnajoshi
Автор

Can I solve this problem with the method you presented? "I have a source of products and 5 destinations, each trailer can hold up to 8 units and I need to satisfy demand". Would this be the model I'm looking for?

timelapselego
Автор

hi Joseph i need to go back to city 1 ? how ah ?

chinhonglee
Автор

How can I solve the same Problem but not for all cities ? how would be the solution if I need to show the distance just for 3 or 4 cities from this 7 cities ?

mohammanhal
Автор

You save my life with this video... many thanks!!

giovannahurtado