This book addresses the principles and applications of metaheuristic approaches in engineering and related fields. The first part covers metaheuristics tools and techniques such as ant colony optimization and Tabu search, and their applications to several classes of optimization problems. In turn, the book's second part focuses on a wide variety of metaheuristics applications in engineering and/or the applied sciences, e.g. in smart grids and renewable energy. In addition, the simulation codes for the problems discussed are included in an appendix for ready reference. Intended for researchers aspiring to learn and apply metaheuristic techniques, and gathering contributions by prominent experts in the field, the book offers readers an essential introduction to metaheuristics, its theoretical aspects and applications.

Spotlighting the field of Multidisciplinary Design Optimization (MDO), this book illustrates and implements state-of-the-art methodologies within the complex process of aerospace system design under uncertainties. The book provides approaches to integrating a multitude of components and constraints with the ultimate goal of reducing design cycles. Insights on a vast assortment of problems are provided, including discipline modeling, sensitivity analysis, uncertainty propagation, reliability analysis, and global multidisciplinary optimization. The extensive range of topics covered include areas of current open research. This Work is destined to become a fundamental reference for aerospace systems engineers, researchers, as well as for practitioners and engineers working in areas of optimization and uncertainty. Part I is largely comprised of fundamentals. Part II presents methodologies for single discipline problems with a review of existing uncertainty propagation, reliability analysis, and optimization techniques. Part III is dedicated to the uncertainty-based MDO and related issues. Part IV deals with three MDO related issues: the multifidelity, the multi-objective optimization and the mixed continuous/discrete optimization and Part V is devoted to test cases for aerospace vehicle design.

This textbook provides students with fundamentals and advanced concepts in optimization and operations research. It gives an overview of the historical perspective of operations research and explains its principal characteristics, tools, and applications. The wide range of topics covered includes convex and concave functions, simplex methods, post optimality analysis of linear programming problems, constrained and unconstrained optimization, game theory, queueing theory, and related topics. The text also elaborates on project management, including the importance of critical path analysis, PERT and CPM techniques. This textbook is ideal for any discipline with one or more courses in optimization and operations research; it may also provide a solid reference for researchers and practitioners in operations research.

This text is an introduction to Operations Management. Three themes are woven throughout the book: optimization or trying to do the best we can, managing tradeoffs between conflicting objectives, and dealing with uncertainty. After a brief introduction, the text reviews the fundamentals of probability including commonly used discrete and continuous distributions and functions of a random variable. The next major section, beginning in Chapter 7, examines optimization. The key fundamentals of optimization-inputs, decision variables, objective(s), and constraints-are introduced. Optimization is applied to linear regression, basic inventory modeling, and the newsvendor problem, which incorporates uncertain demand. Linear programming is then introduced. We show that the newsvendor problem can be cast as a network flow linear programming problem. Linear programming is then applied to the problem of redistributing empty rental vehicles (e.g., bicycles) at the end of a day and the problem of assigning students to seminars. Several chapters deal with location models as examples of both simple optimization problems and integer programming problems. The next major section focuses on queueing theory including single-and multi-server queues. This section also introduces a numerical method for solving for key performance metrics for a common class of queueing problems as well as simulation modeling. Finally, the text ends with a discussion of decision theory that again integrates notions of optimization, tradeoffs, and uncertainty analysis. The text is designed for anyone with a modest mathematical background. As such, it should be readily accessible to engineering students, economics, statistics, and mathematics majors, as well as many business students.

The authors stress the relative simplicity, efficiency, flexibility of use, and suitability of various approaches used to solve difficult optimization problems. The authors are experienced, interdisciplinary lecturers and researchers and in their explanations they demonstrate many shared foundational concepts among the key methodologies. This textbook is a suitable introduction for undergraduate and graduate students, researchers, and professionals in computer science, engineering, and logistics.

