This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
It seems to me I've seen this before but I can remember where. I'm looking for a way to put in multiple address and determine the optimal route to hit them all. Does anyone know if this app exists in the gallery or is in a blog somewhere?
It sounds like you're talking about the Traveling Salesman Problem. This is a pretty (in)famous problem in math/computer science, and there's not a convenient exact solution (other than brute force, which can be computationally impossible in large enough scenarios). I can check around for you on the gallery for a solution if you want, but I'm not familiar with any off the top of my head.
Thanks Bridget, if you have some free time I'd appreciate the help otherwise the link might be of help if I have time to wrk on this in the future. It was one of those last minute, get it done right now requests. Thanks again for the heads up.
Unfortunately no one on my team knows of any existing tools or macros that will solve this problem. However, the Advanced Analytics team is currently working on an optimization suite which will be entering the beta phase soon. Would you be interested in being a beta customer? There may be an optimal routing macro implemented using it.
Oh, nice! I don't know how fast that source is, since I tried it with 6 addresses 12 minutes ago, and it's still running. But maybe it's good enough with a smaller number of addresses. Knowing how smart the AA team is, though, I'm pretty sure that a route optimization macro made with their optimization suite will be much faster. :)