Tabu Search and Its Application in Sustainable Forest Management
- Received Date: 2001-11-01
Abstract: The principle and methods of a new and high efficient heuristic method, Tabu search (TS),is introduced in this paper with a optimization example of forest harvesting problem of Chinese fir. The results of Tabu search are compared with those of linear programming(LP), simulated annealing (SA) and genetic algorithm (GA). It is indicated that Tabu search is of high efficiency in resolving general forest harvesting problems, especially when the number of neighbourhood generated by move is limited and the variation among them is great. Its objective function values are higher than those of simulated annealing and genetic algorithm from multiple running. Tabu tenure has no significant influence on Tabu search efficiency while a good move method and sort method are essential to Tabu search.