Новинка

11523.64 руб.

This book covers a wide range of applications and uses of simulation and modeling techniques in polymer injection molding, filling a noticeable gap in the literature of design, manufacturing, and the use of plastics injection molding. The authors help readers solve problems in the advanced control, simulation, monitoring, and optimization of injection molding processes. The book provides a tool for researchers and engineers to calculate the mold filling, optimization of processing control, and quality estimation before prototype molding.
Новинка

12288.24 руб.

This book aims to help engineers, Masters students and young researchers to understand and gain a general knowledge of logistic systems optimization problems and techniques, such as system design, layout, stock management, quality management, lot-sizing or scheduling. It summarizes the evaluation and optimization methods used to solve the most frequent problems. In particular, the authors also emphasize some recent and interesting scientific developments, as well as presenting some industrial applications and some solved instances from real-life cases. Performance evaluation tools (Petri nets, the Markov process, discrete event simulation, etc.) and optimization techniques (branch-and-bound, dynamic programming, genetic algorithms, ant colony optimization, etc.) are presented first. Then, new optimization methods are presented to solve systems design problems, layout problems and buffer-sizing optimization. Forecasting methods, inventory optimization, packing problems, lot-sizing quality management and scheduling are presented with examples in the final chapters.
Новинка

10372.01 руб.

So-called string problems are abundant in bioinformatics and computational biology. New optimization problems dealing with DNA or protein sequences are constantly arising and researchers are highly in need of efficient optimization techniques for solving them. One obstacle for optimization practitioners is the atypical nature of these problems which require an interdisciplinary approach in order to solve them efficiently and accurately.
Новинка

24072.15 руб.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: – On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; – Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; – Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Новинка

4914 руб.

In this book we attempt to apply swarm intelligence with numerical optimization techniques to solve multiobjective engineering problems. So, a hybrid algorithm that combines both of the trust region algorithm (numerical optimization technique) and particle swarm optimization (swarm intelligence method) to solve multiobjective optimization problems is presented. In addition, the new algorithm implemented to solve multiobjective engineering component design problems and the environmental economic dispatch problem to demonstrate the superiority of our approach and confirms its potential to solve engineering applications.
Новинка

10372.01 руб.

A detailed review of a wide range of meta-heuristic and evolutionary algorithms in a systematic manner and how they relate to engineering optimization problems This book introduces the main metaheuristic algorithms and their applications in optimization. It describes 20 leading meta-heuristic and evolutionary algorithms and presents discussions and assessments of their performance in solving optimization problems from several fields of engineering. The book features clear and concise principles and presents detailed descriptions of leading methods such as the pattern search (PS) algorithm, the genetic algorithm (GA), the simulated annealing (SA) algorithm, the Tabu search (TS) algorithm, the ant colony optimization (ACO), and the particle swarm optimization (PSO) technique. Chapter 1 of Meta-heuristic and Evolutionary Algorithms for Engineering Optimization provides an overview of optimization and defines it by presenting examples of optimization problems in different engineering domains. Chapter 2 presents an introduction to meta-heuristic and evolutionary algorithms and links them to engineering problems. Chapters 3 to 22 are each devoted to a separate algorithm— and they each start with a brief literature review of the development of the algorithm, and its applications to engineering problems. The principles, steps, and execution of the algorithms are described in detail, and a pseudo code of the algorithm is presented, which serves as a guideline for coding the algorithm to solve specific applications. This book: Introduces state-of-the-art metaheuristic algorithms and their applications to engineering optimization; Fills a gap in the current literature by compiling and explaining the various meta-heuristic and evolutionary algorithms in a clear and systematic manner; Provides a step-by-step presentation of each algorithm and guidelines for practical implementation and coding of algorithms; Discusses and assesses the performance of metaheuristic algorithms in multiple problems from many fields of engineering; Relates optimization algorithms to engineering problems employing a unifying approach. Meta-heuristic and Evolutionary Algorithms for Engineering Optimization is a reference intended for students, engineers, researchers, and instructors in the fields of industrial engineering, operations research, optimization/mathematics, engineering optimization, and computer science. OMID BOZORG-HADDAD, PhD, is Professor in the Department of Irrigation and Reclamation Engineering at the University of Tehran, Iran. MOHAMMAD SOLGI, M.Sc., is Teacher Assistant for M.Sc. courses at the University of Tehran, Iran. HUGO A. LOÁICIGA, PhD, is Professor in the Department of Geography at the University of California, Santa Barbara, United States of America.
Новинка

9603.03 руб.

Provides a tutorial on the computational tools that use mathematical optimization concepts and representations for the curation, analysis and redesign of metabolic networks Organizes, for the first time, the fundamentals of mathematical optimization in the context of metabolic network analysis Reviews the fundamentals of different classes of optimization problems including LP, MILP, MLP and MINLP Explains the most efficient ways of formulating a biological problem using mathematical optimization Reviews a variety of relevant problems in metabolic network curation, analysis and redesign with an emphasis on details of optimization formulations Provides a detailed treatment of bilevel optimization techniques for computational strain design and other relevant problems
Новинка

6376.27 руб.

Nonlinear Parameter Optimization Using R John C. Nash, Telfer School of Management, University of Ottawa, Canada A systematic and comprehensive treatment of optimization software using R In recent decades, optimization techniques have been streamlined by computational and artificial intelligence methods to analyze more variables, especially under non–linear, multivariable conditions, more quickly than ever before. Optimization is an important tool for decision science and for the analysis of physical systems used in engineering. Nonlinear Parameter Optimization with R explores the principal tools available in R for function minimization, optimization, and nonlinear parameter determination and features numerous examples throughout. Nonlinear Parameter Optimization with R: Provides a comprehensive treatment of optimization techniques Examines optimization problems that arise in statistics and how to solve them using R Enables researchers and practitioners to solve parameter determination problems Presents traditional methods as well as recent developments in R Is supported by an accompanying website featuring R code, examples and datasets Researchers and practitioners who have to solve parameter determination problems who are users of R but are novices in the field optimization or function minimization will benefit from this book. It will also be useful for scientists building and estimating nonlinear models in various fields such as hydrology, sports forecasting, ecology, chemical engineering, pharmaco-kinetics, agriculture, economics and statistics.
Новинка

9603.03 руб.

This book deals with the various aspects of stochastic dynamics, the resolution of large mechanical systems, and inverse problems. It integrates the most recent ideas from research and industry in the field of stochastic dynamics and optimization in structural mechanics over 11 chapters. These chapters provide an update on the various tools for dealing with uncertainties, stochastic dynamics, reliability and optimization of systems. The optimization–reliability coupling in structures dynamics is approached in order to take into account the uncertainties in the modeling and the resolution of the problems encountered. Accompanied by detailed examples of uncertainties, optimization, reliability, and model reduction, this book presents the newest design tools. It is intended for students and engineers and is a valuable support for practicing engineers and teacher-researchers.
Новинка

