AnsweredAssumed Answered

Optimized walking route on both sides of the street within any drawn polygon and from any start point?

Question asked by nengeesri-ca-esridist Employee on Feb 16, 2016

Hi, what would be the configuration in Network Analyst to solve for a walking route, where a user has drawn a polygon.

The requirements would be to traverse the entire street network, both sides of the street. And the start/end point should be solvable for shortest distance or shortest time. A limit could be that the walker can travel outside the bounding polygon, if required, to get to another street.