Fr. 147.00

Forest Harvest Scheduling - From Linear Programming to Heuristic Search

English · Hardback

Shipping usually within 6 to 7 weeks

Description

Read more

This book provides a synthesis of methods that have been used in both practice and research to develop forest harvest schedules (plans of action) and to assess alternative policy scenarios. Beginning with exact mathematical methods (linear, mixed integer, and goal programming), the book provides a brief history of their conception, followed by an approachable description of the processes commonly employed to search a solution space for the optimal solution to a problem. Hill-climbing, random search, and binary search processes are then described as relatively simple alternatives to the exact methods. Heuristic search processes (threshold accepting, simulated annealing, tabu search, and genetic algorithms) are then described as semi-rational, biased alternatives to solving forest harvest scheduling problems. The closing remarks of the book provide context for the use of forest harvest scheduling in addressing today's contemporary forest management issues. In addition to a set of common-sense principles that are introduced throughout the book, provided in the book is a fifty-question exam associated with the content introduced.

List of contents

Chapter 1. Introduction
.- 1. Introduction.
.- 2. The Forest Harvest Scheduling Optimization Problem.
.- 3. Classic and Contemporary Influences on Forest Harvest Scheduling.
.- 4. Solving Forest Harvest Scheduling Assignment Problems.
.- 5. Harvest Scheduling Search Behavior.
.- 6. Difficulty in Developing High Quality Solutions to Mathematical Problems.
.- 7. Summary.

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.