A comprehensive guide to a powerful new analytical tool by two of its foremost innovators
The past decade has witnessed many exciting advances in the use of genetic algorithms …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

Rapid developments in the field of genetic algorithms along with the popularity of the first
edition precipitated this completely revised, thoroughly updated second edition of The …

Challenging optimisation problems, which elude acceptable solution via conventional
methods, arise regularly in control systems engineering. Evolutionary algorithms (EAs) …

This paper studies a strategic supply chain management problem to design reliable
networks that perform as well as possible under normal conditions, while also performing …

Adaptation of parameters and operators represents one of the recent most important and
promising areas of research in evolutionary computations; it is a form of designing self …

Ill-posedness. Regularization. Stability. Uniqueness. To many engineers, the language of
inverse analysis projects a mysterious and frightening image, an image made even more …

A general weapon-target assignment (WTA) problem is to find a proper assignment of
weapons to targets with the objective of minimizing the expected damage of own-force …

Multiple sequence alignment, known as NP-complete problem, is among the most important
and challenging tasks in computational biology. For multiple sequence alignment, it is …

This paper examines the development and application of a hybrid genetic algorithm (HGA)
to the open shop scheduling problem. The hybrid algorithm incorporates a local …