| Description |
1 online resource (xvii, 130 pages) |
| Series |
Natural computing series, 1619-7127 |
|
Natural computing series, 1619-7127
|
| Contents |
Introduction to Hyper-Heuristics -- Selection Constructive Hyper-Heuristics -- Selection Pertubative Hyper-Heuristics -- Generation Constructive Hyper-Heuristics -- Generation Perturbative Hyper-Heuristics -- Theoretical Aspect: A Formal Definition -- Vehicle Routing Problems -- Nurse Rostering Problems -- Packing Problems -- Examination Timetabling Problems -- Cross-Domain Hyper-Heuristics -- Advances in Hyper-Heuristics -- Conclusions and Future Research Directions |
| Summary |
This introduction to the field of hyper-heuristics presents the required foundations and tools and illustrates some of their applications. The authors organized the 13 chapters into three parts. The first, hyper-heuristic fundamentals and theory, provides an overview of selection constructive, selection perturbative, generation constructive and generation perturbative hyper-heuristics, and then a formal definition of hyper-heuristics. The chapters in the second part of the book examine applications of hyper-heuristics in vehicle routing, nurse rostering, packing and examination timetabling. The third part of the book presents advanced topics and then a summary of the field and future research directions. Finally the appendices offer details of the HyFlex framework and the EvoHyp toolkit, and then the definition, problem model and constraints for the most tested combinatorial optimization problems. The book will be of value to graduate students, researchers, and practitioners |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Online resource; title from PDF title page (SpringerLink, viewed October 12, 2018) |
| Subject |
Mathematical optimization.
|
|
Search theory.
|
|
Decision Theory
|
|
Search theory
|
|
Mathematical optimization
|
| Form |
Electronic book
|
| Author |
Qu, Rong, author
|
| ISBN |
9783319965147 |
|
331996514X |
|
9783319965154 |
|
3319965158 |
|
