Thomas Bartz-Beielstein – författare

Control of Traffic Systems in Buildings, focusing on elevator groups, presents the state of the art in their analysis and control. It covers the theory and design of passenger and cargo traffic systems with actual operational examples and topics of current interest such as: noisy, on-line and algorithmic optimization; identification and tracking of loads; integration of control with security and management; medium- and wide-area networked control; deployment and testing of transport systems.Workers in elevator control have pioneered the development of many modern control systems for use in all sorts of traffic and scheduled systems so this exposition of recent work in in-building transport control will be of interest to researchers and engineers in many areas of control, particularly in optimal or supervisory control, urban transportation systems and intelligent transport systems.

Control of Traffic Systems in Buildings, focusing on elevator groups, presents the state of the art in their analysis and control. It covers the theory and design of passenger and cargo traffic systems with actual operational examples and topics of current interest such as: noisy, on-line and algorithmic optimization; identification and tracking of loads; integration of control with security and management; medium- and wide-area networked control; deployment and testing of transport systems.Workers in elevator control have pioneered the development of many modern control systems for use in all sorts of traffic and scheduled systems so this exposition of recent work in in-building transport control will be of interest to researchers and engineers in many areas of control, particularly in optimal or supervisory control, urban transportation systems and intelligent transport systems.

This book presents the state of the art in designing high-performance algorithms that combine simulation and optimization in order to solve complex optimization problems in science and industry, problems that involve time-consuming simulations and expensive multi-objective function evaluations. As traditional optimization approaches are not applicable per se, combinations of computational intelligence, machine learning, and high-performance computing methods are popular solutions. But finding a suitable method is a challenging task, because numerous approaches have been proposed in this highly dynamic field of research. That’s where this book comes in: It covers both theory and practice, drawing on the real-world insights gained by the contributing authors, all of whom are leading researchers. Given its scope, if offers a comprehensive reference guide for researchers, practitioners, and advanced-level students interested in using computational intelligence and machine learning to solve expensive optimization problems.

This book presents the state of the art in designing high-performance algorithms that combine simulation and optimization in order to solve complex optimization problems in science and industry, problems that involve time-consuming simulations and expensive multi-objective function evaluations.

This book constitutes the refereed proceedings of the 13th International Conference on Parallel Problem Solving from Nature, PPSN 2013, held in Ljubljana, Slovenia, in September 2014. The total of 90 revised full papers were carefully reviewed and selected from 217 submissions. The meeting began with 7 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN XIII also included 9 tutorials. The papers are organized in topical sections on adaption, self-adaption and parameter tuning; classifier system, differential evolution and swarm intelligence; coevolution and artificial immune systems; constraint handling; dynamic and uncertain environments; estimation of distribution algorithms and metamodelling; genetic programming; multi-objective optimisation; parallel algorithms and hardware implementations; real world applications; and theory.

Experimentation is necessary - a purely theoretical approach is not reasonable. The new experimentalism, a development in the modern philosophy of science, considers that an experiment can have a life of its own. It provides a statistical methodology to learn from experiments, where the experimenter should distinguish between statistical significance and scientific meaning. This book introduces the new experimentalism in evolutionary computation, providing tools to understand algorithms and programs and their interaction with optimization problems. The book develops and applies statistical techniques to analyze and compare modern search heuristics such as evolutionary algorithms and particle swarm optimization. Treating optimization runs as experiments, the author offers methods for solving complex real-world problems that involve optimization via simulation, and he describes successful applications in engineering and industrial control projects.The book bridges the gap between theory and experiment by providing a self-contained experimental methodology and many examples, so it is suitable for practitioners and researchers and also for lecturers and students. It summarizes results from the author's consulting to industry and his experience teaching university courses and conducting tutorials at international conferences. The book will be supported online with downloads and exercises.

This book constitutes the refereed proceedings of the 4th International Workshop on Hybrid Metaheuristics, HM 2007, held in Dortmund, Germany. The 14 revised full papers discuss specific aspects of hybridization of metaheuristics, hybrid metaheuristics design, development and testing. With increasing attention to methodological aspects, from both the empirical and theoretical sides, the papers show a representative sample of research in the field of hybrid metaheuristics.

