Hello everyone,
I built a network dataset to handle a route analysis. The data source is a single polylines feature class.
Some lines are marked as obstacles (an attribute field records whether a line represents an obstacle or not).
I would like to set up a travel mode that has the number of obstacles as the first cost impedance and the path length as the second impedance criterion.
Basically, route solution must find the path with the fewest obstacles. When two or more solutions have the same minimum number of obstacles, the solution is the path of shortest distance.
Do you have any ideas on how to solve this case?
Many thanks
Massimo
