Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Loops in calculating receiver distances #52

Closed
PieterjanVerhelst opened this issue Feb 8, 2017 · 5 comments
Closed

Loops in calculating receiver distances #52

PieterjanVerhelst opened this issue Feb 8, 2017 · 5 comments

Comments

@PieterjanVerhelst
Copy link
Collaborator

PieterjanVerhelst commented Feb 8, 2017

Automatically calculating receiver distances in longitudinal networks works excellent. A new challenge is calculating distances when loops are present, due to parallel canals. For example, fish migrating through the Albert Canal have different options to get into the Schelde in Antwerpen:

  1. migration along the Albert canal - calculating the distances works with the current script (prepare_dataset.R)
  2. moving into parallel canals (the 'Kempische kanalen'), resulting in different possible distances to move from station A to B (see figure below; note that the 2 loops are connected to eachother at the cross section).
    How could this be implemented in the script?
    ak_network_loops
@stijnvanhoey
Copy link
Contributor

stijnvanhoey commented Feb 8, 2017

As the current script searches for the least cost-distance, this is not supported yet. As a side note, the current matrix is containing a single defined distance in between each receiver (NxN matrix). How would you propose to represent these alternative routes?

@PieterjanVerhelst
Copy link
Collaborator Author

Maybe an additional code can be written in case loops are present. The presence of loops can be indicated in the external network csv file (e.g. column 'loop' with '1' next to the stations that are part of a loop).
I think it is possible when the loop-trajectories are given a different weights
http://desktop.arcgis.com/en/arcmap/latest/tools/spatial-analyst-toolbox/creating-the-least-cost-path.htm

@IPauwels
Copy link
Collaborator

IPauwels commented Feb 10, 2017 via email

@stijnvanhoey
Copy link
Contributor

@IPauwels could you upload your figure as well (on gitub: edit comment, just drag your picture into the edit field)

@damianooldoni
Copy link
Member

I close this issue as it is further discussed in a very similar way in #68.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants