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?
@TheBaconWizard
2 ай бұрын
This won't get rid of mites entirely, it will slow down their reproduction rate to below that of the bees. But you will still need to treat later in the year, especially when the bee population crashes, and in late winter so they get a good start for spring.
@codyrae549
2 ай бұрын
I've had pretty good luck with these pads alone. I have been at 0% while I've used these pads. However, it is something to monitor in case you need to take a different approach with your bees!
@TheBaconWizard
2 ай бұрын
@@codyrae549 I don't actually know, but I would imagine the pads would be enough if you have some VSH bees. Might try that next year.
@user-br1ox6sx1y
9 ай бұрын
What changes should be made if I want the start and end point to be the same?
@navihd9480
Жыл бұрын
Does this work based on the principle of the shortest path?
@lilrex2015
Жыл бұрын
This was insanely helpful. TY
@nneisler
2 жыл бұрын
Thanks. That was a good example that showed the steps to set it up.
@qanat1634
3 жыл бұрын
Great video
@Freitasvg
3 жыл бұрын
Thank you!
@serdensait8972
3 жыл бұрын
thanks, this video + a little brainstorming saved me
@myunglam648
3 жыл бұрын
hey ,... can u help me by show how to solve nearest neigbour and nearest insertion using Traveling salesman problem
@jijis4655
3 жыл бұрын
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
@codyrae549
3 жыл бұрын
Change cell M36 to the number corresponding to Atlanta, in my example it would be 1
@jijis4655
3 жыл бұрын
@@codyrae549I tried but the starting point is changing instead of remaining as atlanta .I know that we have to alter the it statement so can you tell me how if it is for 1
@jijis4655
3 жыл бұрын
And thank you for replying to me☺️
@tsy.allenlzw
3 жыл бұрын
thx
@Kabel93
4 жыл бұрын
Amazing Cody. What happens if there are 2 vehicle where both should at least reach 1 stadium once?
@jasonkepler898
4 жыл бұрын
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.
@aurimasslekonis3130
4 жыл бұрын
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.
@JeffreyFennell692
2 жыл бұрын
Excel’s Evolutionary method is based on the Genetic Algorithm method
@dharmilbavishi2795
4 жыл бұрын
I want to practise
@dharmilbavishi2795
4 жыл бұрын
Hi Cody. Can you pls share the excel file
@leandrogomez9114
4 жыл бұрын
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
@MrDannySanders
4 жыл бұрын
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?
@codyrae549
4 жыл бұрын
Simply create an index number (much like our second constraint). Set the value to 1 if the index number of the last stop is greater than the previously desired stops
@user-wm1ob3vs2t
3 жыл бұрын
I have the same problem. I didn't understand your solution, can you please explain? Thanks
@MrDannySanders
3 жыл бұрын
,What are you looking for. I built a dispatching system in msAccess with automated Google Routes, Can be adjusted to Excel
@user-wm1ob3vs2t
3 жыл бұрын
@@MrDannySanders i have to pickup employees from their homes and drop off each employee in a different location. I have several cars, each car can have 4 employees in it. So A to B, C to D, E to F, G to H. Right now i'm solving it by picking up first and finding the shortest distance between pickup points(A,C,E,G) And then the shortest distance between delivery points(B,D,F,H). however, i could pickup A,C and then drop off B that would be great.
@MrDannySanders
3 жыл бұрын
@@user-wm1ob3vs2t Can you contact me [email protected] I am very interested in solving this. Do all the cars have the same starting point?
@tinkuborah780
4 жыл бұрын
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
@weistrass
3 жыл бұрын
Just add a restriction, as he did. Or simply put an inmense ammout of distance in the data table from A to B (big M).
@IshuGoelIshIshIsh9203
4 жыл бұрын
Great,exactly what I needed! Thank you :)
@jk501111
5 жыл бұрын
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.
Пікірлер