An evaluation of the simulated annealing algorithm for solving the area-restricted harvest-scheduling model against optimal benchmarks

Canadian Journal of Forest Research

Volumn 35, Issue 10, 2005, Pages 2500-2509

  Crowe, Kevin A ^a   Nelson, J D ^b  

^a LAKEHEAD UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; DECISION THEORY; HEURISTIC METHODS; SCHEDULING; SIMULATED ANNEALING;

HARVEST-SCHEDULING MODEL; METAHEURISTIC ALGORITHM; OPTIMAL HARVEST SCHEDULES;

HARVESTING;

ALGORITHM; OPTIMIZATION; SILVICULTURE; SIMULATED ANNEALING; TIMBER HARVESTING;

ALGORITHMS; DECISION THEORY; HARVESTING;

EID: 33644544411     PISSN: 00455067     EISSN: None     Source Type: Journal    
DOI: 10.1139/x05-139     Document Type: Review

References (21)

1. Bettinger, P., Boston, K., and Sessions, J. 1999. Intensifying a metaheuristic forest harvest scheduling search procedure with 2-opt decision choices. Can. J. For. Res. 29: 1784-1792.
2. Boston, K., and Bettinger, P. 1999. An analysis of Monte Carlo integer programming, simulated annealing, and tabu search metaheuristics for solving spatial harvest-scheduling problems. For. Sci. 45: 292-301.
3. Caro, F., Constantino, M., Martins, I., and Weintraub, A. 2003. A 2-opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old growth, and even flow constraints. For. Sci. 49: 738-751.
4. Crowe, K., Nelson, J., and Boyland, M. 2003. Solving the area-restricted harvest-scheduling problem using the branch and bound algorithm. Can. J. For. Res. 33: 1804-1814.
5. Fisher, R., and Tippett, L. 1928. Limiting forms of the frequency distribution of the largest or smallest member of a sample. Proc. Camb. Philol. Soc. 24: 180-190.
6. Golden, B.L., and Alt, F.B. 1979. Interval estimation of a global optimum for large combinatorial problems. Nav. Res. Log. Quart. 26: 69-77.
7. Hertz, A., and Widmer, W. 2003. Guidelines for the use of metaheuristics in combinatorial optimization. Eur. J. Oper. Res. 151: 247-252.
8. Jamnick, M.S., and Walters, K.R. 1991. Spatial and temporal allocation of stratum-based harvest schedules. Can. J. For. Res. 23: 402-413.
9. Johnson, D., and McGeoch, L. 2002. Experimental analysis of metaheuristics for the symmetric traveling salesman problem. In The traveling salesman problem and its variations. Edited by G. Gutin and A. Punnen. Kluwer Academic Publishers, Dordecht, Netherlands. pp. 369-443.
10. Johnson, D.S., and Papadimitriou, C.H. 1985. Performance guarantees for heuristics. Interfaces, 2: 145-180.
11. Liu, G., Nelson, J., and Wardman, C. 2000. A target-oriented approach to forest ecosystem design - changing the rules of forest planning. Ecol. Model. 127: 269-281.
12. McDill, M.E., and Braze, J. 2000. Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions. For. Sci. 46: 423-436.
13. McDill, M.E., Rebain, S.E., and Braze, J. 2002. Harvest scheduling with area-based adjacency constraints. For. Sci. 48: 631-642.
14. Murray, A.T., and Church, R.L. 1995. Metaheuristic solution approaches to operational forest planning problems. OR Spektrum, 17: 193-203.
15. Murray, A.T., and Weintraub, A. 2002. Scale and unit specification influences in harvest scheduling with maximum area restrictions. For. Sci. 48: 779-789.
16. Nelson, J., and Brodie, J.D. 1990. Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Can. J. For. Res. 20: 934-942.
17. Reeves, C.R. (Editor). 1993. Modern metaheuristic techniques for combinatorial problems. Blackwell Scientific Publications, Oxford, UK.
18. Richards, E.W., and Gunn, E.A. 2000. A model and tabu search method to optimize polygon harvest and road construction schedules. For. Sci. 46: 188-203.
19. Walters, K.R., Feunekes, H., Cogswell, A., and Cox, E. 1999. A forest planning system for solving spatial harvest-scheduling problems. In Canadian Operations Research Society National Conference, 7-9 June 1999, Windsor, Ont. Available from http://www.remsoft.com/case_studies.php [accessed December 2003].
20. Weintraub, A., Jones, G., Meacham, M., Magendzo A., and Malchuk, D. 1995. Metaheuristic procedures for solving mixed-integer harvest-scheduling transportation planning models. Can. J. For. Res. 25: 1618-1626.
21. Wolsey, L.A. 1998. Integer programming. John Wiley and Sons Ltd., New York.