This book examines the mismatch between discrete programs, which lie at the center of modern applied mathematics, and the continuous space phenomena they simulate. The author considers whether we can imagine continuous spaces of programs, and asks what the structure of such spaces would be and how they would be constituted. He proposes a functional analysis of program spaces focused through the lens of iterative optimization. The author begins with the observation that optimization methods such as Genetic Algorithms, Evolution Strategies, and Particle Swarm Optimization can be analyzed as Estimation of Distributions Algorithms (EDAs) in that they can be formulated as conditional probability distributions. The probabilities themselves are mathematical objects that can be compared and operated on, and thus many methods in Evolutionary Computation can be placed in a shared vector space and analyzed using techniques of functional analysis. The core ideas of this book expand from that concept, eventually incorporating all iterative stochastic search methods, including gradient-based methods. Inspired by work on Randomized Search Heuristics, the author covers all iterative optimization methods and not just evolutionary methods. The No Free Lunch Theorem is viewed as a useful introduction to the broader field of analysis that comes from developing a shared mathematical space for optimization algorithms. The author brings in intuitions from several branches of mathematics such as topology, probability theory, and stochastic processes and provides substantial background material to make the work as self-contained as possible. The book will be valuable for researchers in the areas of global optimization, machine learning, evolutionary theory, and control theory.

This book presents the latest researches on hypersonic steady glide dynamics and guidance, including the concept of steady glide reentry trajectory and the stability of its regular perturbation solutions, trajectory damping control technique for hypersonic glide reentry, singular perturbation guidance of hypersonic glide reentry, trajectory optimization based on steady glide, linear pseudospectral generalized nominal effort miss distance guidance, analytical entry guidance and trajectory-shaping guidance with final speed and load factor constraints. They can be used to solve many new difficult problems in entry guidance. And many practical engineering cases are provided for the readers for better understanding. Researchers and students in the fields of flight vehicle design or flight dynamics, guidance and control could use the book as valuable reference.

This book presents simple design paradigms related to lightweight design, that are derived from an in-depth and theoretically sound analysis based on Pareto theory. It uses numerous examples, including torsion and inflated tubes, to fully explain the theories discussed. Lightweight Construction Principles begins by defining terms in relation to engineering design and optimal design of complex mechanical systems. It then discusses the analytical derivation of the Pareto-optimal set, before applying analytical formulae to optimal design of bent beams. The book moves through numerous case studies of different beam and tube construction including beams subject to bending, thin walled tubes under torsion and truss structures. This book will be of interest to researchers and graduate students in the field of structural optimisation and multi-objective optimization, as well as to practitioners such as design engineers.

This volume contains select papers presented during the 2nd National Conference on Multidisciplinary Analysis and Optimization. It discusses new developments at the core of optimization methods and its application in multiple applications. The papers showcase fundamental problems and applications which include domains such as aerospace, automotive and industrial sectors. The variety of topics and diversity of insights presented in the general field of optimization and its use in design for different applications will be of interest to researchers in academia or industry.

This book offers a valuable reference guide for researchers in distributed optimization and for senior undergraduate and graduate students alike. Focusing on the natures and functions of agents, communication networks and algorithms in the context of distributed optimization for networked control systems, this book introduces readers to the background of distributed optimization; recent developments in distributed algorithms for various types of underlying communication networks; the implementation of computation-efficient and communication-efficient strategies in the execution of distributed algorithms; and the frameworks of convergence analysis and performance evaluation. On this basis, the book then thoroughly studies 1) distributed constrained optimization and the random sleep scheme, from an agent perspective; 2) asynchronous broadcast-based algorithms, event-triggered communication, quantized communication, unbalanced directed networks, and time-varying networks, from a communication network perspective; and 3) accelerated algorithms and stochastic gradient algorithms, from an algorithm perspective. Finally, the applications of distributed optimization in large-scale statistical learning, wireless sensor networks, and for optimal energy management in smart grids are discussed.

This book presents the latest research in the fields of reliability theory and its applications, providing a comprehensive overview of reliability engineering and discussing various tools, techniques, strategies and methods within these areas. Reliability analysis is one of the most multidimensional topics in the field of systems reliability engineering, and while its rapid development creates opportunities for industrialists and academics, it is also means that it is hard to keep up to date with the research taking place. By gathering findings from institutions around the globe, the book offers insights into the international developments in the field. As well as discussing the current areas of research, it also identifies knowledge gaps in reliability theory and its applications and highlights fruitful avenues for future research. Covering topics from life cycle sustainability to performance analysis of cloud computing, this book is ideal for upper undergraduate and postgraduate researchers studying reliability engineering.

