國立高雄大學圖資館 |

登入

回首頁

Forest harvest schedulingfrom linear programming to heuristic search /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Forest harvest schedulingby Pete Bettinger.
其他題名:	from linear programming to heuristic search /
作者:	Bettinger, Pete.
出版者:	Cham :Springer Nature Switzerland :2025.
面頁冊數:	xxv, 268 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	LoggingMathematical models.
電子資源:	https://doi.org/10.1007/978-3-031-89432-9
ISBN:	9783031894329$q(electronic bk.)

Forest harvest schedulingfrom linear programming to heuristic search /
Bettinger, Pete.

Forest harvest schedulingfrom linear programming to heuristic search /[electronic resource] :by Pete Bettinger. - Cham :Springer Nature Switzerland :2025. - xxv, 268 p. :ill. (some col.), digital ;24 cm. - Springer texts in business and economics,2192-4341. - Springer texts in business and economics..

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.

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.

ISBN: 9783031894329$q(electronic bk.)

Standard No.: 10.1007/978-3-031-89432-9doiSubjects--Topical Terms:

1001501
Logging
--Mathematical models.

LC Class. No.: HD9750.5

Dewey Class. No.: 634.98

Forest harvest schedulingfrom linear programming to heuristic search /
LDR:02589nmm a2200337 a 4500 001 687021
003 DE-He213
005 20250531130238.0
006 m d
007 cr nn 008maaau
008 260309s2025 sz s 0 eng d
020 $a 9783031894329$q(electronic bk.)
020 $a 9783031894312$q(paper)
024 7 $a 10.1007/978-3-031-89432-9 $2 doi
035 $a 978-3-031-89432-9
040 $a GP $c GP
041 0 $a eng
050 4 $a HD9750.5
072 7 $a KJMV9 $2 bicssc
072 7 $a BUS087000 $2 bisacsh
072 7 $a KJMV9 $2 thema
082 0 4 $a 634.98 $2 23
090 $a HD9750.5 $b .B565 2025
100 1 $a Bettinger, Pete. $3 1001500
245 1 0 $a Forest harvest scheduling $h [electronic resource] : $b from linear programming to heuristic search / $c by Pete Bettinger.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xxv, 268 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Springer texts in business and economics, $x 2192-4341
505 0 $a 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.
520 $a 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.
650 0 $a Logging $x Mathematical models. $3 1001501
650 0 $a Forest management. $3 198215
650 0 $a Scheduling. $3 224416
650 0 $a Earth sciences. $3 196069
650 1 4 $a Logistics. $3 200159
650 2 4 $a Operations Management. $3 731073
650 2 4 $a Earth and Environmental Sciences. $3 919207
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Springer texts in business and economics. $3 557968
856 4 0 $u https://doi.org/10.1007/978-3-031-89432-9
950 $a Business and Management (SpringerNature-41169)