This book focuses on metaheuristic methods and its applications to real-world problems in Engineering. The first part describes some key metaheuristic methods, such as Bat Algorithms, Particle Swarm Optimization, Differential Evolution, and Particle Collision Algorithms. Improved versions of these methods and strategies for parameter tuning are also presented, both of which are essential for the practical use of these important computational tools. The second part then applies metaheuristics to problems, mainly in Civil, Mechanical, Chemical, Electrical, and Nuclear Engineering. Other methods, such as the Flower Pollination Algorithm, Symbiotic Organisms Search, Cross-Entropy Algorithm, Artificial Bee Colonies, Population-Based Incremental Learning, Cuckoo Search, and Genetic Algorithms, are also presented. The book is rounded out by recently developed strategies, or hybrid improved versions of existing methods, such as the Lightning Optimization Algorithm, Differential Evolution with Particle Collisions, and Ant Colony Optimization with Dispersion - state-of-the-art approaches for the application of computational intelligence to engineering problems. The wide variety of methods and applications, as well as the original results to problems of practical engineering interest, represent the primary differentiation and distinctive quality of this book. Furthermore, it gathers contributions by authors from four countries - some of which are the original proponents of the methods presented - and 18 research centers around the globe.

The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: * Algorithmic aspects of problems with disjoint cycles in graphs * Graphs where maximal cliques and stable sets intersect * The maximum independent set problem with special classes * A general technique for heuristic algorithms for optimization problems * The network design problem with cut constraints * Algorithms for computing the frustration index of a signed graph * A heuristic approach for studying the patrol problem on a graph * Minimum possible sum and product of the proper connection number * Structural and algorithmic results on branchings in digraphs * Improved upper bounds for Korkel--Ghosh benchmark SPLP instances

This book introduces readers to the background, general framework, main operators, and other basic characteristics of biogeography-based optimization (BBO), which is an emerging branch of bio-inspired computation. In particular, the book presents the authors' recent work on improved variants of BBO, hybridization of BBO with other algorithms, and the application of BBO to a variety of domains including transportation, image processing, and neural network learning. The content will help to advance research into and application of not only BBO but also the whole field of bio-inspired computation. The algorithms and applications are organized in a step-by-step manner and clearly described with the help of pseudo-codes and flowcharts. The readers will learn not only the basic concepts of BBO but also how to apply and adapt the algorithms to the engineering optimization problems they actually encounter.

This book covers various topics regarding the design of compliant mechanisms using topology optimization that have attracted a great deal of attention in recent decades. After comprehensively describing state-of-the-art methods for designing compliant mechanisms, it provides a new topology optimization method for finding new flexure hinges. It then presents several attempts to obtain distributed compliant mechanisms using the topology optimization method. Further, it discusses a Jacobian-based topology optimization method for compliant parallel mechanisms, and introduces readers to the topology optimization of compliant mechanisms, taking into account geometrical nonlinearity and reliability. Providing a systematic method for topology optimization of flexure hinges, which are essential for designing compliant mechanisms, the book offers a valuable resource for all readers who are interested in designing compliant mechanism-based positioning stages. In addition, the methods for solving the de facto hinges in topology optimized compliant mechanisms will benefit all engineers seeking to design micro-electro-mechanical system (MEMS) structures.

Our everyday lives are practically unthinkable without optimization. We constantly try to minimize our effort and to maximize the reward or progress achieved. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. This volume presents a comprehensive collection of extended contributions from the 2017 Workshop on Computational Optimization. Presenting recent advances in computational optimization, it addresses important concrete applications, e.g. the modeling of physical processes, wildfire modeling, modeling processes in chemical engineering, workforce planning, wireless access network topology, parameter settings for controlling various processes, berth allocation, identification of homogeneous domains, and quantum computing. The book shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others.

The contributions in this volume give an insight into current research activities in Shape Optimization, Homogenization and Optimal Control performed in Africa, Germany and internationally. Seeds for collaboration can be found in the first four papers in the field of homogenization. Modelling and optimal control in partial differential equations is the topic of the next six papers, again mixed from Africa and Germany. Finally, new results in the field of shape optimization are discussed in the final international three papers. This workshop, held at the AIMS Center Senegal, March 13-16, 2017, has been supported by the Deutsche Forschungsgemeinschaft (DFG) and by the African Institute for Mathematical Sciences (AIMS) in Senegal, which is one of six centres of a pan-African network of centres of excellence for postgraduate education, research and outreach in mathematical sciences.

Although the particle swarm optimisation (PSO) algorithm requires relatively few parameters and is computationally simple and easy to implement, it is not a globally convergent algorithm. In Particle Swarm Optimisation: Classical and Quantum Perspectives, the authors introduce their concept of quantum-behaved particles inspired by quantum mechanics, which leads to the quantum-behaved particle swarm optimisation (QPSO) algorithm. This globally convergent algorithm has fewer parameters, a faster convergence rate, and stronger searchability for complex problems. The book presents the concepts of optimisation problems as well as random search methods for optimisation before discussing the principles of the PSO algorithm. Examples illustrate how the PSO algorithm solves optimisation problems. The authors also analyse the reasons behind the shortcomings of the PSO algorithm. Moving on to the QPSO algorithm, the authors give a thorough overview of the literature on QPSO, describe the fundamental model for the QPSO algorithm, and explore applications of the algorithm to solve typical optimisation problems. They also discuss some advanced theoretical topics, including the behaviour of individual particles, global convergence, computational complexity, convergence rate, and parameter selection. The text closes with coverage of several real-world applications, including inverse problems, optimal design of digital filters, economic dispatch problems, biological multiple sequence alignment, and image processing. MATLAB (R), Fortran, and C++ source codes for the main algorithms are provided on an accompanying downloadable resources. Helping you numerically solve optimisation problems, this book focuses on the fundamental principles and applications of PSO and QPSO algorithms. It not only explains how to use the algorithms, but also covers advanced topics that establish the groundwork for understanding.

This book discusses systematic designs of stable adaptive fuzzy logic controllers employing hybridizations of Lyapunov strategy-based approaches/H theory-based approaches and contemporary stochastic optimization techniques. The text demonstrates how candidate stochastic optimization techniques like Particle swarm optimization (PSO), harmony search (HS) algorithms, covariance matrix adaptation (CMA) etc. can be utilized in conjunction with the Lyapunov theory/H theory to develop such hybrid control strategies. The goal of developing a series of such hybridization processes is to combine the strengths of both Lyapunov theory/H theory-based local search methods and stochastic optimization-based global search methods, so as to attain superior control algorithms that can simultaneously achieve desired asymptotic performance and provide improved transient responses. The book also demonstrates how these intelligent adaptive control algorithms can be effectively utilized in real-life applications such as in temperature control for air heater systems with transportation delay, vision-based navigation of mobile robots, intelligent control of robot manipulators etc.

This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing. Based on appropriate modeling approaches for the problems considered, it offers an introduction to the related solution methods. It also addresses aspects like performance results for heuristic algorithms and bounds of the optimal value, as well as the packability of a given set of objects within a predefined container. The problems discussed arise in a wide variety of different fields of application and research, and as such, the fundamental knowledge presented in this book make it a valuable resource for students, practitioners, and researchers who are interested in dealing with such tasks.

This book brings together the latest findings on efficient solutions of multi/many-objective optimization problems from the leading researchers in the field. The focus is on solving real-world optimization problems using strategies ranging from evolutionary to hybrid frameworks, and involving various computation platforms. The topics covered include solution frameworks using evolutionary to hybrid models in application areas like Analytics, Cancer Research, Traffic Management, Networks and Communications, E-Governance, Quantum Technology, Image Processing, etc. As such, the book offers a valuable resource for all postgraduate students and researchers interested in exploring solution frameworks for multi/many-objective optimization problems.

This book presents recent research on bioinspired heuristics for optimization. Learning- based and black-box optimization exhibit some properties of intrinsic parallelization, and can be used for various optimizations problems. Featuring the most relevant work presented at the 6th International Conference on Metaheuristics and Nature Inspired Computing, held at Marrakech (Morocco) from 27th to 31st October 2016, the book presents solutions, methods, algorithms, case studies, and software. It is a valuable resource for research academics and industrial practitioners.

This book addresses higher-lower level decision autonomy for autonomous vehicles, and discusses the addition of a novel architecture to cover both levels. The proposed framework's performance and stability are subsequently investigated by employing different meta-heuristic algorithms. The performance of the proposed architecture is shown to be largely independent of the algorithms employed; the use of diverse algorithms (subjected to the real-time performance of the algorithm) does not negatively affect the system's real-time performance. By analyzing the simulation results, the book demonstrates that the proposed model provides perfect mission timing and task management, while also guaranteeing secure deployment. Although mainly intended as a research work, the book's review chapters and the new approaches developed here are also suitable for use in courses for advanced undergraduate or graduate students.

This book constitutes the thoroughly refereed proceedings of the Clausthal-Goettingen International Workshop on Simulation Science, held in Goettingen, Germany, in April 2017. The 16 full papers presented were carefully reviewed and selected from 40 submissions. The papers are organized in topical sections on simulation and optimization in networks, simulation of materials, distributed simulations.

This book presents new optimization approaches and methods and their application in real-world and industrial problems, and demonstrates how many of the problems arising in engineering, economics and other domains can be formulated as optimization problems. Constituting a comprehensive collection of extended contributions from the 9th International Workshop on Computational Optimization (WCO) held in Gdansk, Poland, September 11-14, 2016, the book discusses important applications such as job scheduling, wildfire modeling, parameter settings for controlling different processes, capital budgeting, data mining, finding the location of sensors in a given network, identifying the conformation of molecules, algorithm correctness, decision support system, and computer memory management. Further, it shows how to develop algorithms for these based on new intelligent methods like evolutionary computations, ant colony optimization and constraint programming. The book is a valuable resource for researchers and practitioners alike.

This book focuses on optimal control and systems engineering in the big data era. It examines the scientific innovations in optimization, control and resilience management that can be applied to further success. In both business operations and engineering applications, there are huge amounts of data that can overwhelm computing resources of large-scale systems. This "big data" provides new opportunities to improve decision making and addresses risk for individuals as well in organizations. While utilizing data smartly can enhance decision making, how to use and incorporate data into the decision making framework remains a challenging topic. Ultimately the chapters in this book present new models and frameworks to help overcome this obstacle. Optimization and Control for Systems in the Big-Data Era: Theory and Applications is divided into five parts. Part I offers reviews on optimization and control theories, and Part II examines the optimization and control applications. Part III provides novel insights and new findings in the area of financial optimization analysis. The chapters in Part IV deal with operations analysis, covering flow-shop operations and quick response systems. The book concludes with final remarks and a look to the future of big data related optimization and control problems.

Current and historical research methods in approximation theory are presented in this book beginning with the 1800s and following the evolution of approximation theory via the refinement and extension of classical methods and ending with recent techniques and methodologies. Graduate students, postdocs, and researchers in mathematics, specifically those working in the theory of functions, approximation theory, geometric function theory, and optimization will find new insights as well as a guide to advanced topics. The chapters in this book are grouped into four themes; the first, polynomials (Chapters 1 -8), includes inequalities for polynomials and rational functions, orthogonal polynomials, and location of zeros. The second, inequalities and extremal problems are discussed in Chapters 9 -13. The third, approximation of functions, involves the approximants being polynomials, rational functions, and other types of functions and are covered in Chapters 14 -19. The last theme, quadrature, cubature and applications, comprises the final three chapters and includes an article coauthored by Rahman. This volume serves as a memorial volume to commemorate the distinguished career of Qazi Ibadur Rahman (1934-2013) of the Universite de Montreal. Rahman was considered by his peers as one of the prominent experts in analytic theory of polynomials and entire functions. The novelty of his work lies in his profound abilities and skills in applying techniques from other areas of mathematics, such as optimization theory and variational principles, to obtain final answers to countless open problems.

The interaction between mathematicians, statisticians and econometricians working in actuarial sciences and finance is producing numerous meaningful scientific results. This volume introduces new ideas, in the form of four-page papers, presented at the international conference Mathematical and Statistical Methods for Actuarial Sciences and Finance (MAF), held at Universidad Carlos III de Madrid (Spain), 4th-6th April 2018. The book covers a wide variety of subjects in actuarial science and financial fields, all discussed in the context of the cooperation between the three quantitative approaches. The topics include: actuarial models; analysis of high frequency financial data; behavioural finance; carbon and green finance; credit risk methods and models; dynamic optimization in finance; financial econometrics; forecasting of dynamical actuarial and financial phenomena; fund performance evaluation; insurance portfolio risk analysis; interest rate models; longevity risk; machine learning and soft-computing in finance; management in insurance business; models and methods for financial time series analysis, models for financial derivatives; multivariate techniques for financial markets analysis; optimization in insurance; pricing; probability in actuarial sciences, insurance and finance; real world finance; risk management; solvency analysis; sovereign risk; static and dynamic portfolio selection and management; trading systems. This book is a valuable resource for academics, PhD students, practitioners, professionals and researchers, and is also of interest to other readers with quantitative background knowledge.

Mathematical methods and theories with interdisciplinary applications are presented in this book. The eighteen contributions presented in this Work have been written by eminent scientists; a few papers are based on talks which took place at the International Conference at the Hellenic Artillery School in May 2015. Each paper evaluates possible solutions to long-standing problems such as the solvability of the direct electromagnetic scattering problem, geometric approaches to cyber security, ellipsoid targeting with overlap, non-equilibrium solutions of dynamic networks, measuring ballistic dispersion, elliptic regularity theory for the numerical solution of variational problems, approximation theory for polynomials on the real line and the unit circle, complementarity and variational inequalities in electronics, new two-slope parameterized achievement scalarizing functions for nonlinear multiobjective optimization, and strong and weak convexity of closed sets in a Hilbert space. Graduate students, scientists, engineers and researchers in pure and applied mathematical sciences, operations research, engineering, and cyber security will find the interdisciplinary scientific perspectives useful to their overall understanding and further research.

This book gathers the main recent results on positive trigonometric polynomials within a unitary framework. The book has two parts: theory and applications. The theory of sum-of-squares trigonometric polynomials is presented unitarily based on the concept of Gram matrix (extended to Gram pair or Gram set). The applications part is organized as a collection of related problems that use systematically the theoretical results.

A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry. The authors introduce the basic terminology of satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas.

This book presents a selection of advanced case studies that cover a substantial range of issues and real-world challenges and applications in space engineering. Vital mathematical modeling, optimization methodologies and numerical solution aspects of each application case study are presented in detail, with discussions of a range of advanced model development and solution techniques and tools. Space engineering challenges are discussed in the following contexts: *Advanced Space Vehicle Design *Computation of Optimal Low Thrust Transfers *Indirect Optimization of Spacecraft Trajectories *Resource-Constrained Scheduling, *Packing Problems in Space *Design of Complex Interplanetary Trajectories *Satellite Constellation Image Acquisition *Re-entry Test Vehicle Configuration Selection *Collision Risk Assessment on Perturbed Orbits *Optimal Robust Design of Hybrid Rocket Engines *Nonlinear Regression Analysis in Space Engineering *Regression-Based Sensitivity Analysis and Robust Design *Low-Thrust Multi-Revolution Orbit Transfers *Modeling and Optimization of Balance Layout Problems *Pilot-Induced Oscillations Alleviation *Modeling and Optimization of Hybrid Transfers to Near-Earth Objects *Probabilistic Safety Analysis of the Collision Between Space Debris and Satellite *Flatness-based Low-thrust Trajectory Optimization for Spacecraft Proximity Operations The contributing authors are expert researchers and practitioners in either the space engineering and/or in the applied optimization fields. Researchers and practitioners working in various applied aspects of space engineering will find this book practical and informative. Academics, graduate and post-graduate students in aerospace engineering, applied mathematics, operations research, optimization, and optimal control, will find this book useful.

Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search, evolutionary algorithms, artificial ants, and particle swarms, followed by chapters that demonstrate their applications to problems such as multiobjective optimization, logistics, vehicle routing, and air traffic management. The authors are leading researchers in this domain, with considerable teaching and applications experience, and the book will be of value to industrial practitioners, graduate students, and research academics.

This book is about computational methods based on operator splitting. It consists of twenty-three chapters written by recognized splitting method contributors and practitioners, and covers a vast spectrum of topics and application areas, including computational mechanics, computational physics, image processing, wireless communication, nonlinear optics, and finance. Therefore, the book presents very versatile aspects of splitting methods and their applications, motivating the cross-fertilization of ideas.

This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his colleagues, consisting of Democratic Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which were developed by other authors and have been successfully applied to various optimization problems. These consist of Particle Swarm Optimization, Big Bang-Big Crunch Algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm, and Chaos Embedded Metaheuristic Algorithms. Finally a multi-objective optimization method is presented to solve large-scale structural problems based on the Charged System Search algorithm. The concepts and algorithms presented in this book are not only applicable to optimization of skeletal structures and finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks. In the second edition seven new chapters are added consisting of the new developments in the field of optimization. These chapters consist of the Enhanced Colliding Bodies Optimization, Global Sensitivity Analysis, Tug of War Optimization, Water Evaporation Optimization, Vibrating Particle System Optimization and Cyclical Parthenogenesis Optimization algorithms. A chapter is also devoted to optimal design of large scale structures.