IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i2p1265-1282.html
   My bibliography  Save this article

Landscape-level optimization using tabu search and stand density-related forest management prescriptions

Author

Listed:
  • Bettinger, Pete
  • Boston, Kevin
  • Kim, Young-Hwan
  • Zhu, Jianping

Abstract

No abstract is available for this item.

Suggested Citation

  • Bettinger, Pete & Boston, Kevin & Kim, Young-Hwan & Zhu, Jianping, 2007. "Landscape-level optimization using tabu search and stand density-related forest management prescriptions," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1265-1282, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:1265-1282
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00824-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Brumelle, Shelby & Granot, Daniel & Halme, Merja & Vertinsky, Ilan, 1998. "A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 408-424, April.
    2. Keith L. McRoberts, 1971. "A Search Model for Evaluating Combinatorially Explosive Problems," Operations Research, INFORMS, vol. 19(6), pages 1331-1349, October.
    3. David G. Dannenbring, 1977. "Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems," Management Science, INFORMS, vol. 23(12), pages 1273-1283, August.
    4. Los, Marc & Lardinois, Christian, 1982. "Combinatorial programming, statistical optimization and the optimal transportation network problem," Transportation Research Part B: Methodological, Elsevier, vol. 16(2), pages 89-124, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Billionnet, Alain, 2013. "Mathematical optimization ideas for biodiversity conservation," European Journal of Operational Research, Elsevier, vol. 231(3), pages 514-534.
    2. Moriguchi, Kai, 2021. "Identifying optimal forest stand selection under subsidization using stand-level optimal harvesting schedules," Land Use Policy, Elsevier, vol. 108(C).
    3. Binoti, Daniel Henrique Breda & Binoti, Mayra Luiza Marques da Silva & Leite, Helio Garcia & Gleriani, José Marinaldo & Campos, João Carlos Chagas, 2012. "Regulation of even-aged forest with adjacency constraints," Forest Policy and Economics, Elsevier, vol. 20(C), pages 49-57.
    4. Rashidi, Eghbal & Medal, Hugh & Gordon, Jason & Grala, Robert & Varner, Morgan, 2017. "A maximal covering location-based model for analyzing the vulnerability of landscapes to wildfires: Assessing the worst-case scenario," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1095-1105.
    5. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2017. "Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1094-1108.
    6. Kim, Young-Hwan & Bettinger, Pete & Finney, Mark, 2009. "Spatial optimization of the pattern of fuel management activities and subsequent effects on simulated wildfires," European Journal of Operational Research, Elsevier, vol. 197(1), pages 253-265, August.
    7. Dong, Lingbo & Lu, Wei & Liu, Zhaogang, 2018. "Developing alternative forest spatial management plans when carbon and timber values are considered: A real case from northeastern China," Ecological Modelling, Elsevier, vol. 385(C), pages 45-57.
    8. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2020. "Establishing optimal forest harvesting regulation with continuous approximation," Operations Research Perspectives, Elsevier, vol. 7(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wilson, Amy D. & King, Russell E. & Wilson, James R., 2004. "Case study on statistically estimating minimum makespan for flow line scheduling problems," European Journal of Operational Research, Elsevier, vol. 155(2), pages 439-454, June.
    2. Robert L. Nydick & Howard J. Weiss, 1994. "An analytical evaluation of optimal solution value estimation procedures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(2), pages 189-202, March.
    3. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    4. Isabel Martins & Mujing Ye & Miguel Constantino & Maria Conceição Fonseca & Jorge Cadima, 2014. "Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 343-362, April.
    5. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
    6. Kenneth Carling & Xiangli Meng, 2016. "On statistical bounds of heuristic solutions to location problems," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1518-1549, May.
    7. González-González, José M. & Vázquez-Méndez, Miguel E. & Diéguez-Aranda, Ulises, 2020. "A note on the regularity of a new metric for measuring even-flow in forest planning," European Journal of Operational Research, Elsevier, vol. 282(3), pages 1101-1106.
    8. Kenneth Carling & Xiangli Meng, 2015. "Confidence in heuristic solutions?," Journal of Global Optimization, Springer, vol. 63(2), pages 381-399, October.
    9. Salassi, M. E. & Breaux, J. B. & Naquin, C. J., 2002. "Modeling within-season sugarcane growth for optimal harvest system selection," Agricultural Systems, Elsevier, vol. 73(3), pages 261-278, September.
    10. Bettinger, Pete & Boston, Kevin, 2008. "Habitat and commodity production trade-offs in coastal Oregon," Socio-Economic Planning Sciences, Elsevier, vol. 42(2), pages 112-128, June.
    11. Binoti, Daniel Henrique Breda & Binoti, Mayra Luiza Marques da Silva & Leite, Helio Garcia & Gleriani, José Marinaldo & Campos, João Carlos Chagas, 2012. "Regulation of even-aged forest with adjacency constraints," Forest Policy and Economics, Elsevier, vol. 20(C), pages 49-57.
    12. Salassi, Michael E. & Champagne, Lonnie P. & Legendre, Benjamin L., 2000. "Incorporation Of Within-Season Yield Growth Into A Mathematical Programming Sugarcane Harvest Scheduling Model," Journal of Agricultural and Applied Economics, Southern Agricultural Economics Association, vol. 32(3), pages 1-13, December.
    13. C R Reeves & A V Eremeev, 2004. "Statistical analysis of local search landscapes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 687-693, July.
    14. Rinnooy Kan, A. H. G., 1985. "Probabilistic Analysis Of Algorithms," Econometric Institute Archives 272328, Erasmus University Rotterdam.
    15. Amit Kumar & Sabyasachee Mishra & Huan Ngo, 2023. "Dynamic Wireless Charging Facility Location Problem for Battery Electric Vehicles under Electricity Constraint," Networks and Spatial Economics, Springer, vol. 23(3), pages 679-713, September.
    16. Vig, Vikrant & Palekar, Udatta S., 2008. "On estimating the distribution of optimal traveling salesman tour lengths using heuristics," European Journal of Operational Research, Elsevier, vol. 186(1), pages 111-119, April.
    17. Marin, Angel & Salmeron, Javier, 1996. "Tactical design of rail freight networks. Part II: Local search methods with statistical analysis," European Journal of Operational Research, Elsevier, vol. 94(1), pages 43-53, October.
    18. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2010. "A meta-heuristic approach for solving the Urban Network Design Problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 144-157, February.
    19. Huizhen Zhang & Miguel Constantino & André Falcão, 2011. "Modeling forest core area with integer programming," Annals of Operations Research, Springer, vol. 190(1), pages 41-55, October.
    20. Borges, Paulo & Eid, Tron & Bergseng, Even, 2014. "Applying simulated annealing using different methods for the neighborhood search in forest planning problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 700-710.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:1265-1282. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.