8389 руб.

Computational optimization methods have matured over the last few years due to extensive research by applied mathematicians and engineers. These methods have been applied to many practical applications. Several general-purpose optimization programs and programs for specific engineering applications have become available to solve particular optimization problems.Written by leading researchers in the field of optimization, this highly readable book covers state-of-the-art computational algorithms as well as applications of optimization to structural and mechanical systems. Formulations of the problems and numerical solutions are presented, and topics requiring further research are also suggested.
Новинка

9377 руб.

Книга "Newton-Type Methods for Optimization and Variational Problems".
Новинка

6589 руб.

This volume is intended for readers who, whether they be mathematicians, workers in other fields or students, are familiar with the basic approaches and methods of mathematical optimization. The subject matter is concerned with optimization problems in which some or all of the individual data involved depend on one parameter. Such problems are called one-parametric optimization problems. Solution algorithms for such problems are of interest for several reasons. We consider here mainly applications of solution algorithms for one-parametric optimization problems in the following fields: (i) globally convergent algorithms for nonlinear, in particular non-convex, optimization problems, (ii) global optimization, (iii) multi-objective optimization. The main tool for a solution algorithm for a one-parametric optimization problem will be the so-called pathfollowing methods (also called continuation or homotopy methods) (cf. Chapters 3 and 4). Classical methods in the set of stationary points will be extended to the set of all generalized critical points. This could be helpful since the path of stationary points stops in this set, but there is a continuation in the broader set of generalized critical points. However, it will be shown that pathfollowing methods only are not successful in every case. This is the reason why we propose to jump from one connected component in the set of local minimizers and generalized critical points, respectively, to another one (Chapter 5).
Новинка

14413.99 руб.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity; Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; Elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Новинка

13905.63 руб.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: – On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; – Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; – Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Новинка

13463.61 руб.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: – On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; – Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; – Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Новинка

7678.78 руб.

This book covers the design and optimization of computer networks applying a rigorous optimization methodology, applicable to any network technology. It is organized into two parts. In Part 1 the reader will learn how to model network problems appearing in computer networks as optimization programs, and use optimization theory to give insights on them. Four problem types are addressed systematically – traffic routing, capacity dimensioning, congestion control and topology design. Part 2 targets the design of algorithms that solve network problems like the ones modeled in Part 1. Two main approaches are addressed – gradient-like algorithms inspiring distributed network protocols that dynamically adapt to the network, or cross-layer schemes that coordinate the cooperation among protocols; and those focusing on the design of heuristic algorithms for long term static network design and planning problems. Following a hands-on approach, the reader will have access to a large set of examples in real-life technologies like IP, wireless and optical networks. Implementations of models and algorithms will be available in the open-source Net2Plan tool from which the user will be able to see how the lessons learned take real form in algorithms, and reuse or execute them to obtain numerical solutions. An accompanying link to the author’s own Net2plan software enables readers to produce numerical solutions to a multitude of real-life problems in computer networks (www.net2plan.com).
Новинка

6019.03 руб.

The classic approach in Automatic Control relies on the use of simplified models of the systems and reformulations of the specifications. In this framework, the control law can be computed using deterministic algorithms. However, this approach fails when the system is too complex for its model to be sufficiently simplified, when the designer has many constraints to take into account, or when the goal is not only to design a control but also to optimize it. This book presents a new trend in Automatic Control with the use of metaheuristic algorithms. These kinds of algorithm can optimize any criterion and constraint, and therefore do not need such simplifications and reformulations. The first chapter outlines the author’s main motivations for the approach which he proposes, and presents the advantages which it offers. In Chapter 2, he deals with the problem of system identification. The third and fourth chapters are the core of the book where the design and optimization of control law, using the metaheuristic method (particle swarm optimization), is given. The proposed approach is presented along with real-life experiments, proving the efficiency of the methodology. Finally, in Chapter 5, the author proposes solving the problem of predictive control of hybrid systems. Contents 1. Introduction and Motivations. 2. Symbolic Regression. 3. PID Design Using Particle Swarm Optimization. 4. Tuning and Optimization of H-infinity Control Laws. 5. Predictive Control of Hybrid Systems. About the Authors Guillaume Sandou is Professor in the Automatic Department of Supélec, in Gif Sur Yvette, France. He has had 12 books, 8 journal papers and 1 patent published, and has written papers for 32 international conferences.His main research interests include modeling, optimization and control of industrial systems; optimization and metaheuristics for Automatic Control; and constrained control.
Новинка

4358 руб.

Global Optimization is a mathematical tool to find the best possible solution for non linear system being used in different fields of life. Sometimes the cost and complexity associated with the optimization algorithms increases with increasing the complexity of the desired optimization problem. Engineering community is using such Meta Modeling techniques in design problems to replace the system function with an appropriate surrogate model improve the efficiency in simulation and optimization. This research study shows development and implementation of a Meta Model and its utilization for Global Optimization.
Новинка

9464 руб.

This book introduces general supply chain terminology particularly for novice readers, state of the art supply chain management and optimization issues and problems in manufacturing. The book provides insights for making supply chain decisions, planning and scheduling through supply chain network. It introduces optimization problems, i.e. transportation of raw materials, products and location, inventory of plants, warehouses and retailers, faced throughout the supply chain network.
Новинка

8089 руб.

This book presents a comprehensive treatment of necessary conditions for general optimization problems. The presentation is carried out in the context of a general theory for extremal problems in a topological vector space setting. Following a brief summary of the required background, generalized Lagrange multiplier rules are derived for optimization problems with equality and generalized "inequality" constraints. The treatment stresses the importance of the choice of the underlying set over which the optimization is to be performed, the delicate balance between differentiability-continuity requirements on the constraint functionals, and the manner in which the underlying set is approximated by a convex set. The generalized multiplier rules are used to derive abstract maximum principles for classes of optimization problems defined in terms of operator equations in a Banach space. It is shown that special cases include the usual maximum principles for general optimal control problems described in terms of diverse systems such as ordinary differential equations, functional differential equations, Volterra integral equations, and difference equations. Careful distinction is made throughout the analysis between "local" and "global" maximum principles.Originally published in 1977.The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton Universit...
Новинка

9202 руб.

The overall content of this book is organized around two main parts. The first part is concerned with the modeling of optimization problems while the second part deals with the analysis of optimization problems. As introduction to the issues related to both modeling and analysis of optimization scenarios, we provide an explanatory state-of-the-art over-viewing the concepts of "Lagrange Relaxation" and "Neuron Dynamics" to explore possible answers to the various research questions concerning to different optimization issues.As proof of concept, we envisage a second order ordinary differential equation and we introduce a novel approach based on Cellular Neural Network (CNN) templates optimization to derive appropriate solutions. To achieve this, we combine the concepts of "Lagrange Relaxation" and "Neuron Dynamics".
Новинка

