Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis

Finding all optimal solutions to the reserve site selection problem: formulation and... The problem of selecting nature reserves has received increased attention in the literature during the past decade, and a variety of approaches have been promoted for selecting those sites to include in a reserve network. One set of techniques employs heuristic algorithms and thus provides possibly sub-optimal solutions. Another set of models and accompanying algorithms uses an integer programming formulation of the problem, resulting in an optimization problem known as the Maximal Covering Problem, or MCP. Solution of the MCP provides an optimal solution to the reserve site selection problem, and while various algorithms can be employed for solving the MCP they all suffer from the disadvantage of providing a single optimal solution dictating the selection of areas for conservation. In order to provide complete information to decision makers, the determination of all alternate optimal solutions is necessary. This paper explores two procedures for finding all such solutions. We describe the formulation and motivation of each method. A computational analysis on a data set describing native terrestrial vertebrates in the state of Oregon illustrates the effectiveness of each approach. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Environmental and Ecological Statistics Springer Journals

Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis

Loading next page...
 
/lp/springer-journals/finding-all-optimal-solutions-to-the-reserve-site-selection-problem-GgRunmR000
Publisher
Springer Journals
Copyright
Copyright © 1997 by Chapman and Hall
Subject
Life Sciences; Ecology; Statistics, general; Mathematical and Computational Biology; Evolutionary Biology
ISSN
1352-8505
eISSN
1573-3009
DOI
10.1023/A:1018570311399
Publisher site
See Article on Publisher Site

Abstract

The problem of selecting nature reserves has received increased attention in the literature during the past decade, and a variety of approaches have been promoted for selecting those sites to include in a reserve network. One set of techniques employs heuristic algorithms and thus provides possibly sub-optimal solutions. Another set of models and accompanying algorithms uses an integer programming formulation of the problem, resulting in an optimization problem known as the Maximal Covering Problem, or MCP. Solution of the MCP provides an optimal solution to the reserve site selection problem, and while various algorithms can be employed for solving the MCP they all suffer from the disadvantage of providing a single optimal solution dictating the selection of areas for conservation. In order to provide complete information to decision makers, the determination of all alternate optimal solutions is necessary. This paper explores two procedures for finding all such solutions. We describe the formulation and motivation of each method. A computational analysis on a data set describing native terrestrial vertebrates in the state of Oregon illustrates the effectiveness of each approach.

Journal

Environmental and Ecological StatisticsSpringer Journals

Published: Sep 28, 2004

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off