Discrete cuckoo search for combinatorial optimization (Q1989244): Difference between revisions

This book is devoted to the discrete version of the cuckoo search algorithm and its applications to combinatorial optimization problems. The first part of the book describes theoretical backgrounds and main features of the population-based metaheuristics such as vertical and horizontal improvements, population structures, and stochastic strategies. The main components of cuckoo search are discussed, and two versions of the cuckoo search algorithm are presented. The second part of the book describes adaptation of the discrete version of cuckoo search to the traveling salesman problem, the job shop scheduling problem and the quadratic assignment problem. The book ends with a description of the random-key cuckoo search approach and its application to the traveling salesman problem, and the quadratic assignment problem. The performances of the developed heuristics are demonstrated by test experiments. Some benchmarks used in tests and implemented in Java source code are presented in appendices. Each chapter is concluded with a vast list of cited publications.