Shortest path along one occurence of different services

Discussion created by kmaat on Mar 11, 2014
Latest reply on Mar 17, 2014 by jsandhu-esristaff

I have a set of origin points and a set of destination points. Destinations are divided in 3 types: A, B, and C. The amount of occurences of each type varies. For each origin, I need the shortest path along one occurence of each type, i.e. the shortest path along an A, a B, and a C. The real-world problem is: give me for every house the shortest path that connects a baker, a bookshop, and a drugstore. It does not matter which baker/bookshop/drugstore, I just need my shoppings.

Hope someone can help me,