Think you're right!

I am glad it was helpful!

pro tip : you can watch movies at Kaldrostream. Been using them for watching all kinds of movies recently.

@Cruz Jayson Definitely, I've been watching on kaldroStream for since december myself :)

That's HILARIOUS lol you're doing this cause you need it, and I'm doing it cause I'm being forced to do it by my lecturer.

Aravind kamalesh I will try..

Most of these options are available from 2010 only. If you dont have access to 2010 then you can try installing OpenSolver. Its less that 5 MB.

+WilliamBlaky Sorry about the sound quality. No, I dont have any 'recipe'.. :) But i will try to re-record as soon as possible

yes, excel solver window says so

+Akshay Sutrave Thats vehicle routing problem. Ofcourse it could be done with coding. But if you want to do with just excel functions and solver, then it could be a little tricky. Because the number of locations to be covered by a particular vehicle is not fixed. Hence the dif option cannot be used directly. Slightly tricky, but doable. As for the accuracy, you may not obtain an optimal solution but one that is very close. I would definitely give it a try.

How would I be able to program excel to plan two optimal routes for me? What constraints should I add? I'm guessing that is the tricky part.

+Akshay Sutrave It wasn't as tricky as I thought. It took only a couple of minutes to formulate it. You just want to minimize the distance with multiple vehicles, right? Thats not VRP but mTSP. Sorry for misinterpreting the problem. I will try to record a video and post it.

+jeffy joseph Thank you so much! It will really help me in the analysis I want to do. I attempted to formulate it but it would not run correctly the way I was doing it. Let me know when you upload the video, I really appreciate the help!

+Akshay Sutrave This video has really helped me on my project, and I want to give you credit for helping me. If you can email me that would be great!

Its giving a circular route starting at 6 and ending at six. If you start at one and follow the sequence generated, you will come back to 1.

+Wil Ospino yes it will work for both symmetric and asymmetric matrices

jeffy joseph Thanks a lot, this is really useful for me. This is one of the topics of my Grade Project so I can get my degree as Engineer.

That means it not a travelling salesman problem. It has to be a Hamiltonian circuit for it to be a travelling salesman problem. What you’re looking for is not called a travelling salesman problem.

The one I solve in this video starts and ends at the same location. See @4:03

Are you using excel 2010 or above? The older versions have a different solver with lesser number of features. If you are using 2007 try installing Opensolver (~5MB). It's an excel plugin/addon. If i remember correctly, it has alldifferent.

no no it's fine now i have the ''all different '' but my problem is that my project is to defin the minimize the time of cleaning between different production, i have a matrix with all the time needed to go from a formulation to another , and i need to give as an input for example just 4 formulation and the solver has to give me the which formulation should start first, second ... to have the min time of cleaning , and it's working like in your video but i don't want to choose the 7 cities for example just 4 or 3 ... Thank you so much for answering

Soukaina Sadqi Im willing to help you. you can email me. jeff_go12@yahoo.com

Right Now :p , i really need help thank you so much :)

yes you could.

But how exactly?

In this example B11 to I11 represent the solution. For a fixed staring point add a constraint as B11={desired starting city}. If there is a desired ending city, we dont need I11. Delete I11 and add another constraint H11 = {desired ending city}. That should work.

could you please explain more sir ?

Can you send me details about this formula? I really need it please

Aravind kamalesh The 11th row in the video gives the route followed.

Sorry for the late reply. I haven't tried. But solver has a limit of around 100 variables. 79 should be ok. But again I dont know.

+Tatyana Pellan i11 is equated to b11 so that when b11 changes i11 also changes. It does consider that distance from last to first. After solving, the last location is 7 and the distance from last to first appear as 19 in h12

you need to redo the distance matrix to include only those cities/locations.

Yuan Li is right. Since you want only the route through some cities, whats the point in having the whole distance matrix.

I have the same problem , i want to have the whole matrix but every time choose different cities ! i have an undustriel problem which looks like this , how can i do it please ?

I think your problem is vehicle routing problem (where you want to find the shortest route between two points) and not TSP. I have uploaded an other video on mTSP. You could use the same methodology. Just add one more constraint like 'cities 2,4 and 5' should be covered by the same salesman'. It should work. Here is the link : kzfaq.info/get/bejne/pd14pJZ-x9TNoaM.html

Thank you i will try that, i'm really bad in excel :( and i have to finish this project alone to have my degree and finish my internship, thank you so much

change data to be used in solver = make them a constant

@@alexanderschmidt75 hi alex i dont understanf how to make them constant ?