![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
|
Books > Science & Mathematics > Mathematics > Optimization > General
This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his graduate students, consisting of Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Democratic Particle Swarm Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which are developed by other authors and have been successfully applied to various optimization problems. These consist of Partical Swarm Optimization, Big Band Big Crunch algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm and Chaos Embedded Metaheuristic Algorithm. Finally a multi-objective Optimization is presented to Solve large scale structural problems based on the Charged System Search algorithm, In the second edition seven new chapters are added consisting of Enhance colliding bodies optimization, Global sensitivity analysis, Tug of War Optimization, Water evaporation optimization, Vibrating System Optimization and Cyclical Parthenogenesis Optimization algorithm. In the third edition, five new chapters are included consisting of the recently developed algorithms. These are Shuffled Shepherd Optimization Algorithm, Set Theoretical Shuffled Shepherd Optimization Algorithm, Set Theoretical Teaching-Learning-Based Optimization Algorithm, Thermal Exchange Metaheuristic Optimization Algorithm, and Water Strider Optimization Algorithm and Its Enhancement. The concepts and algorithm presented in this book are not only applicable to optimization of skeletal structure, finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks.
Small satellite technology is opening up a new era in space exploration offering reduced cost of launch and maintenance, operational flexibility with on-orbit reconfiguration, redundancy etc. The true power of such missions can be harnessed only from close and precise formation flying of satellites. Formation flying missions support diverse application areas such as reconnaissance, remote sensing, solar observatory, deep space observatories, etc. A key component involved in formation flying is the guidance algorithm that should account for system nonlinearities and unknown disturbances. The main focus of this book is to present various nonlinear optimal control and adaptive guidance ideas to ensure precise close formation flying in presence of such difficulties. In addition to in-depth discussion of the relevant topics, MATLAB program files for the results included are also provided for the benefit of the readers. Since this book has concise information about the various guidance techniques, it will be useful reference for researchers and practising engineers in the space field.
This book presents the theory and methods of flexible and generalized uncertainty optimization. Particularly, it describes the theory of generalized uncertainty in the context of optimization modeling. The book starts with an overview of flexible and generalized uncertainty optimization. It covers uncertainties that are both associated with lack of information and are more general than stochastic theory, where well-defined distributions are assumed. Starting from families of distributions that are enclosed by upper and lower functions, the book presents construction methods for obtaining flexible and generalized uncertainty input data that can be used in a flexible and generalized uncertainty optimization model. It then describes the development of the associated optimization model in detail. Written for graduate students and professionals in the broad field of optimization and operations research, this second edition has been revised and extended to include more worked examples and a section on interval multi-objective mini-max regret theory along with its solution method.
This book provides an in-depth analysis of the current evolutionary clustering techniques. It discusses the most highly regarded methods for data clustering. The book provides literature reviews about single objective and multi-objective evolutionary clustering algorithms. In addition, the book provides a comprehensive review of the fitness functions and evaluation measures that are used in most of evolutionary clustering algorithms. Furthermore, it provides a conceptual analysis including definition, validation and quality measures, applications, and implementations for data clustering using classical and modern nature-inspired techniques. It features a range of proven and recent nature-inspired algorithms used to data clustering, including particle swarm optimization, ant colony optimization, grey wolf optimizer, salp swarm algorithm, multi-verse optimizer, Harris hawks optimization, beta-hill climbing optimization. The book also covers applications of evolutionary data clustering in diverse fields such as image segmentation, medical applications, and pavement infrastructure asset management.
This book introduces the reader to important concepts in modern applied analysis, such as homogenization, gradient flows on metric spaces, geometric evolution, Gamma-convergence tools, applications of geometric measure theory, properties of interfacial energies, etc. This is done by tackling a prototypical problem of interfacial evolution in heterogeneous media, where these concepts are introduced and elaborated in a natural and constructive way. At the same time, the analysis introduces open issues of a general and fundamental nature, at the core of important applications. The focus on two-dimensional lattices as a prototype of heterogeneous media allows visual descriptions of concepts and methods through a large amount of illustrations.
This book is about algebraic and differential methods, as well as fractional calculus, applied to diagnose and reject faults in nonlinear systems, which are of integer or fractional order. This represents an extension of a very important and widely studied problem in control theory, namely fault diagnosis and rejection (using differential algebraic approaches), to systems presenting fractional dynamics, i.e. systems whose dynamics are represented by derivatives and integrals of non-integer order. The authors offer a thorough overview devoted to fault diagnosis and fault-tolerant control applied to fractional-order and integer-order dynamical systems, and they introduce new methodologies for control and observation described by fractional and integer models, together with successful simulations and real-time applications. The basic concepts and tools of mathematics required to understand the methodologies proposed are all clearly introduced and explained. Consequently, the book is useful as supplementary reading in courses of applied mathematics and nonlinear control theory. This book is meant for engineers, mathematicians, physicists and, in general, to researchers and postgraduate students in diverse areas who have a minimum knowledge of calculus. It also contains advanced topics for researchers and professionals interested in the area of states and faults estimation.
This book is intended to be a useful contribution for the modern teaching of applied mathematics, educating Industrial Mathematicians that will meet the growing demand for such experts. It covers many applications where mathematics play a fundamental role, from biology, telecommunications, medicine, physics, finance and industry. It is presented in such a way that can be useful in Modelation, Simulation and Optimization courses, targeting master and PhD students. Its content is based on many editions from the successful series of Modelling Weeks organized by the European Consortium of Mathematics in Industry (ECMI). Each chapter addresses a particular problem, and is written in a didactic way, providing the description of the problem, the particular way of approaching it and the proposed solution, along with the results obtained.
This book constitutes the refereed proceedings of the 12th International Conference on Optimization and Applications, OPTIMA 2021, held in Petrovac, Montenegro, in September - October 2021. Due to the COVID-19 pandemic the conference was partially held online. The 19 revised full papers presented were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections on mathematical programming; global optimization; stochastic optimization; optimal control; mathematical economics; optimization in data analysis; applications.
This book is devoted to the study of a class of optimal control problems arising in mathematical economics, related to the Robinson-Solow-Srinivasan (RSS) model. It will be useful for researches interested in the turnpike theory, infinite horizon optimal control and their applications, and mathematical economists. The RSS is a well-known model of economic dynamics that was introduced in the 1960s and as many other models of economic dynamics, the RSS model is determined by an objective function (a utility function) and a set-valued mapping (a technology map). The set-valued map generates a dynamical system whose trajectories are under consideration and the objective function determines an optimality criterion. The goal is to find optimal trajectories of the dynamical system, using the optimality criterion. Chapter 1 discusses turnpike properties for some classes of discrete time optimal control problems. Chapter 2 present the description of the RSS model and discuss its basic properties. Infinite horizon optimal control problems, related to the RSS model are studied in Chapter 3. Turnpike properties for the RSS model are analyzed in Chapter 4. Chapter 5 studies infinite horizon optimal control problems related to the RSS model with a nonconcave utility function. Chapter 6 focuses on infinite horizon optimal control problems with nonautonomous optimality criterions. Chapter 7 contains turnpike results for a class of discrete-time optimal control problems. Chapter 8 discusses the RSS model and compares different optimality criterions. Chapter 9 is devoted to the study of the turnpike properties for the RSS model. In Chapter 10 the one-dimensional autonomous RSS model is considered and the continuous time RSS model is studied in Chapter 11.
This book offers a systematic and rigorous treatment of continuous-time Markov decision processes, covering both theory and possible applications to queueing systems, epidemiology, finance, and other fields. Unlike most books on the subject, much attention is paid to problems with functional constraints and the realizability of strategies. Three major methods of investigations are presented, based on dynamic programming, linear programming, and reduction to discrete-time problems. Although the main focus is on models with total (discounted or undiscounted) cost criteria, models with average cost criteria and with impulsive controls are also discussed in depth. The book is self-contained. A separate chapter is devoted to Markov pure jump processes and the appendices collect the requisite background on real analysis and applied probability. All the statements in the main text are proved in detail. Researchers and graduate students in applied probability, operational research, statistics and engineering will find this monograph interesting, useful and valuable.
This book includes over 500 most challenging exercises and problems in calculus. Topical problems and exercises are discussed on set theory, numbers, functions, limits and continuity, derivative, integral calculus, Rolle's theorem, mean value theorem, optimization problems, sequences and series. All the seven chapters recall important definitions, theorems and concepts, making this book immensely valuable to undergraduate students of engineering, mathematics, statistics, computer science and basic sciences.
Provides well-written self-contained chapters, including problem sets and exercises, making it ideal for the classroom setting; Introduces applied optimization to the hazardous waste blending problem; Explores linear programming, nonlinear programming, discrete optimization, global optimization, optimization under uncertainty, multi-objective optimization, optimal control and stochastic optimal control; Includes an extensive bibliography at the end of each chapter and an index; GAMS files of case studies for Chapters 2, 3, 4, 5, and 7 are linked to http://www.springer.com/math/book/978-0-387-76634-8; Solutions manual available upon adoptions.
This tutorial is the first comprehensive introduction to (possibly infinite) linear systems containing strict inequalities and evenly convex sets. The book introduces their application to convex optimization. Particular attention is paid to evenly convex polyhedra and finite linear systems containing strict inequalities. The book also analyzes evenly convex and quasiconvex functions from a conjugacy and duality perspective. It discusses the applications of these functions in economics. Written in an expository style the main concepts and basic results are illustrated with suitable examples and figures..
The book addresses the minimization of special lower semicontinuous functionals over closed balls in metric spaces, called the approximate variation. The new notion of approximate variation contains more information about the bounded variation functional and has the following features: the infimum in the definition of approximate variation is not attained in general and the total Jordan variation of a function is obtained by a limiting procedure as a parameter tends to zero. By means of the approximate variation, we are able to characterize regulated functions in a generalized sense and provide powerful compactness tools in the topology of pointwise convergence, conventionally called pointwise selection principles. The book presents a thorough, self-contained study of the approximate variation and results which were not published previously in book form. The approximate variation is illustrated by a large number of examples designed specifically for this study. The discussion elaborates on the state-of-the-art pointwise selection principles applied to functions with values in metric spaces, normed spaces, reflexive Banach spaces, and Hilbert spaces. The highlighted feature includes a deep study of special type of lower semicontinuous functionals though the applied methods are of a general nature. The content is accessible to students with some background in real analysis, general topology, and measure theory. Among the new results presented are properties of the approximate variation: semi-additivity, change of variable formula, subtle behavior with respect to uniformly and pointwise convergent sequences of functions, and the behavior on improper metric spaces. These properties are crucial for pointwise selection principles in which the key role is played by the limit superior of the approximate variation. Interestingly, pointwise selection principles may be regular, treating regulated limit functions, and irregular, treating highly irregular functions (e.g., Dirichlet-type functions), in which a significant role is played by Ramsey's Theorem from formal logic.
Optimization is an important tool used in decision science and for the analysis of physical systems used in engineering. One can trace its roots to the Calculus of Variations and the work of Euler and Lagrange. This natural and reasonable approach to mathematical programming covers numerical methods for finite-dimensional optimization problems. It begins with very simple ideas progressing through more complicated concepts, concentrating on methods for both unconstrained and constrained optimization.
This book is a new contribution aiming to give some last research findings in the field of optimization and computing. This work is in the same field target than our two previous books published: "Recent Developments in Metaheuristics" and "Metaheuristics for Production Systems", books in Springer Series in Operations Research/Computer Science Interfaces. The challenge with this work is to gather the main contribution in three fields, optimization technique for production decision, general development for optimization and computing method and wider spread applications. The number of researches dealing with decision maker tool and optimization method grows very quickly these last years and in a large number of fields. We may be able to read nice and worthy works from research developed in chemical, mechanical, computing, automotive and many other fields.
This book presents the best papers from the 2nd International Conference on Mathematical Research for Blockchain Economy (MARBLE) 2020, held in Vilamoura, Portugal. While most blockchain conferences and forums are dedicated to business applications, product development or Initial Coin Offering (ICO) launches, this conference focused on the mathematics behind blockchain to bridge the gap between practice and theory. Blockchain Technology has been considered as the most fundamental and revolutionising invention since the Internet. Every year, thousands of blockchain projects are launched and circulated in the market, and there is a tremendous wealth of blockchain applications, from finance to healthcare, education, media, logistics and more. However, due to theoretical and technical barriers, most of these applications are impractical for use in a real-world business context. The papers in this book reveal the challenges and limitations, such as scalability, latency, privacy and security, and showcase solutions and developments to overcome them.
This book systematically discusses nonlinear interval optimization design theory and methods. Firstly, adopting a mathematical programming theory perspective, it develops an innovative mathematical transformation model to deal with general nonlinear interval uncertain optimization problems, which is able to equivalently convert complex interval uncertain optimization problems to simple deterministic optimization problems. This model is then used as the basis for various interval uncertain optimization algorithms for engineering applications, which address the low efficiency caused by double-layer nested optimization. Further, the book extends the nonlinear interval optimization theory to design problems associated with multiple optimization objectives, multiple disciplines, and parameter dependence, and establishes the corresponding interval optimization models and solution algorithms. Lastly, it uses the proposed interval uncertain optimization models and methods to deal with practical problems in mechanical engineering and related fields, demonstrating the effectiveness of the models and methods.
2019 marked the 85th anniversary of Heinrich Freiherr von Stackelberg's habilitation thesis "Marktform und Gleichgewicht," which formed the roots of bilevel optimization. Research on the topic has grown tremendously since its introduction in the field of mathematical optimization. Besides the substantial advances that have been made from the perspective of game theory, many sub-fields of bilevel optimization have emerged concerning optimal control, multiobjective optimization, energy and electricity markets, management science, security and many more. Each chapter of this book covers a specific aspect of bilevel optimization that has grown significantly or holds great potential to grow, and was written by top experts in the corresponding area. In other words, unlike other works on the subject, this book consists of surveys of different topics on bilevel optimization. Hence, it can serve as a point of departure for students and researchers beginning their research journey or pursuing related projects. It also provides a unique opportunity for experienced researchers in the field to learn about the progress made so far and directions that warrant further investigation. All chapters have been peer-reviewed by experts on mathematical optimization.
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. |
You may like...
Bio-Inspired Collaborative Intelligent…
Yongsheng Ding, Lei Chen, …
Hardcover
R4,890
Discovery Miles 48 900
Computational Optimization Techniques…
Muhammad Sarfraz, Samsul Ariffin Abdul Karim
Hardcover
R3,099
Discovery Miles 30 990
|