A heuristic technique, often called simply a heuristic, is any approach to problem solving, learning, or discovery that employs a practical method not guaranteed to be optimal or perfect, but sufficient for the immediate goals. Where finding an optimal solution is impossible or impractical, heuristic methods can be used to speed up the process of finding a satisfactory solution. Heuristics can be mental shortcuts that ease the cognitive load of making a decision. In computer science, artificial intelligence, and mathematical optimization, a heuristic is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut. A heuristic function, also called simply a heuristic, is a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow. The objective of a heuristic is to produce a solution in a reasonable time frame that is good enough for solving the problem at hand. This solution may not be the best of all the actual solutions to this problem, or it may simply approximate the exact solution. But it is still valuable because finding it does not require a prohibitively long time. Heuristics may produce results by themselves, or they may be used in conjunction with optimization algorithms to improve their efficiency. Results about NP-hardness in theoretical computer science make heuristics the only viable option for a variety of complex optimization problems that need to be routinely solved in real-world applications. This book entitled Computational Intelligence and Modern Heuristics highlights on computational models using heuristic and meta-heuristic approaches.

Including contributions from leading experts in the field, this book covers applications and developments of heuristic search methods for solving complex optimization problems. The book covers various local search strategies including genetic algorithms, simulated annealing, tabu search and hybrids thereof. These methods have proved extraordinarily successful by solving some of the most difficult, real-world problems. At the interface between Artificial Intelligence and Operational Research, research in this exciting area is progressing apace spurred on by the needs of industry and commerce. The introductory chapter provides a clear overview of the basic techniques and useful pointers to further reading and to current research. The second section of the book covers some of the most recent and exciting developments of the basic techniques, with suggestions not only for extending and improving these but also for hybridizing and incorporating automatic adaption. The third section contains a number of case studies, surveys and comparative studies which span a wide range of application areas ranging from the classic Steiner tree problem to more practical problems arising in telecommunications and data analysis. The coverage of the latest research and the illustrative case studies will ensure that the book is invaluable for researchers and professionals with an interest in heuristic search methods.

Solutions to most real-world optimization problems involve a trade-off between multiple conflicting and non-commensurate objectives. Some of the most challenging ones are area-delay trade-off in VLSI synthesis and design space exploration, time-space trade-off in computation, and multi-strategy games. Conventional search techniques are not equipped to handle the partial order state spaces of multiobjective problems since they inherently assume a single scalar objective function. Multiobjective heuristic search techniques have been developed to specifically address multicriteria combinatorial optimization problems. This text describes the multiobjective search model and develops the theoretical foundations of the subject, including complexity results . The fundamental algorithms for three major problem formulation schemes, namely state-space formulations, problem-reduction formulations, and game-tree formulations are developed with the support of illustrative examples. Applications of multiobjective search techniques to synthesis problems in VLSI, and operations research are considered. This text provides a complete picture on contemporary research on multiobjective search, most of which is the contribution of the authors.

We present in this volume the collection of finally accepted papers of the eighth edition of the “IWANN” conference (“International Work-Conference on Artificial Neural Networks”). This biennial meeting focuses on the foundations, theory, models and applications of systems inspired by nature (neural networks, fuzzy logic and evolutionary systems). Since the first edition of IWANN in Granada (LNCS 540, 1991), the Artificial Neural Network (ANN) community, and the domain itself, have matured and evolved. Under the ANN banner we find a very heterogeneous scenario with a main interest and objective: to better understand nature and beings for the correct elaboration of theories, models and new algorithms. For scientists, engineers and professionals working in the area, this is a very good way to get solid and competitive applications. We are facing a real revolution with the emergence of embedded intelligence in many artificial systems (systems covering diverse fields: industry, domotics, leisure, healthcare, ... ). So we are convinced that an enormous amount of work must be, and should be, still done. Many pieces of the puzzle must be built and placed into their proper positions, offering us new and solid theories and models (necessary tools) for the application and praxis of these current paradigms. The above-mentioned concepts were the main reason for the subtitle of the IWANN 2005 edition: “Computational Intelligence and Bioinspired Systems.” The call for papers was launched several months ago, addressing the following topics: 1. Mathematical and theoretical methods in computational intelligence.

