This book provides a literature review of techniques used to pass from continuous to combinatorial space, before discussing a detailed example with individual steps of how cuckoo search (CS) can be adapted to solve combinatorial optimization problems. It demonstrates the application of CS to three different problems and describes their source code. The content is divided into five chapters, the first of which provides a technical description, together with examples of combinatorial search spaces. The second chapter summarizes a diverse range of methods used to solve combinatorial optimization problems. In turn, the third chapter presents a description of CS, its formulation and characteristics. In the fourth chapter, the application of discrete cuckoo search (DCS) to solve three POCs (the traveling salesman problem, quadratic assignment problem and job shop scheduling problem) is explained, focusing mainly on a reinterpretation of the terminology used in CS and its source of inspiration. In closing, the fifth chapter discusses random-key cuckoo search (RKCS) using random keys to represent positions found by cuckoo search in the TSP and QAP solution space.

This book addresses the frontier advances in the theory and application of nature-inspired optimization techniques, including solving the quadratic assignment problem, prediction in nature-inspired dynamic optimization, the lion algorithm and its applications, optimizing the operation scheduling of microgrids, PID controllers for two-legged robots, optimizing crane operating times, planning electrical energy distribution systems, automatic design and evaluation of classification pipelines, and optimizing wind-energy power generation plants. The book also presents a variety of nature-inspired methods and illustrates methods of adapting these to said applications. Nature-inspired computation, developed by mimicking natural phenomena, makes a significant contribution toward the solution of non-convex optimization problems that normal mathematical optimizers fail to solve. As such, a wide range of nature-inspired computing approaches has been used in multidisciplinary engineering applications. Written by researchers and developers from a variety of fields, this book presents the latest findings, novel techniques and pioneering applications.

In this book, different quantitative approaches to the study of electoral systems have been developed: game-theoretic, decision-theoretic, statistical, probabilistic, combinatorial, geometric, and optimization ones. All the authors are prominent scholars from these disciplines. Quantitative approaches offer a powerful tool to detect inconsistencies or poor performance in actual systems. Applications to concrete settings such as EU, American Congress, regional, and committee voting are discussed.

This book provides a timely and comprehensive overview of current theories and methods in fuzzy logic, as well as relevant applications in a variety of fields of science and technology. Dedicated to Lotfi A. Zadeh on his one year death anniversary, the book goes beyond a pure commemorative text. Yet, it offers a fresh perspective on a number of relevant topics, such as computing with words, theory of perceptions, possibility theory, and decision-making in a fuzzy environment. Written by Zadeh's closest colleagues and friends, the different chapters are intended both as a timely reference guide and a source of inspiration for scientists, developers and researchers who have been dealing with fuzzy sets or would like to learn more about their potential for their future research.

This book introduces research presented at the "International Conference on Artificial Intelligence: Advances and Applications-2019 (ICAIAA 2019)," a two-day conference and workshop bringing together leading academicians, researchers as well as students to share their experiences and findings on all aspects of engineering applications of artificial intelligence. The book covers research in the areas of artificial intelligence, machine learning, and deep learning applications in health care, agriculture, business and security. It also includes research in core concepts of computer networks, intelligent system design and deployment, real-time systems, WSN, sensors and sensor nodes, SDN and NFV. As such it is a valuable resource for students, academics and practitioners in industry working on AI applications.

Solving nonsmooth optimization (NSO) problems is critical in many practical applications and real-world modeling systems. The aim of this book is to survey various numerical methods for solving NSO problems and to provide an overview of the latest developments in the field. Experts from around the world share their perspectives on specific aspects of numerical NSO. The book is divided into four parts, the first of which considers general methods including subgradient, bundle and gradient sampling methods. In turn, the second focuses on methods that exploit the problem's special structure, e.g. algorithms for nonsmooth DC programming, VU decomposition techniques, and algorithms for minimax and piecewise differentiable problems. The third part considers methods for special problems like multiobjective and mixed integer NSO, and problems involving inexact data, while the last part highlights the latest advancements in derivative-free NSO. Given its scope, the book is ideal for students attending courses on numerical nonsmooth optimization, for lecturers who teach optimization courses, and for practitioners who apply nonsmooth optimization methods in engineering, artificial intelligence, machine learning, and business. Furthermore, it can serve as a reference text for experts dealing with nonsmooth optimization.

This book describes optimization models of clustering problems and clustering algorithms based on optimization techniques, including their implementation, evaluation, and applications. The book gives a comprehensive and detailed description of optimization approaches for solving clustering problems; the authors' emphasis on clustering algorithms is based on deterministic methods of optimization. The book also includes results on real-time clustering algorithms based on optimization techniques, addresses implementation issues of these clustering algorithms, and discusses new challenges arising from big data. The book is ideal for anyone teaching or learning clustering algorithms. It provides an accessible introduction to the field and it is well suited for practitioners already familiar with the basics of optimization.

This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018. The conference brought together scientists, engineers, and researchers from academia, industry, and government. Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, computer science, and engineering find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, and biclustering algorithms are presented with applications to social network analysis.

This book provides an introduction to the models, methods, and results of some due date-related scheduling problems in the field of multiagent scheduling. In multiagent scheduling, two or more agents share a common processing resource and each agent wants to optimize its own objective function with respect to its own set of jobs. Since the agents have conflicting objective functions, they have to negotiate among themselves with regard to sharing the common resource to optimize their own objective functions. A key feature of due date-related scheduling concerns the way in which due dates are considered: they can be given parameters or decision variables. For the former case, the motivation stems from the need to improve inventory and production management. For the latter case, due date assignment becomes a challenging issue since the decision-maker has to balance inventory holding costs against the benefits of fulfifilling orders in time. As for due dates, this book addresses the following three different scenarios: (i) The due dates of the jobs from either one or both of the two agents are decision variables, which are determined using some due date assignment models; (ii) The due dates of jobs in each job set are considered as given parameters, whereas which due date corresponds to a given job needs to determine; and (iii) The due date of each job is exogenously given. When the last case is involved, the objective function of each agent is related to the number of just-in-time jobs that are completed exactly on their due dates. For each considered scenario, depending on the model settings, and on the objective function of each agent, this book addresses the complexity, and the design of efficient exact or approximated algorithms. This book aims at introducing the author's research achievements in due date-related scheduling with two agents. It is written for researchers and Ph.D. students working in scheduling theory and other members of scientific community who are interested in recent scheduling models. Our goal is to enable the reader to know about some new achievements on this topic.

This book explores applications of computational intelligence in key and emerging fields of engineering, especially with regard to condition monitoring and fault diagnosis, inverse problems, decision support systems and optimization. These applications can be beneficial in a broad range of contexts, including: water distribution networks, manufacturing systems, production and storage of electrical energy, heat transfer, acoustic levitation, uncertainty and robustness of infinite-dimensional objects, fatigue failure prediction, autonomous navigation, nanotechnology, and the analysis of technological development indexes. All applications, mathematical and computational tools, and original results are presented using rigorous mathematical procedures. Further, the book gathers contributions by respected experts from 22 different research centers and eight countries: Brazil, Cuba, France, Hungary, India, Japan, Romania and Spain. The book is intended for use in graduate courses on applied computation, applied mathematics, and engineering, where tools like computational intelligence and numerical methods are applied to the solution of real-world problems in emerging areas of engineering.

This book focuses on the design of efficient & dynamic methods to allocate divisible resources under various auction mechanisms, discussing their applications in power & microgrid systems and the V2G & EV charging coordination problems in smart grids. It describes the design of dynamic methods for single-sided and double-sided auction games and presents a number of simulation cases verifying the performances of the proposed algorithms in terms of efficiency, convergence and computational complexity. Further, it explores the performances of certain auction mechanisms in a hierarchical structure and with large-scale agents, as well as the auction mechanisms for the efficient allocation of multi-type resources. Lastly, it generalizes the main and demonstrates their application in smart grids. This book is a valuable resource for researchers, engineers, and graduate students in the fields of optimization, game theory, auction mechanisms and smart grids interested in designing dynamic auction mechanisms to implement optimal allocation of divisible resources, especially electricity and other types of energy in smart grids.

This book presents the best papers from the 1st International Conference on Mathematical Research for Blockchain Economy (MARBLE) 2019, held in Santorini, Greece. While most blockchain conferences and forums are dedicated to business applications, product development or Initial Coin Offering (ICO) launches, this conference focused on the mathematics behind blockchain to bridge the gap between practice and theory. Every year, thousands of blockchain projects are launched and circulated in the market, and there is a tremendous wealth of blockchain applications, from finance to healthcare, education, media, logistics and more. However, due to theoretical and technical barriers, most of these applications are impractical for use in a real-world business context. The papers in this book reveal the challenges and limitations, such as scalability, latency, privacy and security, and showcase solutions and developments to overcome them.

This book focuses on the latest advances in nonlinear dynamic modeling in economics and finance, mainly-but not solely-based on the description of strategic interaction by using concepts and methods from dynamic and evolutionary game theory. The respective chapters cover a range of theoretical issues and examples concerning how the qualitative theory of dynamical systems is used to analyze the local and global bifurcations that characterize complex behaviors observed in social systems where heterogeneous and boundedly rational economic agents interact. Nonlinear dynamical systems, represented by difference and differential and functional equations, are extensively used to simulate the behavior of time-evolving economic systems, also in the presence of time lags, discontinuities, and hysteresis phenomena. In addition, some theoretical issues and particular applications are discussed, as well. The contributions gathered here offer an up-to-date review of the latest research in this rapidly developing research area.

Gathering the proceedings of the 12th CHAOS2019 International Conference, this book highlights recent developments in nonlinear, dynamical and complex systems. The conference was intended to provide an essential forum for Scientists and Engineers to exchange ideas, methods, and techniques in the field of Nonlinear Dynamics, Chaos, Fractals and their applications in General Science and the Engineering Sciences. The respective chapters address key methods, empirical data and computer techniques, as well as major theoretical advances in the applied nonlinear field. Beyond showcasing the state of the art, the book will help academic and industrial researchers alike apply chaotic theory in their studies.

Master the design and operation of perfusion cell cultures with this authoritative reference. Discover the current state-of-the-art in the design and operation of continuous bioreactors, with emphasis on mammalian cell cultures for producing therapeutic proteins. Topics include the current market for recombinant therapeutic proteins, current industry challenges and the potential contribution of continuous manufacturing. Provides coverage of every step of process development and reactor operation, including small scale screening to lab-scale and scale-up to manufacturing scale. Illustrated through real-life case studies, this is a perfect resource for groups active in the cell culture field, as well as graduate students in areas such as chemical engineering, biotechnology, chemistry and biology, and to those in the pharmaceutical industry, particularly biopharma, biotechnology and food or agro industry.

This edited book focuses on non-classical logics and their applications, highlighting the rapid advances and the new perspectives that are emerging in this area. Non-classical logics are logical formalisms that violate or go beyond classical logic laws, and their specific features make them particularly suited to describing and reason about aspects of social interaction. The richness and diversity of non-classical logics mean that this area is a natural catalyst for ideas and insights from many different fields, from information theory to game theory and business science. This volume is the post-proceedings of the 8th International Conference on Logic and Cognition, held at Sun Yat-Sen University Institute of Logic and Cognition (ILC) in Guangzhou, China in December 2016. The conference series started in 2001, and is organized by the ILC, often in collaboration with various international research groups. This eighth installment was jointly organized by ILC and Alessandra Palmigiano's Applied Logic research group. The conference series aims to foster the development of effective logical tools to study social behavior from a philosophical, cognitive and formal perspective in order to challenge the field of logic in ways that open up new and exciting research directions. Chapter "The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms" of this book is available open access under a CC BY 4.0 license at link.springer.com

This is the first book to provide a comprehensive and systematic introduction to the ranking methods for interval-valued intuitionistic fuzzy sets, multi-criteria decision-making methods with interval-valued intuitionistic fuzzy sets, and group decision-making methods with interval-valued intuitionistic fuzzy preference relations. Including numerous application examples and illustrations with tables and figures and presenting the authors' latest research developments, it is a valuable resource for researchers and professionals in the fields of fuzzy mathematics, operations research, information science, management science and decision analysis.

This handbook gathers state-of-the-art research on optimization problems in power distribution systems, covering classical problems as well as the challenges introduced by distributed power generation and smart grid resources. It also presents recent models, solution techniques and computational tools to solve planning problems for power distribution systems and explains how to apply them in distributed and variable energy generation resources. As such, the book therefore is a valuable tool to leverage the expansion and operation planning of electricity distribution networks.

This is the first book that comprehensively analyses co-patenting in Japan and the U.S., which directly signifies collaborations between firms and inventors, using the methodology of network science. Network science approaches enable us to analyse the structures of co-patenting networks. In addition, generative models in network science estimate the probability of new connections between nodes, which enables us to discuss the temporal development of networks. On the other hand, regression analyses, which are broadly used in the field of economics, may be effective for determining what attributes are important for firms and inventors that are going to be connected, but such techniques cannot consider the complexity of networks. This book compiles a series of studies by the author on geographical location and co-patenting using data that were published in eight academic journal articles. This book gives the reader ideas about how we can utilize patent data to understand how firms and inventors collaborate under the effect of complex networks.

This book is an exploration of the ubiquity of ambiguity in decision-making under uncertainty. It presents various essays on behavioral economics and behavioral finance that draw on the theory of Black Swans (Taleb 2010), which argues for a distinction between unprecedented events in our past and unpredictable events in our future. The defining property of Black Swan random events is that they are unpredictable, i.e., highly unlikely random events. In this text, Mandelbrot's (1972) operational definition of risky random unpredictable events is extended to Black Swan assets - assets for which the cumulative probability distribution or conditional probability distribution of random future asset returns is a power distribution. Ambiguous assets are assets for which the uncertainties of future returns are not risks. Consequently, there are two disjoint classes of Black Swan assets: Risky Black Swan assets and Ambiguous Black Swan assets, a new class of ambiguous assets with unpredictable random future outcomes. The text is divided into two parts, the first of which focuses on affective moods, introduces affective utility functions and discusses the ambiguity of Black Swans. The second part, which shifts the spotlight to affective equilibrium in asset markets, features chapters on affective portfolio analysis and Walrasian and Gorman Polar Form Equilibrium Inequalities. In order to gain the most from the book, readers should have completed the standard introductory graduate courses on microeconomics, behavioral finance, and convex optimization. The book is intended for advanced undergraduates, graduate students and post docs specializing in economic theory, experimental economics, finance, mathematics, computer science or data analysis.

This book provides an essential introduction to Stochastic Programming, especially intended for graduate students. The book begins by exploring a linear programming problem with random parameters, representing a decision problem under uncertainty. Several models for this problem are presented, including the main ones used in Stochastic Programming: recourse models and chance constraint models. The book not only discusses the theoretical properties of these models and algorithms for solving them, but also explains the intrinsic differences between the models. In the book's closing section, several case studies are presented, helping students apply the theory covered to practical problems. The book is based on lecture notes developed for an Econometrics and Operations Research course for master students at the University of Groningen, the Netherlands - the longest-standing Stochastic Programming course worldwide.

Describes how evolutionary algorithms (EAs) can be used to identify, model, and minimize day-to-day problems that arise for researchers in optimization and mobile networking

Mobile ad hoc networks (MANETs), vehicular networks (VANETs), sensor networks (SNs), and hybrid networks--each of these require a designer's keen sense and knowledge of evolutionary algorithms in order to help with the common issues that plague professionals involved in optimization and mobile networking.

This book introduces readers to both mobile ad hoc networks and evolutionary algorithms, presenting basic concepts as well as detailed descriptions of each. It demonstrates how metaheuristics and evolutionary algorithms (EAs) can be used to help provide low-cost operations in the optimization process--allowing designers to put some "intelligence" or sophistication into the design. It also offers efficient and accurate information on dissemination algorithms, topology management, and mobility models to address challenges in the field.

"Evolutionary Algorithms for Mobile Ad Hoc Networks" Instructs on how to identify, model, and optimize solutions to problems that arise in daily researchPresents complete and up-to-date surveys on topics like network and mobility simulatorsProvides sample problems along with solutions/descriptions used to solve each, with performance comparisonsCovers current, relevant issues in mobile networks, like energy use, broadcasting performance, device mobility, and more

"Evolutionary Algorithms for Mobile Ad Hoc Networks" is an ideal book for researchers and students involved in mobile networks, optimization, advanced search techniques, and multi-objective optimization.

Written by an international group of active researchers in the field, this volume presents innovative formulations and applied procedures for sensitivity analysis and structural design optimization. Eight chapters discuss subjects ranging from recent developments in the determination and application of topological gradients, to the use of evolutionary algorithms and meta-models to solve practical engineering problems. With such a comprehensive set of contributions, the book is a valuable source of information for graduate students and researchers entering or working in the matter.

Reactive Search and Intelligent Optimization is an excellent introduction to the main principles of reactive search, as well as an attempt to develop some fresh intuition for the approaches. The book looks at different optimization possibilities with an emphasis on opportunities for learning and self-tuning strategies. While focusing more on methods than on problems, problems are introduced wherever they help make the discussion more concrete, or when a specific problem has been widely studied by reactive search and intelligent optimization heuristics. Individual chapters cover reacting on the neighborhood; reacting on the annealing schedule; reactive prohibitions; model-based search; reacting on the objective function; relationships between reactive search and reinforcement learning; and much more. Each chapter is structured to show basic issues and algorithms; the parameters critical for the success of the different methods discussed; and opportunities for the automated tuning of these parameters.

This book is focused on the discussion of the traffic assignment problem, the mathematical and practical meaning of variables, functions and basic principles. This work gives information about new approaches, methods and algorithms based on original methodological technique, developed by authors in their publications for the past several years, as well as corresponding prospective implementations. The book may be of interest to a wide range of readers, such as civil engineering students, traffic engineers, developers of traffic assignment algorithms etc. The obtained results here are to be used in both practice and theory. This book is devoted to the traffic assignment problem, formulated in a form of nonlinear optimization program. The most efficient solution algorithms related to the problem are based on its structural features and practical meaning rather than on standard nonlinear optimization techniques or approaches. The authors have carefully considered the meaning of the traffic assignment problem for efficient algorithms development.