11984.29 руб.

This book focuses on computational methods for large-scale statistical inverse problems and provides an introduction to statistical Bayesian and frequentist methodologies. Recent research advances for approximation methods are discussed, along with Kalman filtering methods and optimization-based approaches to solving inverse problems. The aim is to cross-fertilize the perspectives of researchers in the areas of data assimilation, statistics, large-scale optimization, applied and computational mathematics, high performance computing, and cutting-edge applications. The solution to large-scale inverse problems critically depends on methods to reduce computational cost. Recent research approaches tackle this challenge in a variety of different ways. Many of the computational frameworks highlighted in this book build upon state-of-the-art methods for simulation of the forward problem, such as, fast Partial Differential Equation (PDE) solvers, reduced-order models and emulators of the forward problem, stochastic spectral approximations, and ensemble-based approximations, as well as exploiting the machinery for large-scale deterministic optimization through adjoint and other sensitivity analysis methods. Key Features: • Brings together the perspectives of researchers in areas of inverse problems and data assimilation. • Assesses the current state-of-the-art and identify needs and opportunities for future research. • Focuses on the computational methods used to analyze and simulate inverse problems. • Written by leading experts of inverse problems and uncertainty quantification. Graduate students and researchers working in statistics, mathematics and engineering will benefit from this book.
Новинка

11800.46 руб.

An accessible introduction to metaheuristics and optimization, featuring powerful and modern algorithms for application across engineering and the sciences From engineering and computer science to economics and management science, optimization is a core component for problem solving. Highlighting the latest developments that have evolved in recent years, Engineering Optimization: An Introduction with Metaheuristic Applications outlines popular metaheuristic algorithms and equips readers with the skills needed to apply these techniques to their own optimization problems. With insightful examples from various fields of study, the author highlights key concepts and techniques for the successful application of commonly-used metaheuristc algorithms, including simulated annealing, particle swarm optimization, harmony search, and genetic algorithms. The author introduces all major metaheuristic algorithms and their applications in optimization through a presentation that is organized into three succinct parts: Foundations of Optimization and Algorithms provides a brief introduction to the underlying nature of optimization and the common approaches to optimization problems, random number generation, the Monte Carlo method, and the Markov chain Monte Carlo method Metaheuristic Algorithms presents common metaheuristic algorithms in detail, including genetic algorithms, simulated annealing, ant algorithms, bee algorithms, particle swarm optimization, firefly algorithms, and harmony search Applications outlines a wide range of applications that use metaheuristic algorithms to solve challenging optimization problems with detailed implementation while also introducing various modifications used for multi-objective optimization Throughout the book, the author presents worked-out examples and real-world applications that illustrate the modern relevance of the topic. A detailed appendix features important and popular algorithms using MATLAB® and Octave software packages, and a related FTP site houses MATLAB code and programs for easy implementation of the discussed techniques. In addition, references to the current literature enable readers to investigate individual algorithms and methods in greater detail. Engineering Optimization: An Introduction with Metaheuristic Applications is an excellent book for courses on optimization and computer simulation at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners working in the fields of mathematics, engineering, computer science, operations research, and management science who use metaheuristic algorithms to solve problems in their everyday work.
Новинка

9756.83 руб.

Praise for the Third Edition «. . . guides and leads the reader through the learning path . . . [e]xamples are stated very clearly and the results are presented with attention to detail.» —MAA Reviews Fully updated to reflect new developments in the field, the Fourth Edition of Introduction to Optimization fills the need for accessible treatment of optimization theory and methods with an emphasis on engineering design. Basic definitions and notations are provided in addition to the related fundamental background for linear algebra, geometry, and calculus. This new edition explores the essential topics of unconstrained optimization problems, linear programming problems, and nonlinear constrained optimization. The authors also present an optimization perspective on global search methods and include discussions on genetic algorithms, particle swarm optimization, and the simulated annealing algorithm. Featuring an elementary introduction to artificial neural networks, convex optimization, and multi-objective optimization, the Fourth Edition also offers: A new chapter on integer programming Expanded coverage of one-dimensional methods Updated and expanded sections on linear matrix inequalities Numerous new exercises at the end of each chapter MATLAB exercises and drill problems to reinforce the discussed theory and algorithms Numerous diagrams and figures that complement the written presentation of key concepts MATLAB M-files for implementation of the discussed theory and algorithms (available via the book's website) Introduction to Optimization, Fourth Edition is an ideal textbook for courses on optimization theory and methods. In addition, the book is a useful reference for professionals in mathematics, operations research, electrical engineering, economics, statistics, and business.
Новинка

28273.59 руб.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. “Paradigms of Combinatorial Optimization” is divided in two parts: • Paradigmatic Problems, that handles several famous combinatorial optimization problems as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of the Combinatorial Optimization as one of the most active actual scientific domains; • Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.
Новинка

10372.01 руб.

Evolutionary computation algorithms are employed to minimize functions with large number of variables. Biogeography-based optimization (BBO) is an optimization algorithm that is based on the science of biogeography, which researches the migration patterns of species. These migration paradigms provide the main logic behind BBO. Due to the cross-disciplinary nature of the optimization problems, there is a need to develop multiple approaches to tackle them and to study the theoretical reasoning behind their performance. This book explains the mathematical model of BBO algorithm and its variants created to cope with continuous domain problems (with and without constraints) and combinatorial problems.
Новинка

9065.85 руб.

A comprehensive account of the theory and application of Monte Carlo methods Based on years of research in efficient Monte Carlo methods for estimation of rare-event probabilities, counting problems, and combinatorial optimization, Fast Sequential Monte Carlo Methods for Counting and Optimization is a complete illustration of fast sequential Monte Carlo techniques. The book provides an accessible overview of current work in the field of Monte Carlo methods, specifically sequential Monte Carlo techniques, for solving abstract counting and optimization problems. Written by authorities in the field, the book places emphasis on cross-entropy, minimum cross-entropy, splitting, and stochastic enumeration. Focusing on the concepts and application of Monte Carlo techniques, Fast Sequential Monte Carlo Methods for Counting and Optimization includes: Detailed algorithms needed to practice solving real-world problems Numerous examples with Monte Carlo method produced solutions within the 1-2% limit of relative error A new generic sequential importance sampling algorithm alongside extensive numerical results An appendix focused on review material to provide additional background information Fast Sequential Monte Carlo Methods for Counting and Optimization is an excellent resource for engineers, computer scientists, mathematicians, statisticians, and readers interested in efficient simulation techniques. The book is also useful for upper-undergraduate and graduate-level courses on Monte Carlo methods.
Новинка

10755.4 руб.

Optimization of Power System Operation, 2nd Edition, offers a practical, hands-on guide to theoretical developments and to the application of advanced optimization methods to realistic electric power engineering problems. The book includes: New chapter on Application of Renewable Energy, and a new chapter on Operation of Smart Grid New topics include wheeling model, multi-area wheeling, and the total transfer capability computation in multiple areas Continues to provide engineers and academics with a complete picture of the optimization of techniques used in modern power system operation
Новинка

12667.68 руб.

Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages. The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.
Новинка

6807.04 руб.

Optimization is generally a reduction operation of a definite quantity. This process naturally takes place in our environment and through our activities. For example, many natural systems evolve, in order to minimize their potential energy. Modeling these phenomena then largely relies on our capacity to artificially reproduce these processes. In parallel, optimization problems have quickly emerged from human activities, notably from economic concerns. This book includes the most recent ideas coming from research and industry in the field of optimization, reliability and the recognition of accompanying uncertainties. It is made up of eight chapters which look at the reviewing of uncertainty tools, system reliability, optimal design of structures and their optimization (of sizing, form, topology and multi-objectives) – along with their robustness and issues on optimal safety factors. Optimization reliability coupling will also be tackled in order to take into account the uncertainties in the modeling and resolution of the problems encountered. The book is aimed at students, lecturers, engineers, PhD students and researchers. Contents 1. Uncertainty. 2. Reliability in Mechanical Systems. 3. Optimal Structural Design. 4. Multi-object Optimization with Uncertainty. 5. Robust Optimization. 6. Reliability Optimization. 7. Optimal Security Factors Approach. 8. Reliability-based Topology Optimization. About the Authors Abdelkhalak El Hami is Professor at the Institut National des Sciences Appliquées, Rouen, France. He is the author of many articles and books on optimization and uncertainty. Bouchaib Radi is Professor in the Faculty of Sciences and Technology at the University of Hassan Premier, Settat, Morocco. His research interests are in such areas as structural optimization, parallel computation, contact problem and metal forming. He is the author of many scientific articles and books.
Новинка

7739 руб.

Книга "Optimization and Optimal Control. Proceedings of a Conference held at Oberwolfach, November 17-23, 1974".
Новинка

10755.4 руб.

An essential resource for optimizing energy systems to enhance design capability, performance and sustainability Optimization of Energy Systems comprehensively describes the thermodynamic modelling, analysis and optimization of numerous types of energy systems in various applications. It provides a new understanding of the system and the process of defining proper objective functions for determination of the most suitable design parameters for achieving enhanced efficiency, cost effectiveness and sustainability. Beginning with a general summary of thermodynamics, optimization techniques and optimization methods for thermal components, the book goes on to describe how to determine the most appropriate design parameters for more complex energy systems using various optimization methods. The results of each chapter provide potential tools for design, analysis, performance improvement, and greenhouse gas emissions reduction. Key features: Comprehensive coverage of the modelling, analysis and optimization of many energy systems for a variety of applications. Examples, practical applications and case studies to put theory into practice. Study problems at the end of each chapter that foster critical thinking and skill development. Written in an easy-to-follow style, starting with simple systems and moving to advanced energy systems and their complexities. A unique resource for understanding cutting-edge research in the thermodynamic analysis and optimization of a wide range of energy systems, Optimization of Energy Systems is suitable for graduate and senior undergraduate students, researchers, engineers, practitioners, and scientists in the area of energy systems.
Новинка

3527 руб.

Master's Thesis from the year 2010 in the subject Mathematics - Applied Mathematics, grade: 85%, Priyadarshini College of Engineering, Nagpur, course: M-TECH., language: English, abstract: In this study, a foundation and solution technique using Genetic Algorithm (GA) for design optimization of worm gear mechanism is presented for the minimization of power-loss of worm gear mechanism with respect to specified set of constraints.Number of gear tooth and helix (thread) angle of worm are used as design variables and linear pressure, bending strength of tooth and deformation of worm are set as constraints.The GA in Non-Traditional method is useful and applicable for optimization of mechanical component design. The GA is an efficient search method which is inspired from natural genetics selection process to explore a given search space.In this work, GA is applied to minimize the power loss of worm gear which is subjected to constraints linear pressure, bending strength of tooth and deformation of worm.Up to now, many numerical optimization algorithms such as GA, Simulated Annealing, Ant-Colony Optimization, Neural Network have been developed and used for design optimization of engineering problems to find optimum design. Solving engineering problems can be complex and a time consuming process when there are large numbers of design variables and constraints. Hence, there is a need for more efficient and reliable algorithms that solve such problems. The improvement of faster com...
Новинка

4402 руб.

Doctoral Thesis / Dissertation from the year 2009 in the subject Electrotechnology, grade: 1.0, University of Duisburg-Essen (Institute of Electrical Power Systems), course: Electrical Engineering, language: English, abstract: The primary objective of this dissertation is to develop a black box optimization tool. The algorithm should be able to solve complex nonlinear, multimodal, discontinuous and mixed-integer power system optimization problems without any model reduction. Although there are many computational intelligence (CI) basedalgorithms which can handle these problems, they require intense human intervention in the form of parameter tuning, selection of a suitable algorithm for a given problem etc. The idea here is to develop an algorithm that works relatively well on a variety of problems with minimum human effort.The most significant optimization task in the power system operation is the scheduling of various generation resources (Unit Commitment, UC). The current practice used in UC modelling is the binary approach. This modelling results in a high dimension problem. This in turn leads to increased computational effort anddecreased efficiency of the algorithm. A duty cycle based modelling proposed in this thesis results in 80 percent reduction in the problem dimension. The stern uptime and downtime requirements are also included in the modelling. Therefore,the search process mostly starts in a feasible solution space. From the investigations on a benchmark problem...
Новинка

6102 руб.

With respect to the importance of multi-objective optimization in the context of the today's information processing and analysis, as well as the limitation of current approaches to treat large and complex tasks in practical time and little adjustment costs, this work proposes a novel optimization concept, based on data domain transformations and subsequent cluster analyses to solve multi-objective optimization problems. The approach abstracts the transposition of large, high-dimensional and diverse data models to low-dimensional uniform equivalents within an independent framework, which is optimized regarding data similarity conservation, i.e. the semantic relations of the data items to each other are preserved, and low runtime complexity, i.e. linearly increasing model sizes also cause only linearly growing runtimes in spite of the consideration of all data relations. The cluster analysis step is represented by an enhanced version of the k-Means algorithm, which is designed to group large numbers of data items to large numbers of clusters with also linear time complexity. Applying and adapting these both components to generic segmentation and pattern recognition tasks as two representative multi-objective optimization problems, illustrate and prove the usability of the proposed concept, by solving these tasks with high qualities of results and low runtimes with virtually linear time complexities. The abstracted components, as well as their application extensions are tes...
Новинка

4605.81 руб.

Robust Optimization is a method to improve robustness using low-cost variations of a single, conceptual design. The benefits of Robust Optimization include faster product development cycles; faster launch cycles; fewer manufacturing problems; fewer field problems; lower-cost, higher performing products and processes; and lower warranty costs. All these benefits can be realized if engineering and product development leadership of automotive and manufacturing organizations leverage the power of using Robust Optimization as a competitive weapon. Written by world renowned authors, Robust Optimization: World’s Best Practices for Developing Winning Vehicles, is a ground breaking book whichintroduces the technical management strategy of Robust Optimization. The authors discuss what the strategy entails, 8 steps for Robust Optimization and Robust Assessment, and how to lead it in a technical organization with an implementation strategy. Robust Optimization is defined and it is demonstrated how the techniques can be applied to manufacturing organizations, especially those with automotive industry applications, so that Robust Optimization creates the flexibility that minimizes product development cost, reduces product time-to-market, and increases overall productivity. Key features: Presents best practices from around the globe on Robust Optimization that can be applied in any manufacturing and automotive organization in the world Includes 19 successfully implemented best case studies from automotive original equipment manufacturers and suppliers Provides manufacturing industries with proven techniques to become more competitive in the global market Provides clarity concerning the common misinterpretations on Robust Optimization Robust Optimization: World’s Best Practices for Developing Winning Vehicles is a must-have book for engineers and managers who are working on design, product, manufacturing, mechanical, electrical, process, quality area; all levels of management especially in product development area, research and development personnel and consultants. It also serves as an excellent reference for students and teachers in engineering.
Новинка

6104 руб.

With the rapid scientific and technological advances in the modern age, new challenging optimization problems are encountered in various fields and disciplines, requiring novel approaches to search for their solutions. Meta-heuristics and stochastic search methods like evolutionary algorithms are a promising approach which have been successfully applied to many real-world problems. Probabilistic modeling is an important tool for dealing with the uncertainty in the problems and several methods have been proposed for automatic learning and inference of probabilistic models. Estimation of distribution algorithms (EDAs) are a class of evolutionary algorithms which utilize probabilistic modeling to enhance the search for solutions of complex optimization problems. In this book, we discuss the use of a well-known statistical technique called regularization for model learning in EDAs and study how it influences the performance of these algorithms in optimization. The discussions are extended to multi-objective optimization where joint variable-objective probabilistic modeling is introduced and analyzed. Our study also covers noisy domains, employing methods based on interval analysis.
Новинка

12288.24 руб.

The purpose of this book is to present the main methods of static and dynamic optimization. It has been written within the framework of the European Union project – ERRIC (Empowering Romanian Research on Intelligent Information Technologies), funded by the EU’s FP7 Research Potential program and developed in cooperation between French and Romanian teaching researchers. Through the principles of various proposed algorithms (with additional references) this book allows the interested reader to explore various methods of implementation such as linear programming, nonlinear programming – particularly important given the wide variety of existing algorithms, dynamic programming with various application examples and Hopfield networks. The book examines optimization in relation to systems identification; optimization of dynamic systems with particular application to process control; optimization of large scale and complex systems; optimization and information systems.
Новинка

6364 руб.

Книга "Optimization Problems and Their Applications. 7th International Conference, OPTA 2018, Omsk, Russia, July 8-14, 2018, Revised Selected Papers".
Новинка

7758.96 руб.

A UNIQUE ENGINEERING AND STATISTICAL APPROACH TO OPTIMAL RESOURCE ALLOCATION Optimal Resource Allocation: With Practical Statistical Applications and Theory features the application of probabilistic and statistical methods used in reliability engineering during the different phases of life cycles of technical systems. Bridging the gap between reliability engineering and applied mathematics, the book outlines different approaches to optimal resource allocation and various applications of models and algorithms for solving real-world problems. In addition, the fundamental background on optimization theory and various illustrative numerical examples are provided. The book also features: An overview of various approaches to optimal resource allocation, from classical Lagrange methods to modern algorithms based on ideas of evolution in biology Numerous exercises and case studies from a variety of areas, including communications, transportation, energy transmission, and counterterrorism protection The applied methods of optimization with various methods of optimal redundancy problem solutions as well as the numerical examples and statistical methods needed to solve the problems Practical thoughts, opinions, and judgments on real-world applications of reliability theory and solves practical problems using mathematical models and algorithms Optimal Resource Allocation is a must-have guide for electrical, mechanical, and reliability engineers dealing with engineering design and optimal reliability problems. In addition, the book is excellent for graduate and PhD-level courses in reliability theory and optimization.
Новинка

3212 руб.

The optimal control problems governed by partial differential equations have developed very fast in the last 30 years, and it has brought a promising and vital researching domain to the subject of mathematics. The optimal control problems governed by partial differential equations concern many applications in physics, chemistry, biology, etc., such as materials design, crystal growth, temperature control, petroleum exploitation, and so on. The partial differential equations involved in these problems include elliptic equations, parabolic equations and hyperbolic equations. Our objective of this book, which consists of three chapters, aims to introduce the analytical and numerical solutions of constrained optimal control problems of quasilinear parabolic systems.
Новинка

4914 руб.

Operations Research (OR) is a branch of mathematics which is concerned with the application of scientific methods and techniques to decision making problems. The optimum seeking methods are also known as mathematical programming techniques and are generally studied as a part of OR. Stochastic Programming, a mathematical programming technique for modeling and solution of optimization problems with uncertain data parameters, especially when we have random variables with known distributions. An application of Stochastic programming to the optimization of Asynchronous Transfer Mode (ATM) data communication networks design.
Новинка

14413.99 руб.

Differential evolution is a very simple but very powerful stochastic optimizer. Since its inception, it has proved very efficient and robust in function optimization and has been applied to solve problems in many scientific and engineering fields. In Differential Evolution , Dr. Qing begins with an overview of optimization, followed by a state-of-the-art review of differential evolution, including its fundamentals and up-to-date advances. He goes on to explore the relationship between differential evolution strategies, intrinsic control parameters, non-intrinsic control parameters, and problem features through a parametric study. Findings and recommendations on the selection of strategies and intrinsic control parameter values are presented. Lastly, after an introductory review of reported applications in electrical and electronic engineering fields, different research groups demonstrate how the methods can be applied to such areas as: multicast routing, multisite mapping in grid environments, antenna arrays, analog electric circuit sizing, electricity markets, stochastic tracking in video sequences, and color quantization. Contains a systematic and comprehensive overview of differential evolution Reviews the latest differential evolution research Describes a comprehensive parametric study conducted over a large test bed Shows how methods can be practically applied to mobile communications grid computing circuits image processing power engineering Sample applications demonstrated by research groups in the United Kingdom, Australia, Italy, Turkey, China, and Eastern Europe Provides access to companion website with code examples for download Differential Evolution is ideal for application engineers, who can use the methods described to solve specific engineering problems. It is also a valuable reference for post-graduates and researchers working in evolutionary computation, design optimization and artificial intelligence. Researchers in the optimization field or engineers and managers involved in operations research will also find the book a helpful introduction to the topic.
Новинка

11904.12 руб.

In control theory, sliding mode control (SMC) is a nonlinear control method that alters the dynamics of a nonlinear system by application of a discontinuous control signal that forces the system to slide along a cross-section of the system's normal behaviour. In recent years, SMC has been successfully applied to a wide variety of practical engineering systems including robot manipulators, aircraft, underwater vehicles, spacecraft, flexible space structures, electrical motors, power systems, and automotive engines. Sliding Mode Control of Uncertain Parameter-Switching Hybrid Systems addresses the increasing demand for developing SMC technologies and comprehensively presents the new, state-of-the-art sliding mode control methodologies for uncertain parameter-switching hybrid systems. It establishes a unified framework for SMC of Markovian jump singular systems and proposes new SMC methodologies based on the analysis results. A series of problems are solved with new approaches for analysis and synthesis of switched hybrid systems, including stability analysis and stabilization, dynamic output feedback control, and SMC. A set of newly developed techniques (e.g. average dwell time, piecewise Lyapunov function, parameter-dependent Lyapunov function, cone complementary linearization) are exploited to handle the emerging mathematical/computational challenges. Key features: Covers new concepts, new models and new methodologies with theoretical significance in system analysis and control synthesis Includes recent advances in Markovian jump systems, switched hybrid systems, singular systems, stochastic systems and time-delay systems Includes solved problems Introduces advanced techniques Sliding Mode Control of Uncertain Parameter-Switching Hybrid Systems is a comprehensive reference for researchers and practitioners working in control engineering, system sciences and applied mathematics, and is also a useful source of information for senior undergraduate and graduates studying in these areas.
Новинка

11907.76 руб.

A comprehensive resource containing the operating principles and key insights of LTE networks performance optimization LTE Optimization Engineering Handbook is a comprehensive reference that describes the most current technologies and optimization principles for LTE networks. The text offers an introduction to the basics of LTE architecture, services and technologies and includes details on the key principles and methods of LTE optimization and its parameters. In addition, the author clarifies different optimization aspects such as wireless channel optimization, data optimization, CSFB, VoLTE, and video optimization. With the ubiquitous usage and increased development of mobile networks and smart devices, LTE is the 4G network that will be the only mainstream technology in the current mobile communication system and in the near future. Designed for use by researchers, engineers and operators working in the field of mobile communications and written by a noted engineer and experienced researcher, the LTE Optimization Engineering Handbook provides an essential guide that: Discusses the latest optimization engineering technologies of LTE networks and explores their implementation Features the latest and most industrially relevant applications, such as VoLTE and HetNets Includes a wealth of detailed scenarios and optimization real-world case studies Professionals in the field will find the LTE Optimization Engineering Handbook to be their go-to reference that includes a thorough and complete examination of LTE networks, their operating principles, and the most current information to performance optimization.
Новинка

9987.88 руб.

Introduces a revolutionary, quadratic-programming based approach to solving long-standing problems in motion planning and control of redundant manipulators This book describes a novel quadratic programming approach to solving redundancy resolutions problems with redundant manipulators. Known as ``QP-unified motion planning and control of redundant manipulators'' theory, it systematically solves difficult optimization problems of inequality-constrained motion planning and control of redundant manipulators that have plagued robotics engineers and systems designers for more than a quarter century. An example of redundancy resolution could involve a robotic limb with six joints, or degrees of freedom (DOFs), with which to position an object. As only five numbers are required to specify the position and orientation of the object, the robot can move with one remaining DOF through practically infinite poses while performing a specified task. In this case redundancy resolution refers to the process of choosing an optimal pose from among that infinite set. A critical issue in robotic systems control, the redundancy resolution problem has been widely studied for decades, and numerous solutions have been proposed. This book investigates various approaches to motion planning and control of redundant robot manipulators and describes the most successful strategy thus far developed for resolving redundancy resolution problems. Provides a fully connected, systematic, methodological, consecutive, and easy approach to solving redundancy resolution problems Describes a new approach to the time-varying Jacobian matrix pseudoinversion, applied to the redundant-manipulator kinematic control Introduces The QP-based unification of robots' redundancy resolution Illustrates the effectiveness of the methods presented using a large number of computer simulation results based on PUMA560, PA10, and planar robot manipulators Provides technical details for all schemes and solvers presented, for readers to adopt and customize them for specific industrial applications Robot Manipulator Redundancy Resolution is must-reading for advanced undergraduates and graduate students of robotics, mechatronics, mechanical engineering, tracking control, neural dynamics/neural networks, numerical algorithms, computation and optimization, simulation and modelling, analog, and digital circuits. It is also a valuable working resource for practicing robotics engineers and systems designers and industrial researchers.
Новинка

10333.37 руб.

A comprehensive review of state-of-the-art CCHP modeling, optimization, and operation theory and practice This book was written by an international author team at the forefront of combined cooling, heating, and power (CCHP) systems R&D. It offers systematic coverage of state-of-the-art mathematical modeling, structure optimization, and CCHP system operation, supplemented with numerous illustrative case studies and examples. CCHP systems are an exciting emerging energy technology offering significant economic and environmental benefits. Combined Cooling, Heating, and Power Systems: Modelling, Optimization, and Operation is a timely response to ongoing efforts to maximize the efficiency of that technology. It begins with a survey of CCHP systems from the technological and societal perspectives, offering readers a broad and stimulating overview of the field. It then digs down into topics crucial for optimal CCHP operation. Discussions of each topic are carefully structured, walking readers from introduction and background to technical details. A set of new methodologies for the modeling, optimization and control of CCHP systems are presented within a unified framework. And the authors demonstrate innovative solutions to a variety of CCHP systems problems using new approaches to optimal power flow, load forecasting, and system operation design. Provides a comprehensive review of state-of-the-art of CCHP system development Presents new methodologies for mathematical modeling, optimization, and advanced control Combines theoretical rigor with real-world application perspectives Features numerous examples demonstrating an array of new design strategies Reflects the combined experience of veteran researchers in the field whose contributions are well recognized within the energy community Offers excellent background reading for students currently enrolled in the growing number of courses on energy systems at universities worldwide Timely, authoritative, and offering a balanced presentation of theory and practice, Combined Cooling, Heating, and Power Systems: Modelling, Optimization, and Operation is a valuable resource forresearchers, design practitioners, and graduate students in the areas of control theory, energy management, and energy systems design.
Новинка

11483.67 руб.

This book combines the research activities of the authors, both of whom are researchers at Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation), and presents their findings from the last 15 years. Their work uses air transport as its focal point, within the realm of mathematical optimization, looking at real life problems and theoretical models in tandem, and the challenges that accompany studying both approaches. The authors’ research is linked with the attempt to reduce air space congestion in Western Europe, USA and, increasingly, Asia. They do this through studying stochastic optimization (particularly artificial evolution), the sectorization of airspace, route distribution and takeoff slots, and by modeling airspace congestion. Finally, the authors discuss their short, medium and long term research goals. They hope that their work, although related to air transport, will be applied to other fields, such is the transferable nature of mathematical optimization. At the same time, they intend to use other areas of research, such as approximation and statistics to complement their continued inquiry in their own field. Contents 1. Introduction. Part 1. Optimization and Artificial Evolution 2. Optimization: State of the Art. 3. Genetic Algorithms and Improvements. 4. A new concept for Genetic Algorithms based on Order Statistics. Part 2. Applications to Air Traffic Control 5. Air Traffic Control. 6. Contributions to Airspace Sectorization. 7. Contribution to Traffic Assignment. 8. Airspace Congestion Metrics. 9. Conclusion and Future Perspectives. About the Authors Daniel Delahaye works for Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation) in France. Stéphane Puechmorel works for Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation) in France.
Новинка

