How to solve it: Modern heuristics (Q4935970)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1391176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to solve it: Modern heuristics |
scientific article; zbMATH DE number 1391176 |
Statements
19 January 2000
0 references
problem solving
0 references
optimization algorithms
0 references
search algorithms
0 references
evolutionary algorithms
0 references
time-varying environments
0 references
neural networks
0 references
fuzzy systems
0 references
hybrid systems
0 references
practical problem solving
0 references
0 references
0 references
How to solve it: Modern heuristics (English)
0 references
50 years after \textit{G. Pólya's} book ``How to Solve It'' (Princeton Univ. Press) (1945), this book is a first attempt toward a comprehensive view of problem solving for the twenty-first century, the century of the computer revolution. The book gives information on problem solving using modern heuristics, is written in a lively, engaging style and is intended for students and practitioners alike, which have some basic knowledge of discrete mathematics and computer programming. The book is organized into 15 chapters: Chapter 1 indicates the main sources of difficulty in problem solving. Chapter 2 provides basic notation. Chapters 3 and 4 survey classical optimization algorithms. Chapter 5 covers two modern search algorithms. Chapters 6 and 7 introduce intuitions and details about new evolutionary algorithms. Chapters 8-10 then address some challenging issues concerning problems that require searching for a particular permutation of items, handling constraints, and tuning the algorithms to the problem. Chapter 11 addresses the issue of time-varying environments and noise. Chapters 12 and 13 provide tutorials for neural networks and fuzzy systems. Chapter 14 provides a short and general discussion on hybrid systems and extensions to evolutionary algorithms. Chapter 15 concludes the text by summarizing the material and providing some hints for practical problem solving. Appendix A provides an overview of fundamental concepts in probability and statistics. Appendix B offers a list of suggested problems and projects to tackle when the text is used as part of an university course.
0 references