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.

Nature-inspired algorithms such as cuckoo search and firefly algorithm have become popular and widely used in recent years in many applications. These algorithms are flexible, efficient and easy to implement. New progress has been made in the last few years, and it is timely to summarize the latest developments of cuckoo search and firefly algorithm and their diverse applications. This book will review both theoretical studies and applications with detailed algorithm analysis, implementation and case studies so that readers can benefit most from this book. Application topics are contributed by many leading experts in the field. Topics include cuckoo search, firefly algorithm, algorithm analysis, feature selection, image processing, travelling salesman problem, neural network, GPU optimization, scheduling, queuing, multi-objective manufacturing optimization, semantic web service, shape optimization, and others. This book can serve as an ideal reference for both graduates and researchers in computer science, evolutionary computing, machine learning, computational intelligence, and optimization, as well as engineers in business intelligence, knowledge management and information technology.

This timely review book summarizes the state-of-the-art developments in nature-inspired optimization algorithms and their applications in engineering. Algorithms and topics include the overview and history of nature-inspired algorithms, discrete firefly algorithm, discrete cuckoo search, plant propagation algorithm, parameter-free bat algorithm, gravitational search, biogeography-based algorithm, differential evolution, particle swarm optimization and others. Applications include vehicle routing, swarming robots, discrete and combinatorial optimization, clustering of wireless sensor networks, cell formation, economic load dispatch, metamodeling, surrogated-assisted cooperative co-evolution, data fitting and reverse engineering as well as other case studies in engineering. This book will be an ideal reference for researchers, lecturers, graduates and engineers who are interested in nature-inspired computation, artificial intelligence and computational intelligence. It can also serve as a reference for relevant courses in computer science, artificial intelligence and machine learning, natural computation, engineering optimization and data mining.

The book focuses on both theory and applications in the broad areas of communication technology, computer science and information security. This two volume book contains the Proceedings of International Conference on Advanced Computing and Intelligent Engineering. These volumes bring together academic scientists, professors, research scholars and students to share and disseminate information on knowledge and scientific research works related to computing, networking, and informatics to discuss the practical challenges encountered and the solutions adopted. The book also promotes translation of basic research into applied investigation and convert applied investigation into practice.

Multi-Objective Combinatorial Optimization Problems and Solution Methods discusses the results of a recent multi-objective combinatorial optimization achievement that considered metaheuristic, mathematical programming, heuristic, hyper heuristic and hybrid approaches. In other words, the book presents various multi-objective combinatorial optimization issues that may benefit from different methods in theory and practice. Combinatorial optimization problems appear in a wide range of applications in operations research, engineering, biological sciences and computer science, hence many optimization approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic and algebraic techniques. This book covers this important topic as computational optimization has become increasingly popular as design optimization and its applications in engineering and industry have become ever more important due to more stringent design requirements in modern engineering practice. - Presents a collection of the most up-to-date research, providing a complete overview of multi-objective combinatorial optimization problems and applications - Introduces new approaches to handle different engineering and science problems, providing the field with a collection of related research not already covered in the primary literature - Demonstrates the efficiency and power of the various algorithms, problems and solutions, including numerous examples that illustrate concepts and algorithms

This book highlights the basic concepts of the CS algorithm and its variants, and their use in solving diverse optimization problems in medical and engineering applications. Evolutionary-based meta-heuristic approaches are increasingly being applied to solve complicated optimization problems in several real-world applications. One of the most successful optimization algorithms is the Cuckoo search (CS), which has become an active research area to solve N-dimensional and linear/nonlinear optimization problems using simple mathematical processes. CS has attracted the attention of various researchers, resulting in the emergence of numerous variants of the basic CS with enhanced performance since 2019.

Artificial intelligence is increasingly finding its way into industrial and manufacturing contexts. The prevalence of AI in industry from stock market trading to manufacturing makes it easy to forget how complex artificial intelligence has become. Engineering provides various current and prospective applications of these new and complex artificial intelligence technologies. Applications of Artificial Intelligence in Electrical Engineering is a critical research book that examines the advancing developments in artificial intelligence with a focus on theory and research and their implications. Highlighting a wide range of topics such as evolutionary computing, image processing, and swarm intelligence, this book is essential for engineers, manufacturers, technology developers, IT specialists, managers, academicians, researchers, computer scientists, and students.

"This 10-volume compilation of authoritative, research-based articles contributed by thousands of researchers and experts from all over the world emphasized modern issues and the presentation of potential opportunities, prospective solutions, and future directions in the field of information science and technology"--Provided by publisher.

This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants. The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas. Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem.