{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:35:14Z","timestamp":1725485714793},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68783-2_13","type":"book-chapter","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T13:14:17Z","timestamp":1181308457000},"page":"437-473","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Long-Term Forest Treatment Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Martin","family":"St\u00f8levik","sequence":"first","affiliation":[]},{"given":"Geir","family":"Hasle","sequence":"additional","affiliation":[]},{"given":"Oddvar","family":"Kloster","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Local Search in Combinatorial Optimization","year":"1997","key":"13_CR1","unstructured":"E. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons Ltd, Chichester, England, 1997."},{"key":"13_CR2","unstructured":"T. Back, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation, chapter Penalty Functions-Section C 5.2. Oxford Univ. Press, 1995."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"P. Bettinger, K. Boston, Y.-H. Kim, and J. Zhu. Landscape-level optimization using tabu search and stand density-related forest management prescriptions. European J. Oper. Res., 2006, doi:10.1016\/j.ejor.2005.09.025.","DOI":"10.1016\/j.ejor.2005.09.025"},{"issue":"11","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1139\/cjfr-29-11-1784","volume":"29","author":"P. Bettinger","year":"1999","unstructured":"P. Bettinger, K. Boston, and J. Sessions. Intensifying a heuristic forest harvest scheduling search procedure with 2-opt decision choices. Can. J. For. Res., 29(11):1784\u20131792, 1999.","journal-title":"Can. J. For. Res."},{"issue":"5","key":"13_CR5","first-page":"738","volume":"49","author":"F. Caro","year":"2003","unstructured":"F. Caro, M. Constantino, I. Martins, and A. Weintraub. A 2-opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old growth and even flow constraints. For. Sci., 49(5):738\u2013751, 2003.","journal-title":"For. Sci."},{"issue":"1","key":"13_CR6","first-page":"1","volume":"49","author":"K. Crowe","year":"2003","unstructured":"K. Crowe and J. Nelson. An indirect search algorithm for harvest-scheduling under adjacency constraints. For. Sci., 49(1):1\u201311, 2003.","journal-title":"For. Sci."},{"issue":"9","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1139\/x03-101","volume":"33","author":"K. Crowe","year":"2003","unstructured":"K. Crowe, J. Nelson, and M. Boyland. Solving the area-restricted harvest-scheduling model using the branch and bound algorithm. Can. J. For. Res., 33(9):1804\u20131814, 2003.","journal-title":"Can. J. For. Res."},{"issue":"10","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2500","DOI":"10.1139\/x05-139","volume":"35","author":"K. A. Crowe","year":"2005","unstructured":"K. A. Crowe and J. D. Nelson. An evaluation of the simulated annealing algorithm for solving the area-restricted harvest-scheduling model against optimal benchmarks. Can. J. For. Res., 35(10):2500\u20132509, 2005.","journal-title":"Can. J. For. Res."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover. Tabu search-a tutorial. Interfaces, 20(4):74\u201394, 1990.","journal-title":"Interfaces"},{"volume-title":"Handbook of Metaheuristics","year":"2003","key":"13_CR10","unstructured":"F. Glover and G. Kochenberger, editors. Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA, USA, 2003."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna. Tabu search. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1287\/opre.1040.0169","volume":"53","author":"M. Goycoolea","year":"2005","unstructured":"M. Goycoolea, A. T. Murray, F. Barahona, R. Epstein, and A. Weintraub. Harvest scheduling subject to maximum area restrictions: Exploring exact approaches. Oper. Res., 53(3):490\u2013500, 2005.","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"13_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1018997923403","volume":"95","author":"G. Hasle","year":"2000","unstructured":"G. Hasle, J. Haavardtun, O. Kloster, and A. L\u00f8kketangen. Interactive planning for sustainable forest management. Ann. Oper. Res., 95(1\u20134):19\u201340, 2000.","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"13_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.14214\/sf.419","volume":"38","author":"T. Heinonen","year":"2004","unstructured":"T. Heinonen and T. Pukkala. A comparison of one-and two-compartment neighbourhoods in heuristic search with spatial forest management goals. Silva Fennica, 38(3):319\u2013332, 2004.","journal-title":"Silva Fennica"},{"issue":"3","key":"13_CR15","first-page":"631","volume":"29","author":"M. Hindsberger","year":"2000","unstructured":"M. Hindsberger and R. V. V. Vidal. Tabu search-a guided tour. Control Cybernet., 29(3):631\u2013651, 2000.","journal-title":"Control Cybernet."},{"issue":"4","key":"13_CR16","first-page":"526","volume":"44","author":"M. Hoganson","year":"1998","unstructured":"M. Hoganson and G Borges. Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems. For. Sci., 44(4):526\u2013538, 1998.","journal-title":"For. Sci."},{"issue":"3","key":"13_CR17","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1139\/x93-065","volume":"23","author":"C. Lockwood","year":"1993","unstructured":"C. Lockwood and T. Moore. Harvest scheduling with spatial constraints-a simulated annealing approach. Can. J. For. Res., 23(3):468\u2013478, 1993.","journal-title":"Can. J. For. Res."},{"issue":"3","key":"13_CR18","first-page":"403","volume":"47","author":"M. E. McDill","year":"2001","unstructured":"M. E. McDill and J. Braze. Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. For. Sci., 47(3):403\u2013418, 2001.","journal-title":"For. Sci."},{"issue":"4","key":"13_CR19","first-page":"631","volume":"48","author":"M. E. McDill","year":"2002","unstructured":"M. E. McDill, S. A. Rebain, and J. Braze. Harvest scheduling with area-based adjacency constraints. For. Sci., 48(4):631\u2013642, 2002.","journal-title":"For. Sci."},{"key":"13_CR20","unstructured":"G. Misund, G. Hasle, and B. S. Johansen. Solving the clear-cut scheduling problem with geographical information technology and constraint reasoning. In Proceedings of the Third International Conference\/Workshop on Integrating GIS and Environmental Modelling, 1996."},{"key":"13_CR21","unstructured":"D. S. Mullen and R. M. Butler. The design of a genetic algorithm based spatially constrained timber harvest scheduling model. In Proceedings of the Seventh Symposium on Systems Analysis in Forest Resources, pages 57\u201365, 1997."},{"issue":"2\u20133","key":"13_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01719265","volume":"17","author":"A. T. Murray","year":"1995","unstructured":"A. T. Murray and R. L. Church. Heuristic solution approaches to operational forest planning problems. OR Spectrum, 17(2\u20133):193\u2013203, 1995.","journal-title":"OR Spectrum"},{"issue":"1","key":"13_CR23","first-page":"45","volume":"45","author":"A.T. Murray","year":"1999","unstructured":"A.T. Murray. Spatial restrictions in harvest scheduling. For. Sci., 45(1):45\u201352, 1999.","journal-title":"For. Sci."},{"issue":"1\u20133","key":"13_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0378-1127(01)00487-X","volume":"161","author":"K. \u00d6hman","year":"2002","unstructured":"K. \u00d6hman and L. O. Eriksson. Allowing for spatial consideration in long-term forest planning by linking linear programming with simulated annealing. For. Ecol. Manage., 161(1\u20133):221\u2013230, 2002.","journal-title":"For. Ecol. Manage."},{"issue":"1","key":"13_CR25","first-page":"142","volume":"40","author":"A. Weintraub","year":"1994","unstructured":"A. Weintraub, F. Baharona, and R. Epstein. A column generation algorithm for solving general forest planning problems with adjacency constraints. For. Sci., 40(1):142\u2013161, 1994.","journal-title":"For. Sci."},{"issue":"2","key":"13_CR26","first-page":"274","volume":"43","author":"A. Weintraub","year":"1997","unstructured":"A. Weintraub, G. Saez, and M. Yadlin. Aggregation procedures in forest management planning using cluster analysis. For. Sci., 43(2):274\u2013285, 1997.","journal-title":"For. Sci."},{"volume-title":"Model building in Mathematical Programming","year":"1978","key":"13_CR27","unstructured":"H. P. Williams, editor. Model building in Mathematical Programming. John Wiley & Sons Ltd, Chichester, England, 1978."},{"volume-title":"Model Solving in Mathematical Programming","year":"1983","key":"13_CR28","unstructured":"H. P. Williams, editor. Model Solving in Mathematical Programming. John Wiley & Sons Ltd, Chichester, England, 1983."}],"container-title":["Geometric Modelling, Numerical Simulation, and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68783-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:13:22Z","timestamp":1620015202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68783-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540687825"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68783-2_13","relation":{},"subject":[]}}