6342 руб.

Nowadays, meta-heuristic optimization algorithms have been extensively applied to a variety of Machine Learning (ML). The majority of them imitate the behavior of natural phenomena to find the best solution. The algorithms find promising regions in an affordable time because of exploration and exploitation ability. Although the mentioned algorithms have satisfactory results in various fields, none of them is able to present a higher performance for all applications. Therefore, searching for a new meta-heuristic algorithm is an open problem. In this study, an improved particle swarm optimization (PSO) scheme combined with Newton’s laws of motion, the centripetal accelerated particle swarm optimization (CAPSO), is introduced. CAPSO accelerates the learning and convergence of ML problems. In addition, the binary mode of the proposed algorithm, binary centripetal accelerated particle swarm optimization (BCAPSO), is introduced for binary search spaces.
Новинка

10217.48 руб.

A clear and lucid bottom-up approach to the basic principles of evolutionary algorithms Evolutionary algorithms (EAs) are a type of artificial intelligence. EAs are motivated by optimization processes that we observe in nature, such as natural selection, species migration, bird swarms, human culture, and ant colonies. This book discusses the theory, history, mathematics, and programming of evolutionary optimization algorithms. Featured algorithms include genetic algorithms, genetic programming, ant colony optimization, particle swarm optimization, differential evolution, biogeography-based optimization, and many others. Evolutionary Optimization Algorithms: Provides a straightforward, bottom-up approach that assists the reader in obtaining a clear—but theoretically rigorous—understanding of evolutionary algorithms, with an emphasis on implementation Gives a careful treatment of recently developed EAs—including opposition-based learning, artificial fish swarms, bacterial foraging, and many others— and discusses their similarities and differences from more well-established EAs Includes chapter-end problems plus a solutions manual available online for instructors Offers simple examples that provide the reader with an intuitive understanding of the theory Features source code for the examples available on the author's website Provides advanced mathematical techniques for analyzing EAs, including Markov modeling and dynamic system modeling Evolutionary Optimization Algorithms: Biologically Inspired and Population-Based Approaches to Computer Intelligence is an ideal text for advanced undergraduate students, graduate students, and professionals involved in engineering and computer science.
Новинка

9314 руб.

Stochastic programs form a class of optimization problems that have seen much attention in the last decade. As has the class of equilibrium problems which have resulted largely from the analytic treatment of Nash games. This thesis delves into some challenging areas of stochastic optimization and stochastic equilibrium programming. Our interest is in understanding properties of these problems and in developing algorithms for solving such problems. We first consider a two-period stochastic nonlinear program. In this context, we obtain new insights into the notions of feasibility and recourse for such programs and develop an algorithm based on sequential quadratic programming. The algorithm uses two quadratic programming solvers based on Benders decomposition: an inexact cut version of the L-shaped method and a trust-region method. We next consider stochastic equilibrium problems arising from Nash-Cournot competition, inspired by a Cournot bidding model for electricity markets. We first show existence and uniqueness of Nash equilibria to a wide class of stochastic quadratic games and then develop a splitting method that can be decomposed scenario-wise to compute such equilibria.
Новинка

3564 руб.

Optimal control theory has been used in the solution of an enormous variety of problems in physics, engineering, economic and biology. Many of the problem of design in airframe, shipbuilding, electronic, and other engineering fields are in essence, problems of control. The most widely studied type of problem in the mathematical theory of control is the "time optimal" control problem. The aim of control in this problem is to transform any initial state of a dynamic system into a desired stationary state in minimal time.
Новинка

