A deterministic harvest scheduler using perfect bin-packing theorem

European Journal of Forest Research

Volumn 129, Issue 5, 2010, Pages 961-974

  Strimbu, Bogdan M ^a   Innes, John L ^b   Strimbu, Victor F ^b  

^a LOUISIANA TECH UNIVERSITY   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Adjacency greenup; Delay; First fit decreasing algorithm; Linear programing; Maximum volume harvested annually; Simulated annealing

Indexed keywords

ALGORITHM; FOREST MANAGEMENT; FORESTRY PRODUCTION; HEURISTICS; LINEAR PROGRAMING; OPTIMIZATION; SIMULATED ANNEALING; SPATIOTEMPORAL ANALYSIS; THEORETICAL STUDY; TIMBER HARVESTING;

BRITISH COLUMBIA; CANADA;

EID: 77956176003     PISSN: 16124669     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10342-010-0405-0     Document Type: Article

References (59)

1. Amacher GS, Ollikainen M, Koskela E (2009) Economics of forest resources. MIT Press, Cambridge.
2. Anderson DR, Sweeney DJ, Williams TA (1994) An introduction to management science. Quantitative approaches to decision making. West Publishing Company, St. Paul.
3. Baskent EZ, Jordan GA (2002) Forest landscape management modeling using simulated annealing. For Ecol Manag 165(1-3): 29-45.
4. Bettinger P, Graetz D, Boston K, Sessions J, Chung W (2002) Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems. Silva Fennica 36(2): 561-584.
5. Bettinger P, Sessions J, Boston K (2009a) A review of the status and use of validation procedures for heuristics used in forest planning. Mathematical and Computational Forestry and Natural-Resource Sciences 1(1): 26-37.
6. Bettinger P, Boston K, Siry J, Grebner DL (2009b) Forest management and planning. Academic Press, New York.
7. Borland Software Corporation (2001) Delphi 7. 0. Cupertino.
8. Boston K, Bettinger P (1999) An analysis of Monte Carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems. Forest Science 45(2): 292-301.
9. Clements SE, Dallain PL, Jamnick MS (1990) An operational, spatially constrained harvest scheduling model. Can J For Res 20(9): 1438-1447.
10. Clutter JL, Forston JC, Pienaar LV, Brister GH, Bailey RL (1983) Timber management: a quantitative approach. Wiley, New York.
11. Coffman EG, Garey MR, Johnson DS (1997) Approximation algorithms for bin packing: a survey. In: Hochbaum DS (ed) Approximation algorithms for NP-Hard problems. PWS Publishing, Boston, pp 46-93.
12. Coffman EG, Courcoubetis C, Garey MR, Johnson DS, Shor PW, Weber RR, Yannakakis M (2000) Bin packing with discrete item sizes, Part I: perfect packing theorems and the average case behavior of optimal packing. SIAM Journal of Discrete Mathematics 13(3): 384-402.
13. Coffman EG, Courcoubetis C, Garey MR, Johnson DS, Shor PW, Weber RR, Yannakakis M (2002) Perfect packing theorems and the average-case behavior of optimal and online bin packing. SIAM Review 44(1): 95-108.
14. Crowe K, Nelson J (2003) An indirect search algorithm for harvest-scheduling under adjacency constraints. Forest Science 49(1): 1-11.
15. Crowe K, Nelson J, Boyland M (2003) Solving the area-restricted harvest-scheduling model using the branch and bound algorithm. Can J For Res 33(9): 1804-1814.
16. Csirik J, Johnson DS (2001) Bounded space on-line bin packing: best is better than first. Algorithmica 31(2): 115-138.
17. Csirik J, Johnson DS, Kenyon C, Shor PW, Weber RR (1999) A self organizing bin packing heuristic. In: Goodrich MT, McGeoch CC (eds) Algorithm engineering and experimentation. Lecture Notes in Computer Science 1619, Springer, Berlin, pp 246-265.
18. Davis LS, Johnson KN, Bettinger P, Howard TE (2001) Forest management, 4th edn. McGraw-Hill, New York.
19. Dawson Greek LRMP Working Group (1999) Dawson creek land and resource management plan. Rep. 31090-25-01. Ministry of Sustainable Resources Management, Victoria.
20. Devroye L (1986) Non-uniform random variate generation. Springer, New York.
21. Duerr WA (1993) Introduction to forest resource economics. McGraw-Hill, New York.
22. Fort Nelson LRMP Working Group (1997) Fort Nelson land and resources management plan. Ministry of Sustainable Resources Management, Victoria.
23. Fort St. John LRMP Working Group (1997) Fort St. John land and resources management plan. Rep. 31090-25-04. Ministry of Sustainable Resources Management, Victoria.
24. Garey MR, Graham RL, Johnson DS, Yao ACC (1976) Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory Series A 21(3): 257-298.
25. Geman S, Geman D (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6: 721-741.
26. Goycoolea M, Murray AT, Barahona F, Epstein R, Weintraub A (2005) Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Operations Research 53(3): 490-500.
27. Gunn EA, Richards EW (2005) Solving the adjacency problem with stand-centred constraints. Can J For Res 35(4): 832-842.
28. Hastings WK (1970) Monte-Carlo sampling methods using Markov Chains and their applications. Biometrika 57(1): 97-109.
29. Heinonen T, Pukkala T (2004) A comparison of one- and two-compartment neighbourhoods in heuristic search with spatial forest management goals. Silva Fennica 38(3): 319-332.
30. Heyer CJ (1841) Die Waldertragsregelung. Verlag B. C. Ferber, Giessen.
31. Hoffman P (1998) The man who loved only numbers. Hyperion, New York.
32. Hoos H, Stutzle Y (2005) Stochastic local search. Morgan Kaufmann Publishers, New York.
33. Hundeshagen JC (1826) Die Forstabschätzung aufneuen wissenschaftlichen Grundlagen. H. Laupp, Tübingen.
34. Johnson DS (1973) Near-optimal bin packing algorithms. Dissertation, Massachusetts Institute of Technology.
35. Jukes W, Menzies D, Rosen D, Taylor G, Saint-Jean R, Beale J (2004) Sustainable forest management plan. Fort St. John.
36. Kangas AS, Kangas J (1999) Optimization bias in forest management planning solutions due to errors in forest variables. Silva Fennica 33(4): 303-315.
37. Kangas J, Kangas AS, Leskinen P, Pykäläinen J (2002) MCDM methods in strategic planning of forestry on state-owned lands in Finland: applications and experiences. Journal of Multi-Criteria Decision Analysis 10(5): 257-271.
38. Liu G, Han S, Zhao X, Nelson JD, Wang H, Wang W (2006) Optimisation algorithms for spatially constrained forest planning. Ecol Model 194(4): 421-428.
39. Lockwood C, Moore T (1993) Harvest scheduling with spatial constraints: a simulated annealing approach. Can J For Res 23(3): 468-478.
40. Mathey AH, Krcmar E, Tait D, Vertinsky I, Innes J (2007) Forest planning using co-evolutionary cellular automata. For Ecol Manag 239(1-3): 45-56.
41. McDill ME, Rebain SA, Braze J (2002) Harvest scheduling with area-based adjacency constraints. Forest Science 48(4): 631-642.
42. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21(6): 1087-1092.
43. Murray AT (1999) Spatial restrictions in harvest scheduling. Forest Science 45(1): 45-52.
44. Murray AT, Church RL (1995) Heuristic solution approaches to operational forest planning problems. OR Spektrum 17(2-3): 193-203.
45. Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York.
46. Nyland RD (1996) Silviculture. Concepts and applications. McGraw-Hill, New York.
47. Ohman K, Lamas T (2005) Reducing forest fragmentation in long-term forest planning by using the shape index. For Ecol Manag 212(1-3): 346-357.
48. Optimal Software (2001) C-Whiz. Sterling.
49. Pedersen L (2003) AAC Rationale for the Fort St. John TSA. Ministry of Forests, Victoria.
50. Pukkala T, Kurttila M (2005) Examining the performance of six heuristic optimisation techniques in different forest planning problems. Silva Fennica 39(1): 67-80.
51. Rhee WT (1991) Stochastic-analysis of a modified first fit decreasing packing. Mathematics of Operations Research 16(1): 162-175.
52. Rucareanu N, Leahu I (1982) Amenajarea padurilor. Ceres, Bucharest.
53. SAS Institute Inc. (2004) SAS Software 9. 1. 3. Cary.
54. Shanks ME, Gambill R (1973) Calculus. Holt, Rinehart and Winston, Inc., New York.
55. Ullman JD (1971) The performances of a memory allocation algorithm. Technical Report 100. Princeton.
56. USDA Forest Service (2009) Spectrum. 3. 0. Fort Collins.
57. Wah BW, Wang T (1999) Simulated annealing with asymptotic convergence for nonlinear constrained global optimization. In: Jaffar J (ed) Principles and practice of constraint programming. Springer, New York, pp 461-475.
58. Wolsey LA (1998) Integer programming. Wiley, New York.
59. Zomaya AY, Kazman R (1999) Simulated annealing techniques. In: Atallah MJ (ed) Handbook on algorithms and theory of computation. CRC Press, Boca Raton, pp 37-1-37-19.