What is combinatorial optimization? Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both ?nite and discrete, i. e., enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem's feasible solutions - permutations of city labels - c- prise a ?nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de?ned on real spaces. Unlike combinatorial...

This book brings together the current state of-the-art research in Self Organizing Migrating Algorithm (SOMA) as a novel population-based evolutionary algorithm, modeled on the predator-prey relationship, by its leading practitioners.

As the first ever book on SOMA, this book is geared towards graduate students, academics and researchers, who are looking for a good optimization algorithm for their applications. This book presents the methodology of SOMA, covering both the real and discrete domains, and its various implementations in different research areas. The easy-to-follow and...

This book, the first devoted entirely to the subject, presents in detail the various permutative-based combinatorial differential evolution formulations by their initiators in an easy-to-follow manner through numerous illustrations and computer code.