This book introduces readers to Bayesian optimization, highlighting advances in the field and showcasing its successful applications to computer experiments. R code is available as online supplementary material for most included examples, so that readers can better comprehend and reproduce methods. Compact and accessible, the volume is broken down into four chapters. Chapter 1 introduces the reader to the topic of computer experiments; it includes a variety of examples across many industries. Chapter 2 focuses on the task of surrogate model building and contains a mix of several different surrogate models that are used in the computer modeling and machine learning communities. Chapter 3 introduces the core concepts of Bayesian optimization and discusses unconstrained optimization. Chapter 4 moves on to constrained optimization, and showcases some of the most novel methods found in the field. This will be a useful companion to researchers and practitioners working with computer experiments and computer modeling. Additionally, readers with a background in machine learning but minimal background in computer experiments will find this book an interesting case study of the applicability of Bayesian optimization outside the realm of machine learning.

This book presents a comprehensive introduction to design sensitivity analysis theory as applied to electromagnetic systems. It treats the subject in a unified manner, providing numerical methods and design examples. The specific focus is on continuum design sensitivity analysis, which offers significant advantages over discrete design sensitivity methods. Continuum design sensitivity formulas are derived from the material derivative in continuum mechanics and the variational form of the governing equation. Continuum sensitivity analysis is applied to Maxwell equations of electrostatic, magnetostatic and eddy-current systems, and then the sensitivity formulas for each system are derived in a closed form; an integration along the design interface. The book also introduces the recent breakthrough of the topology optimization method, which is accomplished by coupling the level set method and continuum design sensitivity. This topology optimization method enhances the possibility of the global minimum with minimised computational time, and in addition the evolving shapes during the iterative design process are easily captured in the level set equation. Moreover, since the optimization algorithm is transformed into a well-known transient analysis algorithm for differential equations, its numerical implementation becomes very simple and convenient. Despite the complex derivation processes and mathematical expressions, the obtained sensitivity formulas are very straightforward for numerical implementation. This book provides detailed explanation of the background theory and the derivation process, which will help readers understand the design method and will set the foundation for advanced research in the future.

This book constitutes the conference proceedings of the 10th International Conference on Network Games, Control and Optimization, NETGCOOP 2020, held in Cargese, Corsica, France, in September 2021*.The 12 full papers and 16 short papers were carefully reviewed and selected from 44 submissions. The papers are organized in the following topical sections: game theory and iterative algorithms applied to wireless communication; stochastic models for network performance analysis; game theory in mobile and wireless networks; scheduling and resource allocation problems in networks; advance in game theory; social network; electrical network. * The conference was postponed to 2021 due to the COVID-19 pandemic.

Anja Schedel analyzes two models in the field of algorithmic game theory which both constitute bilevel problems in networks. The first model is a game-theoretic variant of the well-known Steiner forest problem, and one is interested in an optimal sharing of the cost of the Steiner forest. The author provides (and partially exactly characterizes) network structures which allow for cost-minimal pure Nash equilibria. The second model is motivated from privatized public roads, in which private, selfishly acting firms build roads, and as compensation for their investment, are allowed to set prices for using the roads. For a basic model of this situation, the author shows existence and uniqueness of pure Nash equilibria. The existence result requires a non-standard proof approach since techniques like Kakutani's fixed point theorem cannot be applied directly.

The goal of this book is to gather in a single work the most relevant concepts related in optimization methods, showing how such theories and methods can be addressed using the open source, multi-platform R tool. Modern optimization methods, also known as metaheuristics, are particularly useful for solving complex problems for which no specialized optimization algorithm has been developed. These methods often yield high quality solutions with a more reasonable use of computational resources (e.g. memory and processing effort). Examples of popular modern methods discussed in this book are: simulated annealing; tabu search; genetic algorithms; differential evolution; and particle swarm optimization. This book is suitable for undergraduate and graduate students in computer science, information technology, and related areas, as well as data analysts interested in exploring modern optimization methods using R. This new edition integrates the latest R packages through text and code examples. It also discusses new topics, such as: the impact of artificial intelligence and business analytics in modern optimization tasks; the creation of interactive Web applications; usage of parallel computing; and more modern optimization algorithms (e.g., iterated racing, ant colony optimization, grammatical evolution).

