Computational Optimization

Computational optimization is an important paradigm with a wide range of applications. In virtually all branches of engineering and industry, we almost always try to optimize something - whether to minimize the cost and energy consumption, or to maximize profits, outputs, performance and efficiency. In many cases, this search for optimality is challenging, either because of the high computational cost of evaluating objectives and constraints, or because of the nonlinearity, multimodality, discontinuity and uncertainty of the problem functions in the real-world systems. Another complication is that most problems are often NP-hard, that is, the solution time for finding the optimum increases exponentially with the problem size. The development of efficient algorithms and specialized techniques that address these difficulties is of primary importance for contemporary engineering, science and industry. This book consists of 12 self-contained chapters, contributed from worldwide experts who are working in these exciting areas. The book strives to review and discuss the latest developments concerning optimization and modelling with a focus on methods and algorithms for computational optimization. It also covers well-chosen, real-world applications in science, engineering and industry. Main topics include derivative-free optimization, multi-objective evolutionary algorithms, surrogate-based methods, maximum simulated likelihood estimation, support vector machines, and metaheuristic algorithms. Application case studies include aerodynamic shape optimization, microwave engineering, black-box optimization, classification, economics, inventory optimization and structural optimization. This graduate level book can serve as an excellent reference for lecturers, researchers and students in computational science, engineering and industry.

We often come across computational optimization virtually in all branches of engineering and industry. Many engineering problems involve heuristic search and optimization, and, once discretized, may become combinatorial in nature, which gives rise to certain difficulties in terms of solution procedure. Some of these problems have enormous search spaces, are NP-hard and hence require heuristic solution techniques. Another difficulty is the lack of ability of classical solution techniques to determine appropriate optima of non-convex problems. Under these conditions, recent advances in computational optimization techniques have been shown to be advantageous and successful compared to classical approaches. This Volume presents some of the latest developments with a focus on the design of algorithms for computational optimization and their applications in practice. Through the chapters of this book, researchers and practitioners share their experience and newest methodologies with regard to intelligent optimization and provide various case studies of the application of intelligent optimization techniques in real-world applications.This book can serve as an excellent reference for researchers and graduate students in computer science, various engineering disciplines and the industry.

Computational Optimization: A Tribute to Olvi Mangasarian serves as an excellent reference, providing insight into some of the most challenging research issues in the field. This collection of papers covers a wide spectrum of computational optimization topics, representing a blend of familiar nonlinear programming topics and such novel paradigms as semidefinite programming and complementarity-constrained nonlinear programs. Many new results are presented in these papers which are bound to inspire further research and generate new avenues for applications. An informal categorization of the papers includes: Algorithmic advances for special classes of constrained optimization problems Analysis of linear and nonlinear programs Algorithmic advances B- stationary points of mathematical programs with equilibrium constraints Applications of optimization Some mathematical topics Systems of nonlinear equations.

provide models that could be used by do-it-yourselfers and also can be used toprovideunderstandingofthebackgroundissuessothatonecandoabetter job of working with the (proprietary) algorithms of the software vendors. In this book we strive to provide models that capture many of the - tails faced by ?rms operating in a modern supply chain, but we stop short of proposing models for economic analysis of the entire multi-player chain. In other words, we produce models that are useful for planning within a supply chain rather than models for planning the supply chain. The usefulness of the models is enhanced greatly by the fact that they have been implemented - ing computer modeling languages. Implementations are shown in Chapter 7, which allows solutions to be found using a computer. A reasonable question is: why write the book now? It is a combination of opportunities that have recently become available. The availability of mod- inglanguagesandcomputersthatprovidestheopportunitytomakepractical use of the models that we develop. Meanwhile, software companies are p- viding software for optimized production planning in a supply chain. The opportunity to make use of such software gives rise to a need to understand some of the issues in computational models for optimized planning. This is best done by considering simple models and examples.

Computational optimization is an important paradigm with a wide range of applications. In virtually all branches of engineering and industry, we almost always try to optimize something - whether to minimize the cost and energy consumption, or to maximize profits, outputs, performance and efficiency. In many cases, this search for optimality is challenging, either because of the high computational cost of evaluating objectives and constraints, or because of the nonlinearity, multimodality, discontinuity and uncertainty of the problem functions in the real-world systems. Another complication is that most problems are often NP-hard, that is, the solution time for finding the optimum increases exponentially with the problem size. The development of efficient algorithms and specialized techniques that address these difficulties is of primary importance for contemporary engineering, science and industry. This book consists of 12 self-contained chapters, contributed from worldwide experts who are working in these exciting areas. The book strives to review and discuss the latest developments concerning optimization and modelling with a focus on methods and algorithms for computational optimization. It also covers well-chosen, real-world applications in science, engineering and industry. Main topics include derivative-free optimization, multi-objective evolutionary algorithms, surrogate-based methods, maximum simulated likelihood estimation, support vector machines, and metaheuristic algorithms. Application case studies include aerodynamic shape optimization, microwave engineering, black-box optimization, classification, economics, inventory optimization and structural optimization. This graduate level book can serve as an excellent reference for lecturers, researchers and students in computational science, engineering and industry.

The purpose of optimization is to maximize the quality of lives, productivity in time, as well as interests. Therefore, optimization is an ongoing challenge for selecting the best possible among many other inferior designs. For a hundred years in the past, as optimization has been essential to human life, several techniques have been developed and utilized. Such a development has been one of the long-lasting challenges in engineering and science, and it is now clear that the optimization goals in many of real-life problems are unlikely to be achieved without resource for computational techniques. The history of such a development in the optimization techniques starts from the early 1950s and is still in progress. Since then, the efforts behind this development dedicated by many distinguished scientists, mathematicians, and engineers have brought us today a level of quality of lives. This book concerns with the computational optimization in engineering and techniques to resolve the underlying problems in real life. The current book contains studies from scientists and researchers around the world from North America to Europe and from Asia to Australia.

