Multi Objective Optimization In Theory And Practice Ii Metaheuristic Algorithms

Multi-Objective Optimization in Theory and Practice is a simplified two-part approach to multi-objective optimization (MOO) problems. This second part focuses on the use of metaheuristic algorithms in more challenging practical cases. The book includes ten chapters that cover several advanced MOO techniques. These include the determination of Pareto-optimal sets of solutions, metaheuristic algorithms, genetic search algorithms and evolution strategies, decomposition algorithms, hybridization of different metaheuristics, and many-objective (more than three objectives) optimization and parallel computation. The final section of the book presents information about the design and types of fifty test problems for which the Pareto-optimal front is approximated. For each of them, the package NSGA-II is used to approximate the Pareto-optimal front. It is an essential handbook for students and teachers involved in advanced optimization courses in engineering, information science and mathematics degree programs.

Multi-Objective Optimization in Theory and Practice is a traditional two-part approach to solving multi-objective optimization (MOO) problems namely the use of classical methods and evolutionary algorithms. This first book is devoted to classical methods including the extended simplex method by Zeleny and preference-based techniques. This part covers three main topics through nine chapters. The first topic focuses on the design of such MOO problems, their complexities including nonlinearities and uncertainties, and optimality theory. The second topic introduces the founding solving methods including the extended simplex method to linear MOO problems and weighting objective methods. The third topic deals with particular structures of MOO problems, such as mixed-integer programming, hierarchical programming, fuzzy logic programming, and bimatrix games. Multi-Objective Optimization in Theory and Practice is a user-friendly book with detailed, illustrated calculations, examples, test functions, and small-size applications in Mathematica® (among other mathematical packages) and from scholarly literature. It is an essential handbook for students and teachers involved in advanced optimization courses in engineering, information science, and mathematics degree programs.

This book introduces the theory and applications of metaheuristic algorithms. It also provides methods for solving practical problems in such fields as software engineering, image recognition, video networks, and in the oceans. In the theoretical section, the book introduces the information feedback model, learning-based intelligent optimization, dynamic multi-objective optimization, and multi-model optimization. In the applications section, the book presents applications of optimization algorithms to neural architecture search, fuzz testing, oceans, and image processing. The neural architecture search chapter introduces the latest NAS method. The fuzz testing chapter uses multi-objective optimization and ant colony optimization to solve the seed selection and energy allocation problems in fuzz testing. In the ocean chapter, deep learning methods such as CNN, transformer, and attention-based methods are used to describe ENSO prediction and image processing for marine fish identification, and to provide an overview of traditional classification methods and deep learning methods. Rich in examples, this book will be a great resource for students, scholars, and those interested in metaheuristic algorithms, as well as professional practitioners and researchers working on related topics.

This book demonstrates the metaheuristic methodologies that apply to maximum diversity problems to solve them. Maximum diversity problems arise in many practical settings from facility location to social network analysis and constitute an important class of NP-hard problems in combinatorial optimization. In fact, this volume presents a “missing link” in the combinatorial optimization-related literature. In providing the basic principles and fundamental ideas of the most successful methodologies for discrete optimization, this book allows readers to create their own applications for other discrete optimization problems. Additionally, the book is designed to be useful and accessible to researchers and practitioners in management science, industrial engineering, economics, and computer science, while also extending value to non-experts in combinatorial optimization. Owed to the tutorials presented in each chapter, this book may be used in a master course, a doctoral seminar, or as supplementary to a primary text in upper undergraduate courses. The chapters are divided into three main sections. The first section describes a metaheuristic methodology in a tutorial style, offering generic descriptions that, when applied, create an implementation of the methodology for any optimization problem. The second section presents the customization of the methodology to a given diversity problem, showing how to go from theory to application in creating a heuristic. The final part of the chapters is devoted to experimentation, describing the results obtained with the heuristic when solving the diversity problem. Experiments in the book target the so-called MDPLIB set of instances as a benchmark to evaluate the performance of the methods.

Multi-Objective Combinatorial Optimization Problems and Solution Methods discusses the results of a recent multi-objective combinatorial optimization achievement that considered metaheuristic, mathematical programming, heuristic, hyper heuristic and hybrid approaches. In other words, the book presents various multi-objective combinatorial optimization issues that may benefit from different methods in theory and practice. Combinatorial optimization problems appear in a wide range of applications in operations research, engineering, biological sciences and computer science, hence many optimization approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic and algebraic techniques. This book covers this important topic as computational optimization has become increasingly popular as design optimization and its applications in engineering and industry have become ever more important due to more stringent design requirements in modern engineering practice. Presents a collection of the most up-to-date research, providing a complete overview of multi-objective combinatorial optimization problems and applications Introduces new approaches to handle different engineering and science problems, providing the field with a collection of related research not already covered in the primary literature Demonstrates the efficiency and power of the various algorithms, problems and solutions, including numerous examples that illustrate concepts and algorithms

Multi-objective optimization (MO) is a fast-developing field in computational intelligence research. Giving decision makers more options to choose from using some post-analysis preference information, there are a number of competitive MO techniques with an increasingly large number of MO real-world applications. Multi-Objective Optimization in Computational Intelligence: Theory and Practice explores the theoretical, as well as empirical, performance of MOs on a wide range of optimization issues including combinatorial, real-valued, dynamic, and noisy problems. This book provides scholars, academics, and practitioners with a fundamental, comprehensive collection of research on multi-objective optimization techniques, applications, and practices.

This book presents recent contributions and significant development, advanced issues, and challenges. In real-world problems and applications, most of the optimization problems involve different types of constraints. These problems are called constrained optimization problems (COPs). The optimization of the constrained optimization problems is considered a challenging task since the optimum solution(s) must be feasible. In their original design, evolutionary algorithms (EAs) are able to solve unconstrained optimization problems effectively. As a result, in the past decade, many researchers have developed a variety of constraint handling techniques, incorporated into (EAs) designs, to counter this deficiency. The main objective for this book is to make available a self-contained collection of modern research addressing the general constrained optimization problems in many real-world applications using nature-inspired optimization algorithms. This book is suitable for a graduate class on optimization, but will also be useful for interested senior students working on their research projects.

This book is the culmination of the authors’ industry-academic collaboration in the past several years. The investigation is largely motivated by bank balance sheet management problems. The main difference between a bank balance sheet management problem and a typical portfolio optimization problem is that the former involves multiple risks. The related theoretical investigation leads to a significant extension of the scope of portfolio theories. The book combines practitioners’ perspectives and mathematical rigor. For example, to guide the bank managers to trade off different Pareto efficient points, the topological structure of the Pareto efficient set is carefully analyzed. Moreover, on top of computing solutions, the authors focus the investigation on the qualitative properties of those solutions and their financial meanings. These relations, such as the role of duality, are most useful in helping bank managers to communicate their decisions to the different stakeholders. Finally, bank balance sheet management problems of varying levels of complexity are discussed to illustrate how to apply the central mathematical results. Although the primary motivation and application examples in this book are focused in the area of bank balance sheet management problems, the range of applications of the general portfolio theory is much wider. As a matter of fact, most financial problems involve multiple types of risks. Thus, the book is a good reference for financial practitioners in general and students who are interested in financial applications. This book can also serve as a nice example of a case study for applied mathematicians who are interested in engaging in industry-academic collaboration.