A comparison of a neighborhood search technique for forest spatial harvest scheduling problems: A case study of the simulated annealing algorithm
Authors:
- Lingbo DongLDLingbo Dong
- Pete BettingerPete Bettinger
- Zhaogang LiuZLZhaogang Liu
- Huiyan QinHQHuiyan Qin
- 1 November 2015
- journal article
- Published by Elsevier in Forest Ecology and Management
- Vol. 356, 124-135
Abstract
No abstract availableFunding Information
- National Science & Technology Pillar Program (2012BAD22B0202, 2011BAD37B02)
- Central Universities of China (2572014AA28)
This publication has 34 references indexed in Scilit:
- Analysis of the performance of different implementations of a heuristic method to optimize forest harvest schedulingSilva Fennica, 2015
- Search reversion within s-metaheuristics: impacts illustrated with a forest planning problemSilva Fennica, 2015
- Applying simulated annealing using different methods for the neighborhood search in forest planning problemsEuropean Journal of Operational Research, 2014
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area RestrictionsOperations Research, 2008
- Optimizing carbon sequestration in commercial forests by integrating carbon management objectives in wood supply modelingMitigation and Adaptation Strategies for Global Change, 2007
- Landscape-level optimization using tabu search and stand density-related forest management prescriptionsEuropean Journal of Operational Research, 2007
- An economic and landscape evaluation of the green-up rules for California, Oregon, and Washington (USA)Forest Policy and Economics, 2006
- Developing a production possibility set of wildlife species persistence and timber harvest valueCanadian Journal of Forest Research, 2002
- Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problemsSilva Fennica, 2002
- Structuring a landscape by forestland classification and harvest scheduling spatial constraintsForest Ecology and Management, 2000