Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis
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...
Gespeichert in:
| Veröffentlicht in: | Environmental and ecological statistics 1997-06, Vol.4 (2), p.153-165 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 165 |
|---|---|
| container_issue | 2 |
| container_start_page | 153 |
| container_title | Environmental and ecological statistics |
| container_volume | 4 |
| creator | Arthur, Jeffrey L Hachey, Mark Sahr, Kevin Huso, Manuela Kiester, A R |
| description | 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.[PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1023/A:1018570311399 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_16318037</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2158439991</sourcerecordid><originalsourceid>FETCH-LOGICAL-c257t-a3fd3e14f000fea2ee6ad794f6d14ef058547afaaa991340f88db5af1fea5503</originalsourceid><addsrcrecordid>eNpdkL1PwzAQxS0EEqUws1oMbAFfHNdOt6qigFSJpXt1Tc7g4sQldpD47zGFieXd109PT8fYNYg7EKW8X8xBgFFaSABZ1ydsAkrLQgpRn-ZeqrIwSqhzdhHjXghRQakm7H3l-tb1rxy95-GQXIeex-DH5EIfeQo8vREfKNLwSTy6lIU8NT9nfhjCzlM35zYM3ejxuMS-5U3oDmM6ztkOs3xFFy_ZmUUf6eqvTtlm9bBZPhXrl8fn5WJdNKXSqUBpW0lQ2RzSEpZEM2x1XdlZCxVZoYyqNFpErGuQlbDGtDuFFjKslJBTdvtrm-N9jBTTtnOxIe-xpzDGLcwkGCF1Bm_-gfswDjls3GqlAfL_jPwGMdJp0A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>757111578</pqid></control><display><type>article</type><title>Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis</title><source>SpringerLink Journals - AutoHoldings</source><creator>Arthur, Jeffrey L ; Hachey, Mark ; Sahr, Kevin ; Huso, Manuela ; Kiester, A R</creator><creatorcontrib>Arthur, Jeffrey L ; Hachey, Mark ; Sahr, Kevin ; Huso, Manuela ; Kiester, A R</creatorcontrib><description>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.[PUBLICATION ABSTRACT]</description><identifier>ISSN: 1352-8505</identifier><identifier>EISSN: 1573-3009</identifier><identifier>DOI: 10.1023/A:1018570311399</identifier><language>eng</language><publisher>Dordrecht: Springer Nature B.V</publisher><subject>Algorithms ; Conservation areas ; Heuristic ; Integer programming ; Nature reserves ; Operations research ; Site selection ; Studies</subject><ispartof>Environmental and ecological statistics, 1997-06, Vol.4 (2), p.153-165</ispartof><rights>Chapman and Hall 1997</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c257t-a3fd3e14f000fea2ee6ad794f6d14ef058547afaaa991340f88db5af1fea5503</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Arthur, Jeffrey L</creatorcontrib><creatorcontrib>Hachey, Mark</creatorcontrib><creatorcontrib>Sahr, Kevin</creatorcontrib><creatorcontrib>Huso, Manuela</creatorcontrib><creatorcontrib>Kiester, A R</creatorcontrib><title>Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis</title><title>Environmental and ecological statistics</title><description>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.[PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Conservation areas</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Nature reserves</subject><subject>Operations research</subject><subject>Site selection</subject><subject>Studies</subject><issn>1352-8505</issn><issn>1573-3009</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpdkL1PwzAQxS0EEqUws1oMbAFfHNdOt6qigFSJpXt1Tc7g4sQldpD47zGFieXd109PT8fYNYg7EKW8X8xBgFFaSABZ1ydsAkrLQgpRn-ZeqrIwSqhzdhHjXghRQakm7H3l-tb1rxy95-GQXIeex-DH5EIfeQo8vREfKNLwSTy6lIU8NT9nfhjCzlM35zYM3ejxuMS-5U3oDmM6ztkOs3xFFy_ZmUUf6eqvTtlm9bBZPhXrl8fn5WJdNKXSqUBpW0lQ2RzSEpZEM2x1XdlZCxVZoYyqNFpErGuQlbDGtDuFFjKslJBTdvtrm-N9jBTTtnOxIe-xpzDGLcwkGCF1Bm_-gfswDjls3GqlAfL_jPwGMdJp0A</recordid><startdate>19970601</startdate><enddate>19970601</enddate><creator>Arthur, Jeffrey L</creator><creator>Hachey, Mark</creator><creator>Sahr, Kevin</creator><creator>Huso, Manuela</creator><creator>Kiester, A R</creator><general>Springer Nature B.V</general><scope>3V.</scope><scope>7SN</scope><scope>7ST</scope><scope>7UA</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>BKSAR</scope><scope>C1K</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>F1W</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>H97</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.G</scope><scope>LK8</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7P</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PCBAR</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYCSY</scope><scope>Q9U</scope><scope>RC3</scope><scope>SOI</scope></search><sort><creationdate>19970601</creationdate><title>Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis</title><author>Arthur, Jeffrey L ; Hachey, Mark ; Sahr, Kevin ; Huso, Manuela ; Kiester, A R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c257t-a3fd3e14f000fea2ee6ad794f6d14ef058547afaaa991340f88db5af1fea5503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithms</topic><topic>Conservation areas</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Nature reserves</topic><topic>Operations research</topic><topic>Site selection</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Arthur, Jeffrey L</creatorcontrib><creatorcontrib>Hachey, Mark</creatorcontrib><creatorcontrib>Sahr, Kevin</creatorcontrib><creatorcontrib>Huso, Manuela</creatorcontrib><creatorcontrib>Kiester, A R</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Ecology Abstracts</collection><collection>Environment Abstracts</collection><collection>Water Resources Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Earth, Atmospheric & Aquatic Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ASFA: Aquatic Sciences and Fisheries Abstracts</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Aquatic Science & Fisheries Abstracts (ASFA) 3: Aquatic Pollution & Environmental Quality</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Aquatic Science & Fisheries Abstracts (ASFA) Professional</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Biological Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Earth, Atmospheric & Aquatic Science Database</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><collection>Genetics Abstracts</collection><collection>Environment Abstracts</collection><jtitle>Environmental and ecological statistics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Arthur, Jeffrey L</au><au>Hachey, Mark</au><au>Sahr, Kevin</au><au>Huso, Manuela</au><au>Kiester, A R</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis</atitle><jtitle>Environmental and ecological statistics</jtitle><date>1997-06-01</date><risdate>1997</risdate><volume>4</volume><issue>2</issue><spage>153</spage><epage>165</epage><pages>153-165</pages><issn>1352-8505</issn><eissn>1573-3009</eissn><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.[PUBLICATION ABSTRACT]</abstract><cop>Dordrecht</cop><pub>Springer Nature B.V</pub><doi>10.1023/A:1018570311399</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1352-8505 |
| ispartof | Environmental and ecological statistics, 1997-06, Vol.4 (2), p.153-165 |
| issn | 1352-8505 1573-3009 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_16318037 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Conservation areas Heuristic Integer programming Nature reserves Operations research Site selection Studies |
| title | Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T22%3A42%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Finding%20all%20optimal%20solutions%20to%20the%20reserve%20site%20selection%20problem:%20formulation%20and%20computational%20analysis&rft.jtitle=Environmental%20and%20ecological%20statistics&rft.au=Arthur,%20Jeffrey%20L&rft.date=1997-06-01&rft.volume=4&rft.issue=2&rft.spage=153&rft.epage=165&rft.pages=153-165&rft.issn=1352-8505&rft.eissn=1573-3009&rft_id=info:doi/10.1023/A:1018570311399&rft_dat=%3Cproquest%3E2158439991%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=757111578&rft_id=info:pmid/&rfr_iscdi=true |