Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Metaheuristics
Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search, evolutionary algorithms, artificial ants, and particle swarms, followed by chapters that demonstrate their applications to problems such as multiobjective optimization, logistics, vehicle routing, and air traffic management. The authors are leading researchers in this domain, with considerable teaching and applications experience, and the book will be of value to industrial practitioners, graduate students, and research academics.
Automatic Generation Of Algorithms
In the rapidly evolving domain of computational problem-solving, this book delves into the cutting-edge Automatic Generation of Algorithms (AGA) paradigm, a groundbreaking approach poised to redefine algorithm design for optimization problems. Spanning combinatorial optimization, machine learning, genetic programming, and beyond, it investigates AGA's transformative capabilities across diverse application areas. The book initiates by introducing fundamental combinatorial optimization concepts and NPhardness significance, laying the foundation for understanding AGA's necessity and potential. It then scrutinizes the pivotal Master Problem concept in AGA and the art of modeling for algorithm ge...
Multiobjective Optimization
This text offers many multiobjective optimization methods accompanied by analytical examples, and it treats problems not only in engineering but also operations research and management. It explains how to choose the best method to solve a problem and uses three primary application examples: optimization of the numerical simulation of an industrial process; sizing of a telecommunication network; and decision-aid tools for the sorting of bids.
Graph Coloring
This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications. The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method.
Metaheuristics for Hard Optimization
Contains case studies from engineering and operations research Includes commented literature for each chapter
Graph Partitioning
Graph partitioning is a theoretical subject with applications in many areas, principally: numerical analysis, programs mapping onto parallel architectures, image segmentation, VLSI design. During the last 40 years, the literature has strongly increased and big improvements have been made. This book brings together the knowledge accumulated during many years to extract both theoretical foundations of graph partitioning and its main applications.
Metaheuristics for Enterprise Data Intelligence
With the emergence of the data economy, information has become integral to business excellence. Every enterprise, irrespective of its domain of interest, carries and processes a lot of data in their day-to-day activities. Converting massive datasets into insightful information plays an important role in developing better business solutions. Data intelligence and its analysis pose several challenges in data representation, building knowledge systems, issue resolution and predictive systems for trend analysis and decisionmaking. The data available could be of any modality, especially when data is associated with healthcare, biomedical, finance, retail, cybersecurity, networking, supply chain m...
Natural Intelligence for Scheduling, Planning and Packing Problems
Scheduling, planning and packing are ubiquitous problems that can be found in a wide range of real-world settings. These problems transpire in a large variety of forms, and have enormous socio-economic impact. For many years, significant work has been devoted to automating the processes of scheduling, planning and packing using different kinds of methods. However, poor scaling and the lack of flexibility of many of the conventional methods coupled with the fact that most of the real-world problems across the application areas of scheduling, planning and packing nowadays tend to be of large scale, dynamic and full of complex dependencies have made it necessary to tackle them in unconventional...
Hybrid Genetic Optimization for IC Chips Thermal Control
The continuous miniaturization of integrated circuit (IC) chips and the increase in the sleekness of the design of electronic components have led to the monumental rise of volumetric heat generation in electronic components. Hybrid Genetic Optimization for IC Chips Thermal Control: With MATLAB® Applications focuses on the detailed optimization strategy carried out to enhance the performance (temperature control) of the IC chips oriented at different positions on a switch-mode power supply (SMPS) board and cooled using air under various heat transfer modes. Seven asymmetric protruding IC chips mounted at different positions on an SMPS board are considered in the present study that is supplied with non-uniform heat fluxes. Key Features: Provides guidance on performance enhancement and reliability of IC chips Provides a detailed hybrid optimization strategy for the optimal arrangement of IC chips on a board The MATLAB program for the hybrid optimization strategy along with its stability analysis is carried out in a detailed manner Enables thermal design engineers to identify the positioning of IC chips on the board to increase their reliability and working cycle
Handbook of Moth-Flame Optimization Algorithm
Moth-Flame Optimization algorithm is an emerging meta-heuristic and has been widely used in both science and industry. Solving optimization problem using this algorithm requires addressing a number of challenges, including multiple objectives, constraints, binary decision variables, large-scale search space, dynamic objective function, and noisy parameters. Handbook of Moth-Flame Optimization Algorithm: Variants, Hybrids, Improvements, and Applications provides an in-depth analysis of this algorithm and the existing methods in the literature to cope with such challenges. Key Features: Reviews the literature of the Moth-Flame Optimization algorithm Provides an in-depth analysis of equations, ...
