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.
Hi,
I want to set up a optimization workflow to optimize crew dispatch problem and I don't know how to begin with. I am trying to work with a small hypothetical case to begin with and will expand it later.
Following are the details
Travel time matrix | ||||
Depot | Site 1 | Site 2 | Site 3 | |
Depot | 0 | 1 | 1 | 1 |
Site 1 | 1 | 0 | 2 | 2 |
Site 2 | 1 | 2 | 0 | 1 |
Site 3 | 1 | 2 | 1 | 0 |
Joborder | Site | Hours to complete the Job |
Job 1 | Enon | 2 |
Job 2 | Site 1 | 3 |
Job 3 | Site 2 | 2 |
Job 4 | Site 3 | 1 |
Job 5 | Site 1 | 4 |
Job 6 | Site 2 | 2 |
@SydneyF thanks for helping me in past for setting up linear optimization in alteryx. I was wondering if you can help me here with this too.
Thanks,
Hi @Ashish,
This is a really interesting use case. It appears to be, at least in part, related to the Traveling Salesmen Problem. This is a very famous and heavily researched topic in mathematics and computer science. The most straightforward method for an exact solution to the Traveling Salesman Problem (TSP) involves a brute force search. This involves creating permutations (ordered combinations) for each set of jobs that would combine to under 8 hours with travel, and then optimizing by completing the maximum number of unique jobs for your two technicians. I believe this might be the route you need to take in order to solve this problem using the Optimization Tool in Alteryx.
What have you developed for this workflow so far? In order to get assistance from the Community, you should post a workflow showing your thinking on the matter, where you have gotten stuck, and some sample data. As a Customer Support Engineer, developing a solution for you from scratch is outside of my scope. If you provide additional details on this case, hopefully a member of our Community will respond.
Thanks!