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

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

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 line...

Full description

Bibliographic Details
Main Authors: Richard Schuster, Jeffrey O. Hanson, Matthew Strimas-Mackey, Joseph R. Bennett
Format: Article
Language:English
Published: PeerJ Inc. 2020-05-01
Series:PeerJ
Subjects:
Conservation planning
Optimization
Prioritization
Integer linear programming
Prioritizr
Marxan
Online Access:https://peerj.com/articles/9258.pdf

Internet

https://peerj.com/articles/9258.pdf

Similar Items