This book is one of the first to include an extensive discussion of integrated public transport planning. In times of growing urban populations and increasing environmental awareness, the importance of optimizing public transport systems is ever-developing. Three different aspects are presented: line planning, timetabling, and vehicle scheduling. Classically, challenges concerning these three aspects of planning are solved sequentially. Due to their high interdependence, the author presents a clear and detailed analysis of innovative, integrated models with accompanied numerical experiments performed to assess, and often support, the benefits of integration. The book will appeal to a wide readership ranging from graduate students to researchers.

This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.

This book investigates Reliability-based Multidisciplinary Design Optimization (RBMDO) theory and its application in the design of deep manned submersibles (DMSs). Multidisciplinary Design Optimization (MDO) is an effective design method for large engineering systems like aircraft, warships, and satellites, which require designers and engineers from various disciplines to cooperate with each other. MDO can be used to handle the conflicts that arise between these disciplines, and focuses on the optimal design of the system as a whole. However, it can also push designs to the brink of failure. In order to keep the system balanced, Reliability-based Design (RBD) must be incorporated into MDO. Consequently, new algorithms and methods have to be developed for RBMDO theory. This book provides an essential overview of MDO, RBD, and RBMDO and subsequently introduces key algorithms and methods by means of case analyses. In closing, it introduces readers to the design of DMSs and applies RBMDO methods to the design of the manned hull and the general concept design. The book is intended for all students and researchers who are interested in system design theory, and for engineers working on large, complex engineering systems.

This monograph collects cutting-edge results and techniques for solving nonlinear partial differential equations using critical points. Including many of the author's own contributions, a range of proofs are conveniently collected here, Because the material is approached with rigor, this book will serve as an invaluable resource for exploring recent developments in this active area of research, as well as the numerous ways in which critical point theory can be applied. Different methods for finding critical points are presented in the first six chapters. The specific situations in which these methods are applicable is explained in detail. Focus then shifts toward the book's main subject: applications to problems in mathematics and physics. These include topics such as Schroedinger equations, Hamiltonian systems, elliptic systems, nonlinear wave equations, nonlinear optics, semilinear PDEs, boundary value problems, and equations with multiple solutions. Readers will find this collection of applications convenient and thorough, with detailed proofs appearing throughout. Critical Point Theory will be ideal for graduate students and researchers interested in solving differential equations, and for those studying variational methods. An understanding of fundamental mathematical analysis is assumed. In particular, the basic properties of Hilbert and Banach spaces are used.

This book provides energy efficiency quantitative analysis and optimal methods for discrete manufacturing systems from the perspective of global optimization. In order to analyze and optimize energy efficiency for discrete manufacturing systems, it uses real-time access to energy consumption information and models of the energy consumption, and constructs an energy efficiency quantitative index system. Based on the rough set and analytic hierarchy process, it also proposes a principal component quantitative analysis and a combined energy efficiency quantitative analysis. In turn, the book addresses the design and development of quantitative analysis systems. To save energy consumption on the basis of energy efficiency analysis, it presents several optimal control strategies, including one for single-machine equipment, an integrated approach based on RWA-MOPSO, and one for production energy efficiency based on a teaching and learning optimal algorithm. Given its scope, the book offers a valuable guide for students, teachers, engineers and researchers in the field of discrete manufacturing systems.