This book is a collection of various methodologies that make it possible for metaheuristics and hyper-heuristics to solve problems that occur in the real world. This book contains chapters that make use of metaheuristics techniques. The application fields range from image processing to transmission power control, and case studies and literature reviews are included to assist the reader. Furthermore, some chapters present cutting-edge methods for load frequency control and IoT implementations. In this sense, the book offers both theoretical and practical contents in the form of metaheuristic algorithms. The researchers used several stochastic optimization methods in this book, including evolutionary algorithms and Swarm-based algorithms. The chapters were written from a scientific standpoint. As a result, the book is primarily aimed at undergraduate and postgraduate students of Science, Engineering, and Computational Mathematics, but it can also be used in courses on Artificial Intelligence, among other things. Similarly, the material may be beneficial to research in evolutionary computation and artificial intelligence communities.

This book is about synergy in computational intelligence (CI). It is a c- lection of chapters that covers a rich and diverse variety of computer-based techniques, all involving some aspect of computational intelligence, but each one taking a somewhat pragmatic view. Many complex problems in the real world require the application of some form of what we loosely call “intel- gence”fortheirsolution. Fewcanbesolvedbythenaiveapplicationofasingle technique, however good it is. Authors in this collection recognize the li- tations of individual paradigms, and propose some practical and novel ways in which di?erent CI techniques can be combined with each other, or with more traditional computational techniques, to produce powerful probl- solving environments which exhibit synergy, i. e. , systems in which the whole 1 is greater than the sum of the parts . Computational intelligence is a relatively new term, and there is some d- agreement as to its precise de?nition. Some practitioners limit its scope to schemes involving evolutionary algorithms, neural networks, fuzzy logic, or hybrids of these. For others, the de?nition is a little more ?exible, and will include paradigms such as Bayesian belief networks, multi-agent systems, case-based reasoning and so on. Generally, the term has a similar meaning to the well-known phrase “Arti?cial Intelligence” (AI), although CI is p- ceived moreas a “bottom up” approachfrom which intelligent behaviour can emerge,whereasAItendstobestudiedfromthe“topdown”,andderivefrom pondering upon the “meaning of intelligence”. (These and other key issues will be discussed in more detail in Chapter 1.

In this text, two planning approaches for integrated airline scheduling are presented. One follows the traditional sequential approach, and the other uses metaheuristics to offer a truly simultaneous approach to airline scheduling.

The first notable feature of this book is its innovation: Computational intelligence (CI), a fast evolving area, is currently attracting lots of researchers’ attention in dealing with many complex problems. At present, there are quite a lot competing books existing in the market. Nevertheless, the present book is markedly different from the existing books in that it presents new paradigms of CI that have rarely mentioned before, as opposed to the traditional CI techniques or methodologies employed in other books. During the past decade, a number of new CI algorithms are proposed. Unfortunately, they spread in a number of unrelated publishing directions which may hamper the use of such published resources. These provide us with motivation to analyze the existing research for categorizing and synthesizing it in a meaningful manner. The mission of this book is really important since those algorithms are going to be a new revolution in computer science. We hope it will stimulate the readers to make novel contributions or even start a new paradigm based on nature phenomena. Although structured as a textbook, the book's straightforward, self-contained style will also appeal to a wide audience of professionals, researchers and independent learners. We believe that the book will be instrumental in initiating an integrated approach to complex problems by allowing cross-fertilization of design principles from different design philosophies. The second feature of this book is its comprehensiveness: Through an extensive literature research, there are 134 innovative CI algorithms covered in this book.