Fig 1.
Schematic diagram of the steps of the action optimization algorithm.
T is the number of iterations; n is the number of species; m is the number of sites; ΔOF is the difference between the value of the objective function at iteration t and the value of the objective function at iteration t-1; rnd is a number randomly drawn from a uniform distribution; Temp is the temperature parameter.
Fig 2.
Spatial distribution of the occurrence of the threats in the case study area.
Occurrence data represent presence or absence of a threat in each site. Threats include (1) water buffalo, (2) cane toad, (3) river flow alteration and (4) grazing land use.
Fig 3.
Spatial distribution of the actions selected by the action prioritization algorithm.
Results are shown for increasing values of the Connectivity Strength Modifier (CSM).
Fig 4.
Proportion of sites where each action was selected for the fixed and the independent prioritization approach.
The value on the y axis is calculated as number of sites where the action was selected out of the total number of sites where the action was available for selection. Results are shown for different values of BLM (Fixed Prioritization Approach) and CSM (Independent Prioritization Approach) (A—F).
Fig 5.
Efficiency of the best solution for increasing degrees of connectivity achieved in the best solution, and for different prioritization approaches.
Efficiency is a measure of the ratio between the cost of the selected actions and the cost of all potential actions. The degree of connectivity is calculated as one minus the ratio of the connectivity penalty of the best solution, for a specific value of BLM (Fixed approach), or CSM (Independent approach), and the highest connectivity penalty among the best solutions for all values of BLM, or CSM. Dots represent the fixed prioritization approach, while triangles represent the independent prioritization approach.