I am running Maximum Capacitated Coverage Location-Allocation with about 6000 demand points and 8 facilities. I was wondering about the demand point's behaviour during this analysis.
1. If the demand point is not located directly on a network, does it search for the nearest (Euclidian Distance) network, go to that chosen network by straight path, and then follows the Dijkstra's algorithm to the closest facility?
2. Does it head in the straight direction of the closest facility (Euclidian distance) until it reaches a network, and then follows the Dijkstra's Algorithm to the facility?
I would love if there are any sources related to this topic as well.
Thank you in advance.