Thanks for the constraint idea where you activate 1 for the starting point and activate 1 for a second stop.. and can probably continue adding 1s to keep the order specific @ certain stops.

Thanks. That was a good example that showed the steps to set it up.

I tried this method with all of the baseball stadiums. I ran the solver till it told me it couldn't do better and it gave me a distance of 9,243 miles. But when I plotted the route it was obvious that that wasn't the shortest possible route. By manually doing the Travelling Salesman algorithm of going to the closest destination that hasn't been traveled to yet and then untwisting any loops that form, I got a distance of 7,481 miles. So the solver solution was 23.5% longer. But I'm not good enough with Excel to make it do my algorithm automatically, so it takes a long time to do it manually.

thanks, this video + a little brainstorming saved me

This was insanely helpful. TY

Great,exactly what I needed! Thank you :)

Great video

Thank you!

Hi. Thank you for simple method of solving traveling salesman problem, it worked for me, but I have only one question: on what algorithm this method is based? I need to describe this more fundamentally in my project.

what if i want to repeat a city again? for instance, i wanna go to dallas once before the 10th stop and once after the 20th, is it possible?

Amazing Cody. What happens if there are 2 vehicle where both should at least reach 1 stadium once?

What changes should be made if I want the start and end point to be the same?

Does this work based on the principle of the shortest path?

thx

gracias. una pregunta. ¿Cómo realizo la programación de las rutas cuando no se deben incluir todas las ciudades a visitar?. esto es, generar segmentos para rutear. por ejemplo. si hay 30 ciudades, pero yo solo necesito visitar 7 ciudades, ¿cómo se realiza? porque cuando se hace como lo planteas, solver busca las distancias mas cortas aún cuando la ciudad no está en la ruta que deseo, pero si en la tabla de distancias. Espero puedas ayudarme

hey ,... can u help me by show how to solve nearest neigbour and nearest insertion using Traveling salesman problem

Thanks for the nice explanation. Is there a way to include constraints which says we are not allowed to visit from city A to city B . In general we consider that all the cities are accessible from all other cities with a cost associated. But how do I let the solver know that certain routes between cities is not possible

I want to practise

Hi Cody. Can you pls share the excel file

Pick up and deliver constraint for courier business. We have pickup A and C and delivery to B and D.. the courier can’only go to delivery point D if he has been to pickup point C. Can you put this as a formula to the solver?

In your problem itself how can I execute this if I want my starting and ending point to be atlanta Please help me with this