7402 руб.

The structure of approximate solutions of autonomous discrete-time optimal control problems and individual turnpike results for optimal control problems without convexity (concavity) assumptions are examined in this book. In particular, the book focuses on the properties of approximate solutions which are independent of the length of the interval, for all sufficiently large intervals; these results apply to the so-called turnpike property of the optimal control problems. By encompassing the so-called turnpike property the approximate solutions of the problems are determined primarily by the objective function and are fundamentally independent of the choice of interval and endpoint conditions, except in regions close to the endpoints. This book also explores the turnpike phenomenon for two large classes of autonomous optimal control problems. It is illustrated that the turnpike phenomenon is stable for an optimal control problem if the corresponding infinite horizon optimal control problem possesses an asymptotic turnpike property. If an optimal control problem belonging to the first class possesses the turnpike property, then the turnpike is a singleton (unit set). The stability of the turnpike property under small perturbations of an objective function and of a constraint map is established. For the second class of problems where the turnpike phenomenon is not necessarily a singleton the stability of the turnpike property under small perturbations of an objective function is...
Новинка

4749 руб.

Two groups of problems discussed in the book. The first is connected with the output of formulas treatment discontinuous locus refraction seismic waves (the general case) propagating in a vertically heterogeneous elastic isotropic media. Also obtained solving treatment locus waves propagating upward from the source, reflected and converted waves. To determine the beam parameters based convex cubic spline approximating the experimental hodograph. The numerical decision along the multidimensional inverse kinematics problem of seismic (tasks seismic tomography). The second range of problems connected with the definition of coordinates hypocenters close and distant earthquakes. A new, sustainable approach to solving these problems based on the minimization of the residual functional majorant estimates times. The book is intended for specialists in the fields of applied and theoretical seismology, and will be useful to students and graduates in related disciplines.
Новинка

11335.59 руб.