This English version of Ruslan L. Stratonovich's Theory of Information (1975) builds on theory and provides methods, techniques, and concepts toward utilizing critical applications. Unifying theories of information, optimization, and statistical physics, the value of information theory has gained recognition in data science, machine learning, and artificial intelligence. With the emergence of a data-driven economy, progress in machine learning, artificial intelligence algorithms, and increased computational resources, the need for comprehending information is essential. This book is even more relevant today than when it was first published in 1975. It extends the classic work of R.L. Stratonovich, one of the original developers of the symmetrized version of stochastic calculus and filtering theory, to name just two topics. Each chapter begins with basic, fundamental ideas, supported by clear examples; the material then advances to great detail and depth. The reader is not required to be familiar with the more difficult and specific material. Rather, the treasure trove of examples of stochastic processes and problems makes this book accessible to a wide readership of researchers, postgraduates, and undergraduate students in mathematics, engineering, physics and computer science who are specializing in information theory, data analysis, or machine learning.

This monograph applies the relative optimization approach to time nonhomogeneous continuous-time and continuous-state dynamic systems. The approach is intuitively clear and does not require deep knowledge of the mathematics of partial differential equations. The topics covered have the following distinguishing features: long-run average with no under-selectivity, non-smooth value functions with no viscosity solutions, diffusion processes with degenerate points, multi-class optimization with state classification, and optimization with no dynamic programming. The book begins with an introduction to relative optimization, including a comparison with the traditional approach of dynamic programming. The text then studies the Markov process, focusing on infinite-horizon optimization problems, and moves on to discuss optimal control of diffusion processes with semi-smooth value functions and degenerate points, and optimization of multi-dimensional diffusion processes. The book concludes with a brief overview of performance derivative-based optimization. Among the more important novel considerations presented are: the extension of the Hamilton-Jacobi-Bellman optimality condition from smooth to semi-smooth value functions by derivation of explicit optimality conditions at semi-smooth points and application of this result to degenerate and reflected processes; proof of semi-smoothness of the value function at degenerate points; attention to the under-selectivity issue for the long-run average and bias optimality; discussion of state classification for time nonhomogeneous continuous processes and multi-class optimization; and development of the multi-dimensional Tanaka formula for semi-smooth functions and application of this formula to stochastic control of multi-dimensional systems with degenerate points. The book will be of interest to researchers and students in the field of stochastic control and performance optimization alike.

There are three fundamental components in Control-Flow Integrity (CFI) enforcement. The first component is accurately recovering the policy (CFG). Usually, the more precise the policy is, the more security CFI improves, but precise CFG generation was considered hard without the support of source code. The second component is embedding the CFI policy securely. Current CFI enforcement usually inserts checks before indirect branches to consult a read-only table which stores the valid CFG information. However, this kind of read-only table can be overwritten by some kinds of attacks (e.g., the Rowhammer attack and data-oriented programming). The third component is to efficiently enforce the CFI policy. In current approaches CFI checks are always executed whenever there is an indirect control flow transfer. Therefore, it is critical to minimize the performance impact of CFI checks. In this book, we propose novel solutions to handle these three fundamental components. To generate a precise CFI policy without the support of the source code, we systematically study two methods which recover CFI policy based on function signature matching at the binary level and propose our novel rule- and heuristic-based mechanism to more accurately recover function signature. To embed CFI policy securely, we design a novel platform which encodes the policy into the machine instructions directly without relying on consulting any read-only data structure, by making use of the idea of instruction-set randomization. Each basic block is encrypted with a key derived from the CFG. To efficiently enforce CFI policy, we make use of a mature dynamic code optimization platform called DynamoRIO to enforce the policy so that we are only required to do the CFI check when needed.

Oriented matroids are a very natural mathematical concept which presents itself in many different guises and which has connections and applications to many different areas. These include discrete and computational geometry, combinatorics, convexity, topology, algebraic geometry, operations research, computer science and theoretical chemistry. This is the second edition of the first comprehensive, accessible account of the subject. It is intended for a diverse audience: graduate students who wish to learn the subject from scratch; researchers in the various fields of application who want to concentrate on certain aspects of the theory; specialists who need a thorough reference work; and others at academic points in between. A list of exercises and open problems ends each chapter. For the second edition, the authors have expanded the bibliography greatly to ensure that it remains comprehensive and up-to-date, and they have also added an appendix surveying research since the work was first published.