Biology and information technology will have an impact on the design of future products and processes. In this paper, the product and process design challenges are discussed. Evolutionary computation is introduced and its potential applications in design and manufacturing are discussed.

Evolutionary computing (EC) is an exciting development in Computer Science. It amounts to building, applying and studying algorithms based on the Darwinian principles of natural selection. In this paper we briefly introduce the main concepts behind evolutionary computing. We present the main components all evolutionary algorithms (EAs), sketch the differences between different types of EAs and ...

This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a general model for asynchronous update of the individuals in a cellular EA, and by the necessity of better accuracy beyond what existing models of selection intensity can provide. Therefore, we investigate the differences between th...

Evolutionary algorithms (EAs) can be regarded as algorithms based on neighbourhood search, where diierent search operators (such as crossover and mutation) determine diierent neighbourhood and step sizes. This paper analyses the eeciency of various mutations in evolutionary programming (EP) by examining their neighbourhood and step sizes. It shows analytically when and why Cauchy mutation-based...

In domains such as music and visual art, where the quality of an individual often depends on subjective or hard to express concepts, the automating fitness assignment becomes a difficult problem. This paper discusses the application of Zipf’s Law in evaluation of music pleasantness. Preliminary results indicate that a set of Zipf-based metrics can be effectively used to classify music according...

This paper demonstrates how interactive evolution can be applied to the evolution of simulated natural evolution. Evolutionary algorithmsof selection andvariation by recombination and/ormutation can beused to simulate biological evolution in a computer. Interactive evolution can be used to direct the development of graphicmodels that are simulations of their counterparts in nature. Interactive ...

A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits of “long jumps” of the Cauchy mutation operator at the early stage of the algorithm and “fine-tunings” of the Gaussian mutation operator at the later stage. Comparisons with the recently proposed sequential and parallel evolution...

In recent years, not only ruggedness but also neutrality has been recognized as an important feature of a fitness landscape for genetic search. As it has been reported that the evolutionary dynamics on a fitness landscape with neutrality is clearly different from the canonical explanations, ruggedness alone might be inadequate describing it. Another measure, i.e., neutrality is required. In thi...

This paper uses the recent idea that the fundamental haploid-diploid lifecycle of eukaryotic organisms implements a rudimentary form of learning within evolution. A general approach for evolutionary computation is here derived that differs from all previous known work using diploid representations. The primary role of recombination is also changed from that previously considered in both natural...