In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scientists in algorithm design, statistical design, optimization and heuristics, and most chapters provide theoretical background and are enriched with case studies. This book is written for researchers and practitioners in operations research and computer science who wish to improve the experimental assessment of optimization algorithms and, consequently, their design.

Experimentation is necessary - a purely theoretical approach is not reasonable. The new experimentalism, a development in the modern philosophy of science, considers that an experiment can have a life of its own. It provides a statistical methodology to learn from experiments, where the experimenter should distinguish between statistical significance and scientific meaning. This book introduces the new experimentalism in evolutionary computation, providing tools to understand algorithms and programs and their interaction with optimization problems. The book develops and applies statistical techniques to analyze and compare modern search heuristics such as evolutionary algorithms and particle swarm optimization. Treating optimization runs as experiments, the author offers methods for solving complex real-world problems that involve optimization via simulation, and he describes successful applications in engineering and industrial control projects.The book bridges the gap between theory and experiment by providing a self-contained experimental methodology and many examples, so it is suitable for practitioners and researchers and also for lecturers and students. It summarizes results from the author's consulting to industry and his experience teaching university courses and conducting tutorials at international conferences. The book will be supported online with downloads and exercises.

In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scientists in algorithm design, statistical design, optimization and heuristics, and most chapters provide theoretical background and are enriched with case studies. This book is written for researchers and practitioners in operations research and computer science who wish to improve the experimental assessment of optimization algorithms and, consequently, their design.

Dieses Buch beschreibt Theorie und Anwendungen aus dem Bereich des Online Maschine Learnings (OML), wobei der Fokus auf Verfahren des überwachten Lernens liegt. Es werden Verfahren zur Drifterkennung und -behandlung beschrieben. Verfahren zur nachträglichen Aktualisierung der Modelle sowie Methoden zur Modellbewertung werden dargestellt. Besondere Anforderungen aus der amtlichen Statistik (unbalancierte Daten, Interpretierbarkeit, etc.) werden berücksichtigt. Aktuelle und mögliche Anwendungen werden aufgelistet. Ein Überblick über die verfügbaren Software-Tools wird gegeben. Anhand von zwei Studien (“simulierten Anwendungen”) werden Vor- und Nachteile des OML-Einsatz in der Praxis experimentell analysiert.Das Buch eignet sich als Handbuch für Experten, Lehrbuch für Anfänger und wissenschaftliche Publikation, da es den neuesten Stand der Forschung wiedergibt. Es kann auch als OML-Consulting dienen, indem Entscheider und Praktiker OML anpassen und für ihre Anwendung einsetzen, um abzuwägen, ob die Vorteile die Kosten aufwiegen.

This open access book provides a wealth of hands-on examples that illustrate how hyperparameter tuning can be applied in practice and gives deep insights into the working mechanisms of machine learning (ML) and deep learning (DL) methods.

This open access book provides a wealth of hands-on examples that illustrate how hyperparameter tuning can be applied in practice and gives deep insights into the working mechanisms of machine learning (ML) and deep learning (DL) methods.

This book deals with the exciting, seminal topic of Online Machine Learning (OML). The content is divided into three parts: the first part looks in detail at the theoretical foundations of OML, comparing it to Batch Machine Learning (BML) and discussing what criteria should be developed for a meaningful comparison. The second part provides practical considerations, and the third part substantiates them with concrete practical applications.The book is equally suitable as a reference manual for experts dealing with OML, as a textbook for beginners who want to deal with OML, and as a scientific publication for scientists dealing with OML since it reflects the latest state of research. But it can also serve as quasi OML consulting since decision-makers and practitioners can use the explanations to tailor OML to their needs and use it for their application and ask whether the benefits of OML might outweigh the costs.OML will soon become practical; it is worthwhile to get involved with it now. This book already presents some tools that will facilitate the practice of OML in the future. A promising breakthrough is expected because practice shows that due to the large amounts of data that accumulate, the previous BML is no longer sufficient. OML is the solution to evaluate and process data streams in real-time and deliver results that are relevant for practice.In addition to this book, interactive Jupyter Notebooks and further material about OML are provided in the GitHub repository (https://github.com/sn-code-inside/online-machine-learning). The repository is continuously maintained, so the notebooks may change over time.