Networks of Learning Automata: Techniques for Online Stochastic Optimization is a comprehensive account of learning automata models with emphasis on multiautomata systems. It considers synthesis of complex learning structures from simple building blocks and uses stochastic algorithms for refining probabilities of selecting actions. Mathematical analysis of the behavior of games and feedforward networks is provided. Algorithms considered here can be used for online optimization of systems based on noisy measurements of performance index. Also, algorithms that assure convergence to the global optimum are presented. Parallel operation of automata systems for improving speed of convergence is described. The authors also include extensive discussion of how learning automata solutions can be constructed in a variety of applications.

This textbook provides a comprehensive and instructive coverage of vehicular traffic flow dynamics and modeling. It makes this fascinating interdisciplinary topic, which to date was only documented in parts by specialized monographs, accessible to a broad readership. Numerous figures and problems with solutions help the reader to quickly understand and practice the presented concepts. This book is targeted at students of physics and traffic engineering and, more generally, also at students and professionals in computer science, mathematics, and interdisciplinary topics. It also offers material for project work in programming and simulation at college and university level. The main part, after presenting different categories of traffic data, is devoted to a mathematical description of the dynamics of traffic flow, covering macroscopic models which describe traffic in terms of density, as well as microscopic many-particle models in which each particle corresponds to a vehicle and its driver. Focus chapters on traffic instabilities and model calibration/validation present these topics in a novel and systematic way. Finally, the theoretical framework is shown at work in selected applications such as traffic-state and travel-time estimation, intelligent transportation systems, traffic operations management, and a detailed physics-based model for fuel consumption and emissions.

Transnational Cooperation: An Issue-Based Approach presents an analysis of transnational cooperation or collective action that stresses basic concepts and intuition. Throughout the book, authors Clint Peinhardt and Todd Sandler identify factors that facilitate and/or inhibit such cooperation. The first four chapters lay the analytical foundations for the book, while the next nine chapters apply the analysis to a host of exigencies and topics of great import. The authors use elementary game theory as a tool for illustrating the ideas put forth in the text. Game theory reminds us that rational actors (for example, countries, firms, or individuals) must account for the responses by other rational actors. The book assumes no prior knowledge of game theory; all game-theoretic concepts and analyses are explained in detail to the reader. Peinhardt and Sandler also employ paired comparisons in illustrating the book's concepts. The book is rich in applications and covers a wide range of topics, including superbugs, civil wars, money laundering, financial crises, drug trafficking, terrorism, global health concerns, international trade liberalization, acid rain, leadership, sovereignty, and many others. Students, researchers, and policymakers alike have much to gain from Transnational Cooperation. It is a crossover book for economics, political science, and public policy.

OndrejMajer, Ahti-VeikkoPietarinen, andTeroTulenheimo 1 Games and logic in philosophy Recent years have witnessed a growing interest in the unifying methodo- gies over what have been perceived as pretty disparate logical 'systems', or else merely an assortment of formal and mathematical 'approaches' to phi- sophical inquiry. This development has largely been fueled by an increasing dissatisfaction to what has earlier been taken to be a straightforward outcome of 'logical pluralism' or 'methodological diversity'. These phrases appear to re ect the everyday chaos of our academic pursuits rather than any genuine attempt to clarify the general principles underlying the miscellaneous ways in which logic appears to us. But the situation is changing. Unity among plurality is emerging in c- temporary studies in logical philosophy and neighbouring disciplines. This is a necessary follow-up to the intensive research into the intricacies of logical systems and methodologies performed over the recent years. The present book suggests one such peculiar but very unrestrained meth- ological perspective over the eld of logic and its applications in mathematics, language or computation: games. An allegory for opposition, cooperation and coordination, games are also concrete objects of formal study.

Current and historical research methods in approximation theory are presented in this book beginning with the 1800s and following the evolution of approximation theory via the refinement and extension of classical methods and ending with recent techniques and methodologies. Graduate students, postdocs, and researchers in mathematics, specifically those working in the theory of functions, approximation theory, geometric function theory, and optimization will find new insights as well as a guide to advanced topics. The chapters in this book are grouped into four themes; the first, polynomials (Chapters 1 -8), includes inequalities for polynomials and rational functions, orthogonal polynomials, and location of zeros. The second, inequalities and extremal problems are discussed in Chapters 9 -13. The third, approximation of functions, involves the approximants being polynomials, rational functions, and other types of functions and are covered in Chapters 14 -19. The last theme, quadrature, cubature and applications, comprises the final three chapters and includes an article coauthored by Rahman. This volume serves as a memorial volume to commemorate the distinguished career of Qazi Ibadur Rahman (1934-2013) of the Universite de Montreal. Rahman was considered by his peers as one of the prominent experts in analytic theory of polynomials and entire functions. The novelty of his work lies in his profound abilities and skills in applying techniques from other areas of mathematics, such as optimization theory and variational principles, to obtain final answers to countless open problems.

Sustainable development within urban and rural areas, transportation systems, logistics, supply chain management, urban health, social services, and architectural design are taken into consideration in the cohesive network models provided in this book. The ideas, methods, and models presented consider city landscapes and quality of life conditions based on mathematical network models and optimization. Interdisciplinary Works from prominent researchers in mathematical modeling, optimization, architecture, engineering, and physics are featured in this volume to promote health and well-being through design. Specific topics include: - Current technology that form the basis of future living in smart cities - Interdisciplinary design and networking of large-scale urban systems - Network communication and route traffic optimization - Carbon dioxide emission reduction - Closed-loop logistics chain management and operation - Modeling the effect urban environments on aging - Health care infrastructure - Urban water system management - Architectural design optimization Graduate students and researchers actively involved in architecture, engineering, building physics, logistics, supply chain management, and mathematical optimization will find the interdisciplinary work presented both informative and inspiring for further research.

Various imperfections in existing market systems prevent the free market from serving as a truly efficient allocation mechanism, but optimization of economic activities provides an effective remedial measure. Cooperative optimization claims that socially optimal and individually rational solutions to decision problems involving strategic action over time exist. To ensure that cooperation will last throughout the agreement period, however, the stringent condition of subgame consistency is required.

This textbook presents a study of subgame consistent economic optimization, developing game-theoretic optimization techniques to establish the foundation for an effective policy menu to tackle the suboptimal behavior that the conventional market mechanism fails to resolve.

This successful book provides in its second edition an interactive and illustrative guide from two-dimensional curve fitting to multidimensional clustering and machine learning with neural networks or support vector machines. Along the way topics like mathematical optimization or evolutionary algorithms are touched. All concepts and ideas are outlined in a clear cut manner with graphically depicted plausibility arguments and a little elementary mathematics.The major topics are extensively outlined with exploratory examples and applications. The primary goal is to be as illustrative as possible without hiding problems and pitfalls but to address them. The character of an illustrative cookbook is complemented with specific sections that address more fundamental questions like the relation between machine learning and human intelligence.All topics are completely demonstrated with the computing platform Mathematica and the Computational Intelligence Packages (CIP), a high-level function library developed with Mathematica's programming language on top of Mathematica's algorithms. CIP is open-source and the detailed code used throughout the book is freely accessible.The target readerships are students of (computer) science and engineering as well as scientific practitioners in industry and academia who deserve an illustrative introduction. Readers with programming skills may easily port or customize the provided code. "'From curve fitting to machine learning' is ... a useful book. ... It contains the basic formulas of curve fitting and related subjects and throws in, what is missing in so many books, the code to reproduce the results.All in all this is an interesting and useful book both for novice as well as expert readers. For the novice it is a good introductory book and the expert will appreciate the many examples and working code". Leslie A. Piegl (Review of the first edition, 2012).

Econometric theory, as presented in textbooks and the econometric literature generally, is a somewhat disparate collection of findings. Its essential nature is to be a set of demonstrated results that increase over time, each logically based on a specific set of axioms or assumptions, yet at every moment, rather than a finished work, these inevitably form an incomplete body of knowledge. The practice of econometric theory consists of selecting from, applying, and evaluating this literature, so as to test its applicability and range. The creation, development, and use of computer software has led applied economic research into a new age. This book describes the history of econometric computation from 1950 to the present day, based upon an interactive survey involving the collaboration of the many econometricians who have designed and developed this software. It identifies each of the econometric software packages that are made available to and used by economists and econometricians worldwide.

Column Generation is an insightful overview of the state-of-the-art in integer programming column generation and its many applications. The volume begins with "A Primer in Column Generation" which outlines the theory and ideas necessary to solve large-scale practical problems, illustrated with a variety of examples. Other chapters follow this introduction on "Shortest Path Problems with Resource Constraints," "Vehicle Routing Problem with Time Window," "Branch-and-Price Heuristics," "Cutting Stock Problems," each dealing with methodological aspects of the field. Three chapters deal with transportation applications: "Large-scale Models in the Airline Industry," "Robust Inventory Ship Routing by Column Generation," and "Ship Scheduling with Recurring Visits and Visit Separation Requirements." Production is the focus of another three chapters: "Combining Column Generation and Lagrangian Relaxation," "Dantzig-Wolfe Decomposition for Job Shop Scheduling," and "Applying Column Generation to Machine Scheduling." The final chapter by FranAois Vanderbeck, "Implementing Mixed Integer Column Generation," reviews how to set-up the Dantzig-Wolfe reformulation, adapt standard MIP techniques to the column generation context (branching, preprocessing, primal heuristics), and deal with specific column generation issues (initialization, stabilization, column management strategies).

The book is the first systematic treatment of column generation methodologies. It will provide students, researchers, and experienced column generation users with a much-needed state-of-the-art survey of the field.

This book features contributions from the GTM 2020 International Meeting on Game Theory held virtually from St. Petersburg, Russia, including presentations by plenary speakers. The topics cover a wide range of game-theoretic models and include both theory and applications, including applications to management.

This book opens the door to multiobjective optimization for students in fields such as engineering, management, economics and applied mathematics. It offers a comprehensive introduction to multiobjective optimization, with a primary emphasis on multiobjective linear programming and multiobjective integer/mixed integer programming. A didactic book, it is mainly intended for undergraduate and graduate students, but can also be useful for researchers and practitioners. Further, it is accompanied by an interactive software package - developed by the authors for Windows platforms - which can be used for teaching and decision-making support purposes in multiobjective linear programming problems. Thus, besides the textbook's coverage of the essential concepts, theory and methods, complemented with illustrative examples and exercises, the computational tool enables students to experiment and enhance their technical skills, as well as to capture the essential characteristics of real-world problems.

This book introduces several topics related to linear model theory: multivariate linear models, discriminant analysis, principal components, factor analysis, time series in both the frequency and time domains, and spatial data analysis. The second edition adds new material on nonparametric regression, response surface maximization, and longitudinal models. The book provides a unified approach to these disparate subject and serves as a self-contained companion volume to the author's Plane Answers to Complex Questions: The Theory of Linear Models. Ronald Christensen is Professor of Statistics at the University of New Mexico. He is well known for his work on the theory and application of linear models having linear structure. He is the author of numerous technical articles and several books and he is a Fellow of the American Statistical Association and the Institute of Mathematical Statistics. Also Available: Christensen, Ronald. Plane Answers to Complex Questions: The Theory of Linear Models, Second Edition (1996). New York: Springer-Verlag New York, Inc. Christensen, Ronald. Log-Linear Models and Logistic Regression, Second Edition (1997). New York: Springer-Verlag New York, Inc.

Arguably, many industrial optimization problems are of the multiobjective type. The present work, after providing a survey of the state of the art in multiobjective optimization, gives new insight into this important mathematical field by consequently taking up the viewpoint of differential geometry. This approach, unprecedented in the literature, very naturally results in a generalized homotopy method for multiobjective optimization which is theoretically well-founded and numerically efficient. The power of the new method is demonstrated by solving two real-life problems of industrial optimization.
The book presents recent results obtained by the author and is aimed at mathematicians, scientists, students and practitioners interested in optimization and numerical homotopy methods.

This book treats extensive form game theory in full generality. It provides a framework that does not rely on any finiteness assumptions at all, yet covers the finite case. The presentation starts by identifying the appropriate concept of a game tree. This concept represents a synthesis of earlier approaches, including the graph-theoretical and the decision-theoretical ones. It then provides a general model of sequential, interpersonal decision making, called extensive decision problems. Extensive forms are a special case thereof, which is such that all strategy profiles induce outcomes and do so uniquely. Requiring the existence of immediate predecessors yields discrete extensive forms, which are still general enough to cover almost all applications. The treatment culminates in a characterization of the topologies on the plays of the game tree that admit equilibrium analysis.

This book offers a first course in analysis for scientists and engineers. It can be used at the advanced undergraduate level or as part of the curriculum in a graduate program. The book is built around metric spaces. In the first three chapters, the authors lay the foundational material and cover the all-important "four-C's": convergence, completeness, compactness, and continuity. In subsequent chapters, the basic tools of analysis are used to give brief introductions to differential and integral equations, convex analysis, and measure theory. The treatment is modern and aesthetically pleasing. It lays the groundwork for the needs of classical fields as well as the important new fields of optimization and probability theory.

This book gathers carefully selected works in Mathematical Economics, on myriad topics including General Equilibrium, Game Theory, Economic Growth, Welfare, Social Choice Theory, Finance. It sheds light on the ongoing discussions that have brought together leading researchers from Latin America and Southern Europe at recent conferences in venues like Porto, Portugal; Athens, Greece; and Guanajuato, Mexico. With this volume, the editors not only contribute to the advancement of research in these areas, but also inspire other scholars around the globe to collaborate and research these vibrant, emerging topics.

This book will serve as a reference, presenting state-of-the-art research on theoretical aspects of optimal sensor coverage problems. Readers will find it a useful tool for furthering developments on theory and applications of optimal coverage; much of the content can serve as material for advanced topics courses at the graduate level. The book is well versed with the hottest research topics such as Lifetime of Coverage, Weighted Sensor Cover, k-Coverage, Heterogeneous Sensors, Barrier, Sweep and Partial Coverage, Mobile Sensors, Camera Sensors and Energy-Harvesting Sensors, and more. Topics are introduced in a natural order from simple covers to connected covers, to the lifetime problem. Later, the book begins revisiting earlier problems ranging from the introduction of weights to coverage by k sensors and partial coverage, and from sensor heterogeneity to novel problems such as the barrier coverage problem. The book ends with coverage of mobile sensors, camera sensors, energy-harvesting sensors, underwater sensors, and crowdsensing.

This book focuses on metaheuristic methods and its applications to real-world problems in Engineering. The first part describes some key metaheuristic methods, such as Bat Algorithms, Particle Swarm Optimization, Differential Evolution, and Particle Collision Algorithms. Improved versions of these methods and strategies for parameter tuning are also presented, both of which are essential for the practical use of these important computational tools. The second part then applies metaheuristics to problems, mainly in Civil, Mechanical, Chemical, Electrical, and Nuclear Engineering. Other methods, such as the Flower Pollination Algorithm, Symbiotic Organisms Search, Cross-Entropy Algorithm, Artificial Bee Colonies, Population-Based Incremental Learning, Cuckoo Search, and Genetic Algorithms, are also presented. The book is rounded out by recently developed strategies, or hybrid improved versions of existing methods, such as the Lightning Optimization Algorithm, Differential Evolution with Particle Collisions, and Ant Colony Optimization with Dispersion - state-of-the-art approaches for the application of computational intelligence to engineering problems. The wide variety of methods and applications, as well as the original results to problems of practical engineering interest, represent the primary differentiation and distinctive quality of this book. Furthermore, it gathers contributions by authors from four countries - some of which are the original proponents of the methods presented - and 18 research centers around the globe.

This monograph presents a comprehensive study of portfolio optimization, an important area of quantitative finance. Considering that the information available in financial markets is incomplete and that the markets are affected by vagueness and ambiguity, the monograph deals with fuzzy portfolio optimization models. At first, the book makes the reader familiar with basic concepts, including the classical mean-variance portfolio analysis. Then, it introduces advanced optimization techniques and applies them for the development of various multi-criteria portfolio optimization models in an uncertain environment. The models are developed considering both the financial and non-financial criteria of investment decision making, and the inputs from the investment experts. The utility of these models in practice is then demonstrated using numerical illustrations based on real-world data, which were collected from one of the premier stock exchanges in India. The book addresses both academics and professionals pursuing advanced research and/or engaged in practical issues in the rapidly evolving field of portfolio optimization.

This book presents recent advances on the design of intelligent systems based on fuzzy logic, neural networks and nature-inspired optimization and their application in areas such as, intelligent control and robotics, pattern recognition, time series prediction and optimization of complex problems. The book is organized in eight main parts, which contain a group of papers around a similar subject. The first part consists of papers with the main theme of theoretical aspects of fuzzy logic, which basically consists of papers that propose new concepts and algorithms based on fuzzy systems. The second part contains papers with the main theme of neural networks theory, which are basically papers dealing with new concepts and algorithms in neural networks. The third part contains papers describing applications of neural networks in diverse areas, such as time series prediction and pattern recognition. The fourth part contains papers describing new nature-inspired optimization algorithms. The fifth part presents diverse applications of nature-inspired optimization algorithms. The sixth part contains papers describing new optimization algorithms. The seventh part contains papers describing applications of fuzzy logic in diverse areas, such as time series prediction and pattern recognition. Finally, the eighth part contains papers that present enhancements to meta-heuristics based on fuzzy logic techniques.

Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.

This book covers various topics regarding the design of compliant mechanisms using topology optimization that have attracted a great deal of attention in recent decades. After comprehensively describing state-of-the-art methods for designing compliant mechanisms, it provides a new topology optimization method for finding new flexure hinges. It then presents several attempts to obtain distributed compliant mechanisms using the topology optimization method. Further, it discusses a Jacobian-based topology optimization method for compliant parallel mechanisms, and introduces readers to the topology optimization of compliant mechanisms, taking into account geometrical nonlinearity and reliability. Providing a systematic method for topology optimization of flexure hinges, which are essential for designing compliant mechanisms, the book offers a valuable resource for all readers who are interested in designing compliant mechanism-based positioning stages. In addition, the methods for solving the de facto hinges in topology optimized compliant mechanisms will benefit all engineers seeking to design micro-electro-mechanical system (MEMS) structures.

This book provides a full-scale presentation of all methods and techniques available for the solution of the Knapsack problem. This most basic combinatorial optimization problem appears explicitly or as a subproblem in a wide range of optimization models with backgrounds such diverse as cutting and packing, finance, logistics or general integer programming. This monograph spans the range from a comprehensive introduction of classical algorithmic methods to the unified presentation of the most recent and advanced results in this area many of them originating from the authors. The chapters dealing with particular versions and extensions of the Knapsack problem are self-contained to a high degree and provide a valuable source of reference for researchers. Due to its simple structure, the Knapsack problem is an ideal model for introducing solution techniques to students of computer science, mathematics and economics. The first three chapters give an in-depth treatment of several basic techniques, making the book also suitable as underlying literature for courses in combinatorial optimization and approximation.