Franz Rothlauf – författare
1 681 kr
Skickas inom 10-15 vardagar
2 054 kr
Läs direkt efter köp
1 681 kr
Skickas inom 10-15 vardagar
566 kr
Skickas inom 10-15 vardagar
708 kr
Läs direkt efter köp
1 633 kr
Skickas inom 10-15 vardagar
1 123 kr
Skickas inom 10-15 vardagar
1 459 kr
Läs direkt efter köp
2 049 kr
Läs direkt efter köp
In the field of genetic and evolutionary algorithms (GEAs), a large amount of theory and empirical study has been focused on operators and test problems, while problem representation has often been taken as given. This book breaks with this tradition and provides a comprehensive overview on the influence of problem representations on GEA performance. The book summarizes existing knowledge regarding problem representations and describes how basic properties of representations, such as redundancy, scaling, or locality, influence the performance of GEAs and other heuristic optimization methods. Using the developed theory, representations can be analyzed and designed in a theory-guided matter. The theoretical concepts are used for solving integer optimization problems and network design problems more efficiently. The book is written in an easy-readable style and is intended for researchers, practitioners, and students who want to learn about representations. This second edition extends the analysis of the basic properties of representations and introduces a new chapter on the analysis of direct representations.
1 125 kr
Skickas inom 10-15 vardagar
1 408 kr
Läs direkt efter köp
Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management
1 635 kr
Skickas inom 10-15 vardagar
1 977 kr
Läs direkt efter köp
1 125 kr
Skickas inom 10-15 vardagar
1 459 kr
Läs direkt efter köp
821 kr
Skickas inom 10-15 vardagar
840 kr
Läs direkt efter köp
Most textbooks on modern heuristics provide the reader with detailed descriptions of the functionality of single examples like genetic algorithms, genetic programming, tabu search, simulated annealing, and others, but fail to teach the underlying concepts behind these different approaches.
The author takes a different approach in this textbook by focusing on the users'' needs and answering three fundamental questions: First, he tells us which problems modern heuristics are expected to perform well on, and which should be left to traditional optimization methods. Second, he teaches us to systematically design the "right" modern heuristic for a particular problem by providing a coherent view on design elements and working principles. Third, he shows how we can make use of problem-specific knowledge for the design of efficient and effective modern heuristics that solve not only small toy problems but also perform well on large real-world problems.
This book is written in an easy-to-read style and it is aimed at students and practitioners in computer science, operations research and information systems who want to understand modern heuristics and are interested in a guide to their systematic design and use.
This book is written in an easy-to-read style and it is aimed at students and practitioners in computer science, operations research and information systems who want to understand modern heuristics and are interested in a guide to their systematic design and use.
This book is written in an easy-to-read style and it is aimed at students and practitioners in computer science, operations research and information systems who want to understand modern heuristics and are interested in a guide to their systematic design and use.
1 125 kr
Skickas inom 10-15 vardagar
1 459 kr
Läs direkt efter köp
1 125 kr
Skickas inom 10-15 vardagar
1 420 kr
Läs direkt efter köp
1 635 kr
Skickas inom 10-15 vardagar
Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management
1 635 kr
Skickas inom 10-15 vardagar
713 kr
Skickas inom 10-15 vardagar
693 kr
Läs direkt efter köp
In the field of genetic and evolutionary algorithms (GEAs), much theory and empirical study has been heaped upon operators and test problems, but problem representation has often been taken as given. This monograph breaks with this tradition and studies a number of critical elements of a theory of representations for GEAs and applies them to the empirical study of various important idealized test functions and problems of commercial import. The book considers basic concepts of representations, such as redundancy, scaling and locality and describes how GEAs''performance is influenced. Using the developed theory representations can be analyzed and designed in a theory-guided manner. The theoretical concepts are used as examples for efficiently solving integer optimization problems and network design problems. The results show that proper representations are crucial for GEAs''success.
Representations for Genetic and Evolutionary Algorithms
549 kr
Skickas inom 10-15 vardagar