Computational Model Library

Managing Connectivity: insights from modelling species interactions accross multiple scales in an idealized landscape (1.1.0)

The model comprises two connected patches. The link that connects the two patches represents the cost of movement between habitats. Predators and prey move across the landscape according to predetermined rules. Prey and predators reproduce, predators are able to hunt and kill prey and die of natural causes. The carrying capacity of the patches is dynamic, based on the presence of prey. A manager is able to alter the connection between patches in order to hinder or facilitate movement of species. The management objective is always the maximization of the coexistence time.

Release Notes

Associated Publications

This release is out-of-date. The latest version is 1.2.0

Managing Connectivity: insights from modelling species interactions accross multiple scales in an idealized landscape 1.1.0

The model comprises two connected patches. The link that connects the two patches represents the cost of movement between habitats. Predators and prey move across the landscape according to predetermined rules. Prey and predators reproduce, predators are able to hunt and kill prey and die of natural causes. The carrying capacity of the patches is dynamic, based on the presence of prey. A manager is able to alter the connection between patches in order to hinder or facilitate movement of species. The management objective is always the maximization of the coexistence time.

Version Submitter First published Last modified Status
1.2.0 Jacopo A. Baggio Mon Jan 20 18:21:38 2014 Tue Feb 20 12:19:35 2018 Published
1.1.0 Jacopo A. Baggio Thu Nov 14 18:18:41 2013 Tue Feb 20 18:48:05 2018 Published
1.0.0 Jacopo A. Baggio Mon Oct 1 21:34:50 2012 Tue Feb 20 18:48:21 2018 Published

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept