![]() |
![]() |
Your cart is empty |
||
Books > Science & Mathematics > Mathematics > Optimization > General
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 introduces the reader to important concepts in modern applied analysis, such as homogenization, gradient flows on metric spaces, geometric evolution, Gamma-convergence tools, applications of geometric measure theory, properties of interfacial energies, etc. This is done by tackling a prototypical problem of interfacial evolution in heterogeneous media, where these concepts are introduced and elaborated in a natural and constructive way. At the same time, the analysis introduces open issues of a general and fundamental nature, at the core of important applications. The focus on two-dimensional lattices as a prototype of heterogeneous media allows visual descriptions of concepts and methods through a large amount of illustrations.
This book is a collection of original papers presented at the International Conference on Computational Mathematics in Nanoelectronics and Astrophysics (CMNA 2018) held at the Indian Institute of Technology Indore, India, from 1 to 3 November 2018. It aims at presenting recent developments of computational mathematics in nanoelectronics, astrophysics and related areas of space sciences and engineering. These proceedings discuss the most advanced innovations, trends and real-world challenges encountered and their solutions with the application of computational mathematics in nanoelectronics, astrophysics and space sciences. From focusing on nano-enhanced smart technological developments to the research contributions of premier institutes in India and abroad on ISRO's future space explorations-this book includes topics from highly interdisciplinary areas of research. The book is of interest to researchers, students and practising engineers working in diverse areas of science and engineering, ranging from applied and computational mathematics to nanoelectronics, nanofabrications and astrophysics.
This book provides novel concepts and techniques for air traffic management (ATM) and communications, navigation, and surveillance (CNS) systems. The book consists of selected papers from the 6th ENRI International Workshop on ATM/CNS (EIWAC2019) held in Tokyo in October 2019, the theme of which was "Exploring Ideas for World Aviation Challenges". Included are key topics to realize safer and more efficient skies in the future, linked to the integrated conference theme consisting of long-term visions based on presentations from various fields. The book is dedicated not only to researchers, academicians, and university students, but also to engineers in the industry, air navigation service providers (ANSPs), and regulators of aviation.
This book presents essential concepts of traditional Flower Pollination Algorithm (FPA) and its recent variants and also its application to find optimal solution for a variety of real-world engineering and medical problems. Swarm intelligence-based meta-heuristic algorithms are extensively implemented to solve a variety of real-world optimization problems due to its adaptability and robustness. FPA is one of the most successful swarm intelligence procedures developed in 2012 and extensively used in various optimization tasks for more than a decade. The mathematical model of FPA is quite straightforward and easy to understand and enhance, compared to other swarm approaches. Hence, FPA has attracted attention of researchers, who are working to find the optimal solutions in variety of domains, such as N-dimensional numerical optimization, constrained/unconstrained optimization, and linear/nonlinear optimization problems. Along with the traditional bat algorithm, the enhanced versions of FPA are also considered to solve a variety of optimization problems in science, engineering, and medical applications.
This book focuses primarily on the nature-inspired approach for designing smart applications. It includes several implementation paradigms such as design and path planning of wireless network, security mechanism and implementation for dynamic as well as static nodes, learning method of cloud computing, data exploration and management, data analysis and optimization, decision taking in conflicting environment, etc. The book fundamentally highlights the recent research advancements in the field of engineering and science.
With the diversification of Internet services and the increase in mobile users, efficient management of network resources has become an extremely important issue in the field of wireless communication networks (WCNs). Adaptive resource management is an effective tool for improving the economic efficiency of WCN systems as well as network design and construction, especially in view of the surge in mobile device demands. This book presents modelling methods based on queueing theory and Markov processes for a wide variety of WCN systems, as well as precise and approximate analytical solution methods for the numerical evaluation of the system performance. This is the first book to provide an overview of the numerical analyses that can be gleaned by applying queueing theory, traffic theory and other analytical methods to various WCN systems. It also discusses the recent advances in the resource management of WCNs, such as broadband wireless access networks, cognitive radio networks, and green cloud computing. It assumes a basic understanding of computer networks and queueing theory, and familiarity with stochastic processes is also recommended. The analysis methods presented in this book are useful for first-year-graduate or senior computer science and communication engineering students. Providing information on network design and management, performance evaluation, queueing theory, game theory, intelligent optimization, and operations research for researchers and engineers, the book is also a valuable reference resource for students, analysts, managers and anyone in the industry interested in WCN system modelling, performance analysis and numerical evaluation.
This book includes selected peer-reviewed papers presented at the International Conference on Modeling, Simulation and Optimization, organized by National Institute of Technology, Silchar, Assam, India, during 3-5 August 2020. The book covers topics of modeling, simulation and optimization, including computational modeling and simulation, system modeling and simulation, device/VLSI modeling and simulation, control theory and applications, modeling and simulation of energy system and optimization. The book disseminates various models of diverse systems and includes solutions of emerging challenges of diverse scientific fields.
Small satellite technology is opening up a new era in space exploration offering reduced cost of launch and maintenance, operational flexibility with on-orbit reconfiguration, redundancy etc. The true power of such missions can be harnessed only from close and precise formation flying of satellites. Formation flying missions support diverse application areas such as reconnaissance, remote sensing, solar observatory, deep space observatories, etc. A key component involved in formation flying is the guidance algorithm that should account for system nonlinearities and unknown disturbances. The main focus of this book is to present various nonlinear optimal control and adaptive guidance ideas to ensure precise close formation flying in presence of such difficulties. In addition to in-depth discussion of the relevant topics, MATLAB program files for the results included are also provided for the benefit of the readers. Since this book has concise information about the various guidance techniques, it will be useful reference for researchers and practising engineers in the space field.
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.
This book presents the best papers from the 2nd International Conference on Mathematical Research for Blockchain Economy (MARBLE) 2020, held in Vilamoura, Portugal. 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. Blockchain Technology has been considered as the most fundamental and revolutionising invention since the Internet. 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 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.
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 contributed volume discusses aspects of nonlinear analysis in which optimization plays an important role, as well as topics which are applied to the study of optimization problems. Topics include set-valued analysis, mixed concave-convex sub-superlinear Schroedinger equation, Schroedinger equations in nonlinear optics, exponentially convex functions, optimal lot size under the occurrence of imperfect quality items, generalized equilibrium problems, artificial topologies on a relativistic spacetime, equilibrium points in the restricted three-body problem, optimization models for networks of organ transplants, network curvature measures, error analysis through energy minimization and stability problems, Ekeland variational principles in 2-local Branciari metric spaces, frictional dynamic problems, norm estimates for composite operators, operator factorization and solution of second-order nonlinear difference equations, degenerate Kirchhoff-type inclusion problems, and more.
This book focuses on a large class of multi-valued variational differential inequalities and inclusions of stationary and evolutionary types with constraints reflected by subdifferentials of convex functionals. Its main goal is to provide a systematic, unified, and relatively self-contained exposition of existence, comparison and enclosure principles, together with other qualitative properties of multi-valued variational inequalities and inclusions. The problems under consideration are studied in different function spaces such as Sobolev spaces, Orlicz-Sobolev spaces, Sobolev spaces with variable exponents, and Beppo-Levi spaces. A general and comprehensive sub-supersolution method (lattice method) is developed for both stationary and evolutionary multi-valued variational inequalities, which preserves the characteristic features of the commonly known sub-supersolution method for single-valued, quasilinear elliptic and parabolic problems. This method provides a powerful tool for studying existence and enclosure properties of solutions when the coercivity of the problems under consideration fails. It can also be used to investigate qualitative properties such as the multiplicity and location of solutions or the existence of extremal solutions. This is the first in-depth treatise on the sub-supersolution (lattice) method for multi-valued variational inequalities without any variational structures, together with related topics. The choice of the included materials and their organization in the book also makes it useful and accessible to a large audience consisting of graduate students and researchers in various areas of Mathematical Analysis and Theoretical Physics.
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 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 book provides an in-depth analysis of the current evolutionary clustering techniques. It discusses the most highly regarded methods for data clustering. The book provides literature reviews about single objective and multi-objective evolutionary clustering algorithms. In addition, the book provides a comprehensive review of the fitness functions and evaluation measures that are used in most of evolutionary clustering algorithms. Furthermore, it provides a conceptual analysis including definition, validation and quality measures, applications, and implementations for data clustering using classical and modern nature-inspired techniques. It features a range of proven and recent nature-inspired algorithms used to data clustering, including particle swarm optimization, ant colony optimization, grey wolf optimizer, salp swarm algorithm, multi-verse optimizer, Harris hawks optimization, beta-hill climbing optimization. The book also covers applications of evolutionary data clustering in diverse fields such as image segmentation, medical applications, and pavement infrastructure asset management.
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.
In an expanding world with limited resources, optimization and uncertainty quantification have become a necessity when handling complex systems and processes. This book provides the foundational material necessary for those who wish to embark on advanced research at the limits of computability, collecting together lecture material from leading experts across the topics of optimization, uncertainty quantification and aerospace engineering. The aerospace sector in particular has stringent performance requirements on highly complex systems, for which solutions are expected to be optimal and reliable at the same time. The text covers a wide range of techniques and methods, from polynomial chaos expansions for uncertainty quantification to Bayesian and Imprecise Probability theories, and from Markov chains to surrogate models based on Gaussian processes. The book will serve as a valuable tool for practitioners, researchers and PhD students.
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.
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.
This highly informative and carefully presented textbook introduces the general principles involved in system design and optimization as applicable to thermal systems, followed by the methods to accomplish them. It introduces contemporary techniques like Genetic Algorithms, Simulated Annealing, and Bayesian Inference in the context of optimization of thermal systems. There is a separate chapter devoted to inverse problems in thermal systems. It also contains sections on Integer Programming and Multi-Objective optimization. The linear programming chapter is fortified by a detailed presentation of the Simplex method. A major highlight of the textbook is the inclusion of workable MATLAB codes for examples of key algorithms discussed in the book. Examples in each chapter clarify the concepts and methods presented and end-of-chapter problems supplement the material presented and enhance the learning process.
This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his graduate students, consisting of Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Democratic Particle Swarm Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which are developed by other authors and have been successfully applied to various optimization problems. These consist of Partical Swarm Optimization, Big Band Big Crunch algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm and Chaos Embedded Metaheuristic Algorithm. Finally a multi-objective Optimization is presented to Solve large scale structural problems based on the Charged System Search algorithm, In the second edition seven new chapters are added consisting of Enhance colliding bodies optimization, Global sensitivity analysis, Tug of War Optimization, Water evaporation optimization, Vibrating System Optimization and Cyclical Parthenogenesis Optimization algorithm. In the third edition, five new chapters are included consisting of the recently developed algorithms. These are Shuffled Shepherd Optimization Algorithm, Set Theoretical Shuffled Shepherd Optimization Algorithm, Set Theoretical Teaching-Learning-Based Optimization Algorithm, Thermal Exchange Metaheuristic Optimization Algorithm, and Water Strider Optimization Algorithm and Its Enhancement. The concepts and algorithm presented in this book are not only applicable to optimization of skeletal structure, finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks.
This book is devoted to the study of a class of optimal control problems arising in mathematical economics, related to the Robinson-Solow-Srinivasan (RSS) model. It will be useful for researches interested in the turnpike theory, infinite horizon optimal control and their applications, and mathematical economists. The RSS is a well-known model of economic dynamics that was introduced in the 1960s and as many other models of economic dynamics, the RSS model is determined by an objective function (a utility function) and a set-valued mapping (a technology map). The set-valued map generates a dynamical system whose trajectories are under consideration and the objective function determines an optimality criterion. The goal is to find optimal trajectories of the dynamical system, using the optimality criterion. Chapter 1 discusses turnpike properties for some classes of discrete time optimal control problems. Chapter 2 present the description of the RSS model and discuss its basic properties. Infinite horizon optimal control problems, related to the RSS model are studied in Chapter 3. Turnpike properties for the RSS model are analyzed in Chapter 4. Chapter 5 studies infinite horizon optimal control problems related to the RSS model with a nonconcave utility function. Chapter 6 focuses on infinite horizon optimal control problems with nonautonomous optimality criterions. Chapter 7 contains turnpike results for a class of discrete-time optimal control problems. Chapter 8 discusses the RSS model and compares different optimality criterions. Chapter 9 is devoted to the study of the turnpike properties for the RSS model. In Chapter 10 the one-dimensional autonomous RSS model is considered and the continuous time RSS model is studied in Chapter 11. |
![]() ![]() You may like...
The Less Is More Linear Algebra of…
Daniela Calvetti, Erkki Somersalo
Paperback
R1,866
Discovery Miles 18 660
Applications of Advanced Optimization…
Abhinav Goel, Anand Chauhan, …
Hardcover
Optimality Conditions in Convex…
Anulekha Dhara, Joydeep Dutta
Hardcover
R5,971
Discovery Miles 59 710
Journey from Natural Numbers to Complex…
Nita H. Shah, Vishnuprasad D. Thakkar
Hardcover
|