Air Traffic Management involves many different services such as Airspace Management, Air Traffic Flow Management and Air Traffic Control. Many optimization problems arise from these topics and they generally involve different kinds of variables, constraints, uncertainties. Metaheuristics are often good candidates to solve these problems. The book models various complex Air Traffic Management problems such as airport taxiing, departure slot allocation, en route conflict resolution, airspace and route design. The authors detail the operational context and state of art for each problem. They introduce different approaches using metaheuristics to solve these problems and when possible, compare their performances to existing approaches
Новинка

5838.35 руб.

The author of this book presents a general, robust, and easy-to-use method that can handle many design parameters efficiently. Following an introduction, Chapter 1 presents the general concepts of truss layout optimization, starting from topology optimization where structural component sizes and system connectivity are simultaneously optimized. To fully realize the potential of truss layout optimization for the design of lightweight structures, the consideration of geometrical variables is then introduced. Chapter 2 addresses truss geometry and topology optimization by combining mathematical programming and structural mechanics: the structural properties of the optimal solution are used for devising the novel formulation. To avoid singularities arising in optimal configurations, this approach disaggregates the equilibrium equations and fully integrates their basic elements within the optimization formulation. The resulting tool incorporates elastic and plastic design, stress and displacement constraints, as well as self-weight and multiple loading. The inherent slenderness of lightweight structures requires the study of stability issues. As a remedy, Chapter 3 proposes a conceptually simple but efficient method to include local and nodal stability constraints in the formulation. Several numerical examples illustrate the impact of stability considerations on the optimal design. Finally, the investigation on realistic design problems in Chapter 4 confirms the practical applicability of the proposed method. It is shown how we can generate a range of optimal designs by varying design settings.
Новинка

11335.59 руб.

This book describes the main classical combinatorial problems that can be encountered when designing a logistics network or driving a supply chain. It shows how these problems can be tackled by metaheuristics, both separately and using an integrated approach. A huge number of techniques, from the simplest to the most advanced ones, are given for helping the reader to implement efficient solutions that meet its needs. A lot of books have been written about metaheuristics (methods for solving hard optimization problems) and supply chain management (the field in which we find a huge number of combinatorial optimization problems) in the last decades. So, the main reason of this book is to describe how these methods can be implemented for this class of problems.
Новинка

9064 руб.

It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook's S.A. theorem on that the "satisfiability" problem is the universal NP-complete problem, is not true and, therefore, the issue on existence of at least one NP-complete problem remains open, that explains failures of attempts to estimate correlations between P and NP classes. Developed a universal procedure for solving a wide range of discrete optimization problems, which can be efficiently parallelized based on cyclic structures.
Новинка

8834.79 руб.

An accessible introduction to optimization analysis using spreadsheets Updated and revised, Optimization Modeling with Spreadsheets, Third Edition emphasizes model building skills in optimization analysis. By emphasizing both spreadsheet modeling and optimization tools in the freely available Microsoft® Office Excel® Solver, the book illustrates how to find solutions to real-world optimization problems without needing additional specialized software. The Third Edition includes many practical applications of optimization models as well as a systematic framework that illuminates the common structures found in many successful models. With focused coverage on linear programming, nonlinear programming, integer programming, and heuristic programming, Optimization Modeling with Spreadsheets, Third Edition features: An emphasis on model building using Excel Solver as well as appendices with additional instructions on more advanced packages such as Analytic Solver Platform and OpenSolver Additional space devoted to formulation principles and model building as opposed to algorithms New end-of-chapter homework exercises specifically for novice model builders Presentation of the Sensitivity Toolkit for sensitivity analysis with Excel Solver Classification of problem types to help readers see the broader possibilities for application Specific chapters devoted to network models and data envelopment analysis A companion website with interactive spreadsheets and supplementary homework exercises for additional practice Optimization Modeling with Spreadsheets, Third Edition is an excellent textbook for upper-undergraduate and graduate-level courses that include deterministic models, optimization, spreadsheet modeling, quantitative methods, engineering management, engineering modeling, operations research, and management science. The book is an ideal reference for readers wishing to advance their knowledge of Excel and modeling and is also a useful guide for MBA students and modeling practitioners in business and non-profit sectors interested in spreadsheet optimization.
Новинка

7678.78 руб.

Examines real life problems and solutions for operators and engineers running process controls Expands on the first book with the addition of five new chapters as well as new troubleshooting examples Written for the working operator and engineer, with straightforward instruction not hinged on complex math Includes real-life examples of control problems that commonly arise and how to fix them Emphasizes single and well-established process engineering principles that will help working engineers and operators switch manual control loops to automatic control A detailed review of a wide range of meta-heuristic and evolutionary algorithms in a systematic manner and how they relate to engineering optimization problems This book introduces the main metaheuristic algorithms and their applications in optimization. It describes 20 leading meta-heuristic and evolutionary algorithms and presents discussions and assessments of their performance in solving optimization problems from several fields of engineering. The book features clear and concise principles and presents detailed descriptions of leading methods such as the pattern search (PS) algorithm, the genetic algorithm (GA), the simulated annealing (SA) algorithm, the Tabu search (TS) algorithm, the ant colony optimization (ACO), and the particle swarm optimization (PSO) technique. Chapter 1 of Meta-heuristic and Evolutionary Algorithms for Engineering Optimization provides an overview of optimization and defines it by presenting examples of optimization problems in different engineering domains. Chapter 2 presents an introduction to meta-heuristic and evolutionary algorithms and links them to engineering problems. Chapters 3 to 22 are each devoted to a separate algorithm— and they each start with a brief literature review of the development of the algorithm, and its applications to engineering problems. The principles, steps, and execution of the algorithms are described in detail, and a pseudo code of the algorithm is presented, which serves as a guideline for coding the algorithm to solve specific applications. This book: Introduces state-of-the-art metaheuristic algorithms and their applications to engineering optimization; Fills a gap in the current literature by compiling and explaining the various meta-heuristic and evolutionary algorithms in a clear and systematic manner; Provides a step-by-step presentation of each algorithm and guidelines for practical implementation and coding of algorithms; Discusses and assesses the performance of metaheuristic algorithms in multiple problems from many fields of engineering; Relates optimization algorithms to engineering problems employing a unifying approach. Meta-heuristic and Evolutionary Algorithms for Engineering Optimization is a reference intended for students, engineers, researchers, and instructors in the fields of industrial engineering, operations research, optimization/mathematics, engineering optimization, and computer science. OMID BOZORG-HADDAD, PhD, is Professor in the Department of Irrigation and Reclamation Engineering at the University of Tehran, Iran. MOHAMMAD SOLGI, M.Sc., is Teacher Assistant for M.Sc. courses at the University of Tehran, Iran. HUGO A. LOÁICIGA, PhD, is Professor in the Department of Geography at the University of California, Santa Barbara, United States of America.