A new method to solve the fully connected Reserve Network Design Problem

•We propose a new mixed integer programming model to solve the Reserve Network Design Problem.•The model is simpler in concept and in implementation than existing exact models.•The model enforces contiguity of selected sites.•With small changes to the basic formulation the model can handle various r...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 231; číslo 1; s. 202 - 209
Hlavní autoři: Jafari, Nahid, Hearne, John
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.11.2013
Elsevier Sequoia S.A
Témata:
Algorithms
Compactness
Conservation
Contiguity
Handles
Heuristic
Integer programming
Mathematical models
Mixed integer programming
Network flow problem
Networks
Operational research
Optimization
Optimization algorithms
Reserve Network Design Problem
Reserves
Shipments
Site selection
Spatial optimisation
Studies
Wildlife conservation
Mixed integer programming
Reserve Network Design Problem
Spatial optimisation
Site selection
Compactness
Contiguity
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We propose a new mixed integer programming model to solve the Reserve Network Design Problem.•The model is simpler in concept and in implementation than existing exact models.•The model enforces contiguity of selected sites.•With small changes to the basic formulation the model can handle various related problems. In selecting sites for conservation purposes connectivity of habitat is important for allowing species to move freely within a protected area. The aim of the Reserve Network Design Problem is to choose a network of contiguous sites which maximises some conservation objective subject to various constraints. The problem has been solved using both heuristic and exact methods. Heuristic methods can handle much larger problems than exact methods but cannot guarantee an optimal solution. Improvements in both computer power and optimisation algorithms have increased the attractiveness of exact methods. The aim of this work is to formulate an improved algorithm for solving the Reserve Network Design Problem. Based on the concept of the transshipment problem a mixed integer programming model is formulated that achieves contiguity of the selected sites. The model is simpler in concept and to implement than previous exact models and does not require any assumptions about the regular shape of candidate sites. The method easily handles the case where more than one reserve system is required. We illustrate this with an example obtaining the trade-off between the number of contiguous areas and utility. We also illustrate that the important property of compactness can be achieved while maintaining contiguity of selected sites.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.05.015