A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm

•The usefulness of the s-metaheuristic neighborhood search of simulated annealing was explored.•The 2-opt moves can significantly improve the quality of solutions than 1-opt moves.•The maximum solution values were usually more than 98% of the estimated optimal values.•The spatial constraint types ha...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Forest ecology and management 2015-11, Vol.356, p.124-135
Hauptverfasser: Dong, Lingbo, Bettinger, Pete, Liu, Zhaogang, Qin, Huiyan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 135
container_issue
container_start_page 124
container_title Forest ecology and management
container_volume 356
creator Dong, Lingbo
Bettinger, Pete
Liu, Zhaogang
Qin, Huiyan
description •The usefulness of the s-metaheuristic neighborhood search of simulated annealing was explored.•The 2-opt moves can significantly improve the quality of solutions than 1-opt moves.•The maximum solution values were usually more than 98% of the estimated optimal values.•The spatial constraint types had significant effects on the ultimate economic benefits. In this research application paper, the usefulness of the s-metaheuristic neighborhood search technique of simulated annealing algorithm when applied to forest management planning problems was explored. We concentrated on tactical forest spatial harvest scheduling problems where the net present value of management activities over thirty 1-yr periods was to be maximized. Constraints mainly included those related to the need for an even-flow of scheduled wood products and the need for spatial constraint types, i.e., unit restriction model and area restriction model, respectively. Four hypothetical grid datasets with different age class distributions (i.e., young, normal, older and spatially organized) and one real dataset from northeastern China were used to illustrate how a 2-opt moves can intensify a search within high-quality areas of a solution space and thus produce higher-valued solutions as compared to the sole use of 1-opt moves. Finally, extreme value theory was employed to estimate the global optimum solution and to evaluate the quality of the heuristic solutions. We found that the 2-opt technique not only produced consistently better solutions than the 1-opt technique in terms of the mean and maximum solutions values, but also significantly decreased the standard deviations associated with the sets of solutions. The maximum solution values were usually more than 98% of the estimated optimal values. The motivation for using a 2-opt technique is found in the generation of more efficient solutions that will allow a forestry organization to produce higher returns to its owners.
doi_str_mv 10.1016/j.foreco.2015.07.026
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1770280846</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0378112715004077</els_id><sourcerecordid>1732807291</sourcerecordid><originalsourceid>FETCH-LOGICAL-c508t-28546290a9ad2f6723dc6de58b66f1a74da4f5b02e6dc367295e54f06d2093203</originalsourceid><addsrcrecordid>eNqNkc-KFDEQxoMoOK6-gYccvXRbSXeSHg_CsvgPFrzoOdQk1dMZujtjkl7Yx_CNzex4Fg9FUeT3fZXiY-ytgFaA0O9P7RgTudhKEKoF04LUz9hODEY2Bnr5nO2gM0MjhDQv2aucTwCgVD_s2O9b7uJyxhRyXHkcOfKVwnE6xDTF6HkmTG7ihdy0hl8b8brpUpQLz2csAWc-YXp4mt1EfpvDeuTnFA8zLfkDr_6Yieey-ceLf5nqEJZtxkKe47oSPilwPsYUyrS8Zi9GnDO9-dtv2M_Pn37cfW3uv3_5dnd73zgFQ2nkoHot94B79HLURnbeaU9qOGg9CjS9x35UB5Ckvevq-16R6kfQXsK-k9DdsHdX3_rXelgudgnZ0TzjSnHLVhgDcoCh1_-BdpWsK0RF-yvqUsw50WjPKSyYHq0AewnLnuw1LHsJy4KxNawq-3iVUb34IVCy2QVaHflQ2WJ9DP82-ANepKGD</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1732807291</pqid></control><display><type>article</type><title>A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm</title><source>ScienceDirect Freedom Collection (Elsevier)</source><creator>Dong, Lingbo ; Bettinger, Pete ; Liu, Zhaogang ; Qin, Huiyan</creator><creatorcontrib>Dong, Lingbo ; Bettinger, Pete ; Liu, Zhaogang ; Qin, Huiyan</creatorcontrib><description>•The usefulness of the s-metaheuristic neighborhood search of simulated annealing was explored.•The 2-opt moves can significantly improve the quality of solutions than 1-opt moves.•The maximum solution values were usually more than 98% of the estimated optimal values.•The spatial constraint types had significant effects on the ultimate economic benefits. In this research application paper, the usefulness of the s-metaheuristic neighborhood search technique of simulated annealing algorithm when applied to forest management planning problems was explored. We concentrated on tactical forest spatial harvest scheduling problems where the net present value of management activities over thirty 1-yr periods was to be maximized. Constraints mainly included those related to the need for an even-flow of scheduled wood products and the need for spatial constraint types, i.e., unit restriction model and area restriction model, respectively. Four hypothetical grid datasets with different age class distributions (i.e., young, normal, older and spatially organized) and one real dataset from northeastern China were used to illustrate how a 2-opt moves can intensify a search within high-quality areas of a solution space and thus produce higher-valued solutions as compared to the sole use of 1-opt moves. Finally, extreme value theory was employed to estimate the global optimum solution and to evaluate the quality of the heuristic solutions. We found that the 2-opt technique not only produced consistently better solutions than the 1-opt technique in terms of the mean and maximum solutions values, but also significantly decreased the standard deviations associated with the sets of solutions. The maximum solution values were usually more than 98% of the estimated optimal values. The motivation for using a 2-opt technique is found in the generation of more efficient solutions that will allow a forestry organization to produce higher returns to its owners.</description><identifier>ISSN: 0378-1127</identifier><identifier>EISSN: 1872-7042</identifier><identifier>DOI: 10.1016/j.foreco.2015.07.026</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Area restriction model ; Constrictions ; Forest management ; Green-up constraints ; Harvest scheduling ; Management ; Mathematical models ; Neighborhood search technique ; Scheduling ; Searching ; Simulated annealing ; Unit restriction model</subject><ispartof>Forest ecology and management, 2015-11, Vol.356, p.124-135</ispartof><rights>2015 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c508t-28546290a9ad2f6723dc6de58b66f1a74da4f5b02e6dc367295e54f06d2093203</citedby><cites>FETCH-LOGICAL-c508t-28546290a9ad2f6723dc6de58b66f1a74da4f5b02e6dc367295e54f06d2093203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.foreco.2015.07.026$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Dong, Lingbo</creatorcontrib><creatorcontrib>Bettinger, Pete</creatorcontrib><creatorcontrib>Liu, Zhaogang</creatorcontrib><creatorcontrib>Qin, Huiyan</creatorcontrib><title>A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm</title><title>Forest ecology and management</title><description>•The usefulness of the s-metaheuristic neighborhood search of simulated annealing was explored.•The 2-opt moves can significantly improve the quality of solutions than 1-opt moves.•The maximum solution values were usually more than 98% of the estimated optimal values.•The spatial constraint types had significant effects on the ultimate economic benefits. In this research application paper, the usefulness of the s-metaheuristic neighborhood search technique of simulated annealing algorithm when applied to forest management planning problems was explored. We concentrated on tactical forest spatial harvest scheduling problems where the net present value of management activities over thirty 1-yr periods was to be maximized. Constraints mainly included those related to the need for an even-flow of scheduled wood products and the need for spatial constraint types, i.e., unit restriction model and area restriction model, respectively. Four hypothetical grid datasets with different age class distributions (i.e., young, normal, older and spatially organized) and one real dataset from northeastern China were used to illustrate how a 2-opt moves can intensify a search within high-quality areas of a solution space and thus produce higher-valued solutions as compared to the sole use of 1-opt moves. Finally, extreme value theory was employed to estimate the global optimum solution and to evaluate the quality of the heuristic solutions. We found that the 2-opt technique not only produced consistently better solutions than the 1-opt technique in terms of the mean and maximum solutions values, but also significantly decreased the standard deviations associated with the sets of solutions. The maximum solution values were usually more than 98% of the estimated optimal values. The motivation for using a 2-opt technique is found in the generation of more efficient solutions that will allow a forestry organization to produce higher returns to its owners.</description><subject>Algorithms</subject><subject>Area restriction model</subject><subject>Constrictions</subject><subject>Forest management</subject><subject>Green-up constraints</subject><subject>Harvest scheduling</subject><subject>Management</subject><subject>Mathematical models</subject><subject>Neighborhood search technique</subject><subject>Scheduling</subject><subject>Searching</subject><subject>Simulated annealing</subject><subject>Unit restriction model</subject><issn>0378-1127</issn><issn>1872-7042</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNqNkc-KFDEQxoMoOK6-gYccvXRbSXeSHg_CsvgPFrzoOdQk1dMZujtjkl7Yx_CNzex4Fg9FUeT3fZXiY-ytgFaA0O9P7RgTudhKEKoF04LUz9hODEY2Bnr5nO2gM0MjhDQv2aucTwCgVD_s2O9b7uJyxhRyXHkcOfKVwnE6xDTF6HkmTG7ihdy0hl8b8brpUpQLz2csAWc-YXp4mt1EfpvDeuTnFA8zLfkDr_6Yieey-ceLf5nqEJZtxkKe47oSPilwPsYUyrS8Zi9GnDO9-dtv2M_Pn37cfW3uv3_5dnd73zgFQ2nkoHot94B79HLURnbeaU9qOGg9CjS9x35UB5Ckvevq-16R6kfQXsK-k9DdsHdX3_rXelgudgnZ0TzjSnHLVhgDcoCh1_-BdpWsK0RF-yvqUsw50WjPKSyYHq0AewnLnuw1LHsJy4KxNawq-3iVUb34IVCy2QVaHflQ2WJ9DP82-ANepKGD</recordid><startdate>20151101</startdate><enddate>20151101</enddate><creator>Dong, Lingbo</creator><creator>Bettinger, Pete</creator><creator>Liu, Zhaogang</creator><creator>Qin, Huiyan</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SN</scope><scope>7ST</scope><scope>C1K</scope><scope>SOI</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>20151101</creationdate><title>A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm</title><author>Dong, Lingbo ; Bettinger, Pete ; Liu, Zhaogang ; Qin, Huiyan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c508t-28546290a9ad2f6723dc6de58b66f1a74da4f5b02e6dc367295e54f06d2093203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Area restriction model</topic><topic>Constrictions</topic><topic>Forest management</topic><topic>Green-up constraints</topic><topic>Harvest scheduling</topic><topic>Management</topic><topic>Mathematical models</topic><topic>Neighborhood search technique</topic><topic>Scheduling</topic><topic>Searching</topic><topic>Simulated annealing</topic><topic>Unit restriction model</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dong, Lingbo</creatorcontrib><creatorcontrib>Bettinger, Pete</creatorcontrib><creatorcontrib>Liu, Zhaogang</creatorcontrib><creatorcontrib>Qin, Huiyan</creatorcontrib><collection>CrossRef</collection><collection>Ecology Abstracts</collection><collection>Environment Abstracts</collection><collection>Environmental Sciences and Pollution Management</collection><collection>Environment Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>Forest ecology and management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dong, Lingbo</au><au>Bettinger, Pete</au><au>Liu, Zhaogang</au><au>Qin, Huiyan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm</atitle><jtitle>Forest ecology and management</jtitle><date>2015-11-01</date><risdate>2015</risdate><volume>356</volume><spage>124</spage><epage>135</epage><pages>124-135</pages><issn>0378-1127</issn><eissn>1872-7042</eissn><abstract>•The usefulness of the s-metaheuristic neighborhood search of simulated annealing was explored.•The 2-opt moves can significantly improve the quality of solutions than 1-opt moves.•The maximum solution values were usually more than 98% of the estimated optimal values.•The spatial constraint types had significant effects on the ultimate economic benefits. In this research application paper, the usefulness of the s-metaheuristic neighborhood search technique of simulated annealing algorithm when applied to forest management planning problems was explored. We concentrated on tactical forest spatial harvest scheduling problems where the net present value of management activities over thirty 1-yr periods was to be maximized. Constraints mainly included those related to the need for an even-flow of scheduled wood products and the need for spatial constraint types, i.e., unit restriction model and area restriction model, respectively. Four hypothetical grid datasets with different age class distributions (i.e., young, normal, older and spatially organized) and one real dataset from northeastern China were used to illustrate how a 2-opt moves can intensify a search within high-quality areas of a solution space and thus produce higher-valued solutions as compared to the sole use of 1-opt moves. Finally, extreme value theory was employed to estimate the global optimum solution and to evaluate the quality of the heuristic solutions. We found that the 2-opt technique not only produced consistently better solutions than the 1-opt technique in terms of the mean and maximum solutions values, but also significantly decreased the standard deviations associated with the sets of solutions. The maximum solution values were usually more than 98% of the estimated optimal values. The motivation for using a 2-opt technique is found in the generation of more efficient solutions that will allow a forestry organization to produce higher returns to its owners.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.foreco.2015.07.026</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0378-1127
ispartof Forest ecology and management, 2015-11, Vol.356, p.124-135
issn 0378-1127
1872-7042
language eng
recordid cdi_proquest_miscellaneous_1770280846
source ScienceDirect Freedom Collection (Elsevier)
subjects Algorithms
Area restriction model
Constrictions
Forest management
Green-up constraints
Harvest scheduling
Management
Mathematical models
Neighborhood search technique
Scheduling
Searching
Simulated annealing
Unit restriction model
title A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T16%3A19%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20comparison%20of%20a%20neighborhood%20search%20technique%20for%20forest%20spatial%20harvest%20scheduling%20problems:%20A%20case%20study%20of%20the%20simulated%20annealing%20algorithm&rft.jtitle=Forest%20ecology%20and%20management&rft.au=Dong,%20Lingbo&rft.date=2015-11-01&rft.volume=356&rft.spage=124&rft.epage=135&rft.pages=124-135&rft.issn=0378-1127&rft.eissn=1872-7042&rft_id=info:doi/10.1016/j.foreco.2015.07.026&rft_dat=%3Cproquest_cross%3E1732807291%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1732807291&rft_id=info:pmid/&rft_els_id=S0378112715004077&rfr_iscdi=true