Evidence map›Paper›PMID 32518737›Full record

ArticlePeerJ2020

Exact integer linear programming solvers outperform simulated annealing for solving conservation planning problems.

Richard Schuster, Jeffrey O Hanson, Matthew Strimas-Mackey, Joseph R Bennett

Abstract read
In one paragraph

Article in PeerJ, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

10 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Systematic conservation prioritization with the prioritizr R package.Conservation biology : the journal of the Society for Conservation Biology · 2025
    Article
  7. Article
  8. Article
  9. Article
  10. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Richard SchusterDepartment of Biology, Carleton University, Ottawa, ON, Canada.ORCID 0000-0003-3191-7869
Jeffrey O HansonSchool of Biological Sciences, University of Queensland, Brisbane, QLD, Australia.ORCID 0000-0002-4716-6134
Matthew Strimas-MackeyCornell Lab of Ornithology, Cornell University, Ithaca, NY, USA.ORCID 0000-0001-8929-7776
Joseph R BennettDepartment of Biology, Carleton University, Ottawa, ON, Canada.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The resources available for conserving biodiversity are limited, and so protected areas need to be established in places that will achieve objectives for minimal cost. Two of the main algorithms for solving systematic conservation planning problems are Simulated Annealing (SA) and exact integer linear programing (EILP) solvers. Using a case study in BC, Canada, we compare the cost-effectiveness and processing times of SA used in Marxan versus EILP using both commercial and open-source algorithms. Plans for expanding protected area systems based on EILP algorithms were 12-30% cheaper than plans using SA, due to EILP's ability to find optimal solutions as opposed to approximations. The best EILP solver we examined was on average 1,071 times faster than the SA algorithm tested. The performance advantages of EILP solvers were also observed when we aimed for spatially compact solutions by including a boundary penalty. One practical advantage of using EILP over SA is that the analysis does not require calibration, saving even more time. Given the performance of EILP solvers, they can be used to generate conservation plans in real-time during stakeholder meetings and can facilitate rapid sensitivity analysis, and contribute to a more transparent, inclusive, and defensible decision-making process.

Indexed as

Conservation planningInteger linear programmingMarxanOptimizationPrioritizationPrioritizr

Identifiers

PMID32518737
PMCPMC7261139

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.