This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2014, held at Warsaw, Poland, September 7-10, 2014. The book presents recent advances in computational optimization. The volume includes important real problems like parameter settings for controlling processes in bioreactor and other processes, resource constrained project scheduling, infection distribution, molecule distance geometry, quantum computing, real-time management and optimal control, bin packing, medical image processing, localization the abrupt atmospheric contamination source and so on. It shows how to develop algorithms for them based on new metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks.

Computational Optimization of Internal Combustion Engines presents the state of the art of computational models and optimization methods for internal combustion engine development using multi-dimensional computational fluid dynamics (CFD) tools and genetic algorithms. Strategies to reduce computational cost and mesh dependency are discussed, as well as regression analysis methods. Several case studies are presented in a section devoted to applications, including assessments of: spark-ignition engines, dual-fuel engines, heavy duty and light duty diesel engines. Through regression analysis, optimization results are used to explain complex interactions between engine design parameters, such as nozzle design, injection timing, swirl, exhaust gas recirculation, bore size, and piston bowl shape. Computational Optimization of Internal Combustion Engines demonstrates that the current multi-dimensional CFD tools are mature enough for practical development of internal combustion engines. It is written for researchers and designers in mechanical engineering and the automotive industry.

This book provides a bridge between continuous optimization and PDE modelling and focuses on the numerical solution of the corresponding problems. Intended for graduate students in PDE-constrained optimization, it is also suitable as an introduction for researchers in scientific computing or optimization.

Contemporary design in engineering and industry relies heavily on computer simulation and efficient algorithms to reduce the cost and to maximize the performance and sustainability as well as profits and energy efficiency. Solving an optimization problem correctly and efficiently requires not only the right choice of optimization algorithms and simulation methods, but also the proper implementation and insight into the problem of interest. This book consists of ten self-contained, detailed case studies of real-world optimization problems, selected from a wide range of applications and contributed from worldwide experts who are working in these exciting areas. Optimization topics and applications include gas and water supply networks, oil field production optimization, microwave engineering, aerodynamic shape design, environmental emergence modelling, structural engineering, waveform design for radar and communication systems, parameter estimation in laser experiment and measurement, engineering materials and network scheduling. These case studies have been solved using a wide range of optimization techniques, including particle swarm optimization, genetic algorithms, artificial bee colony, harmony search, adaptive error control, derivative-free pattern search, surrogate-based optimization, variable-fidelity modelling, as well as various other methods and approaches. This book is a practical guide to help graduates and researchers to carry out optimization for real-world applications. More advanced readers will also find it a helpful reference and aide memoire.

The field of optimization is interdisciplinary in nature, and has been making a significant impact on many disciplines. As a result, it is an indispensable tool for many practitioners in various fields. Conventional optimization techniques have been well established and widely published in many excellent textbooks. However, there are new techniques, such as neural networks, simulated anneal ing, stochastic machines, mean field theory, and genetic algorithms, which have been proven to be effective in solving global optimization problems. This book is intended to provide a technical description on the state-of-the-art development in advanced optimization techniques, specifically heuristic search, neural networks, simulated annealing, stochastic machines, mean field theory, and genetic algorithms, with emphasis on mathematical theory, implementa tion, and practical applications. The text is suitable for a first-year graduate course in electrical and computer engineering, computer science, and opera tional research programs. It may also be used as a reference for practicing engineers, scientists, operational researchers, and other specialists. This book is an outgrowth of a couple of special topic courses that we have been teaching for the past five years. In addition, it includes many results from our inter disciplinary research on the topic. The aforementioned advanced optimization techniques have received increasing attention over the last decade, but relatively few books have been produced.

Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches covers recent developments in optimization techniques for addressing several computational chemistry and biology problems. A tantalizing problem that cuts across the fields of computational chemistry, biology, medicine, engineering and applied mathematics is how proteins fold. Global and local optimization provide a systematic framework of conformational searches for the prediction of three-dimensional protein structures that represent the global minimum free energy, as well as low-energy biomolecular conformations. Each contribution in the book is essentially expository in nature, but of scholarly treatment. The topics covered include advances in local and global optimization approaches for molecular dynamics and modeling, distance geometry, protein folding, molecular structure refinement, protein and drug design, and molecular and peptide docking. Audience: The book is addressed not only to researchers in mathematical programming, but to all scientists in various disciplines who use optimization methods in solving problems in computational chemistry and biology.

The numerical optimization of practical applications has been an issue of major importance for the last 10 years. It allows us to explore reliable non-trivial configurations, differing widely from all known solutions. The purpose of this book is to introduce the state-of-the-art concerning this issue and many complementary applications are presented.

In mathematics and computer science, an optimisation problem is the problem of finding the best solution from all feasible solutions. Computational optimisation is crucial in many fields of science and technology as well as in finance, business and medicine. This new book presents state-of-the-art research in the field.

During the last decades the globalisation of financial markets, the intensifying competition as well as the rapid economic, social and technological changes, have led to an increasing uncertainty and instability in the financial and business environments. This new context has given a new rise to the role of economics and finance for the operation of firms and organisations. The contents of this volume cover a wide range of topics, including among others stock market applications, banking management, corporate performance, as well as macroeconomic issues.

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.

Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes. This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.