This article provides a general overview of the field now known as "evolutionary multi-objective optimization," which refers to the use of evolutionary algorithms to solve problems with two or more (often conflicting) objective functions. Using as a framework the history of this discipline, we discuss some of the most representative algorithms that have been developed so far, as well as some of their applications. Also, we discuss some of the methodological issues related to the use of multi-objective evolutionary algorithms, as well as some of the current and future research trends in the area.

Evolutionary multi-objective optimization: a historical view of the field

neither disappear nor hide under the rug in the near future. Earth Day 1970 was not solely a symptom of another fad. The problems are too persistent and serious for that. Thus, these seven books and the many others like them are symptomatic of an important transition that has only begun: perhaps the next generation of these books will be deemed insufficiently biological to be reviewed in QRB. Although this should give ecologists no cause to sigh with relief, I, for one, would consider this a worthwhile tradeoff.

Evolutionary GeneticsGenetics of the Evolutionary Process.Theodosius Dobzhansky

This article lists fourteen open problems in artificial life, each of which is a grand challenge requiring a major advance on a fundamental issue for its solution. Each problem is briefly explained, and, where deemed helpful, some promising paths to its solution are indicated.

/pdf/open-problems-in-artificial-life-7n72dncp2y.pdf

Open problems in artificial life

R. Babuska, Fuzzy Modeling for Control, Kluwer Academic Publ., Dordrecht, 1998, 288 p. B. Bouchon-Meunier, L. Foulloy, M. Ramdani, Logique Floue Exercices Corriges et Exemples d' Applications, Cepadues Editions. Toulouse, 199B, 200 p. G.Q. Chen, Fuzzy Logic in Data Modeling Semantics, Constraints and Database Design, Kluwer Academic Publ., Boston. 1998, 240 p. K.J. Cios. W. Pedrycz, R.S. Swiniarski. Data Mining Methods for Knowledge Discovery, Kluwer Academic Publ., Dordrecht. 199B. J. Godjevac, Idees Nettes sur la Logique Floue, Presses Polytechniques et Universitaires Romandes. Lausanne, 1997,200 p. E. Hisdal, Logical structures for representation of knowledge and uncertainty, Physica-Verlag, Heidelberg, Germany, 199B. M. Jamshidi, A. Titli, L.A. Zadeh, S. Boverie, Applications of Fuzzy LogiC Towards High Machine Intelligence Quotient Systems, Prentice-Hall, Englewood Cliffs, NJ, 1997,423 p. F. Lootsma, Fuzzy Logic for Planning and Decision Making Applied Optimization 8. Kluwer Academic Publ., Dordrecht, 1998. W. Mielczarski, Fuzzy Logic Techniques in Power Systems, Physica-Verlag, Berlin, 1998, 456 p. J.N. Mordeson, P.S. Nair, Fuzzy Mathematics An Introduction for Engineers and Scientists. Physica-Verlag, Berlin, 1998,270 p. W. Pedrycz, Computational Intelligence An Introduction, CRC Press, Boca Raton, FL, 1997,304 p. M. Reghis, E. Roventa, Classical and Fuzzy Concepts in Mathematical Logic and Applications, CRC Press, Boca Raton, FL, 1998. L. Reznik, Fuzzy Controllers, Newness Press, UK, 1997. Schindler, Fuzzy-Datenanalyse durch kontextbasierte Datenbankanfragen, Deutscher Universitiits Verlag, Leverkusen, Germany, 1998. O. Wolkenhauer, Possibility Theory with Applications to Data Analysis. Research Studies Press, Hertfordshire, UK, 1998, 290 p. Edited volumes

Fuzzy sets and systems

A number of centrality measures are available to determine the relative importance of a node in a complex network, and betweenness is prominent among them. However, the existing centrality measures are not adequate in network percolation scenarios (such as during infection transmission in a social network of individuals, spreading of computer viruses on computer networks, or transmission of disease over a network of towns) because they do not account for the changing percolation states of individual nodes. We propose a new measure, percolation centrality, that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states. The measure can be extended to include random walk based definitions, and its computational complexity is shown to be of the same order as that of betweenness centrality. We demonstrate the usage of percolation centrality by applying it to a canonical network as well as simulated and real world scale-free and random networks.

/pdf/percolation-centrality-quantifying-graph-theoretic-impact-of-3pkk1fki6j.pdf

Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks

Very Effective Evolutionary Techniques for Searching Cellular Automata Rule Spaces.

Cellular automata (CA) are important as prototypical, spatially extended, discrete dynamical systems. Because the problem of forecasting dynamic behavior of CA is undecidable, various parameter-based approximations have been developed to address the problem. Out of the analysis of the most important parameters available to this end we proposed some guidelines that should be followed when defining a parameter of that kind. Based upon the guidelines, new parameters were proposed and a set of five parameters was selected; two of them were drawn from the literature and three are new ones, defined here. This article presents all of them and makes their qualities evident. Then, two results are described, related to the use of the parameter set in the Elementary Rule Space: a phase transition diagram, and some general heuristics for forecasting the dynamics of one-dimensional CA. Finally, as an example of the application of the selected parameters in high cardinality spaces, results are presented from experiments involving the evolution of radius-3 CA in the Density Classification Task, and radius-2 CA in the Synchronization Task.

Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space

The best currently known class of dynamically equivalent cellular automata rules for density classification

On Density Determination With Cellular Automata: Results, Constructions and Directions.

We analyse the results of our experimental laboratory approximation of motorway networks with slime mould Physarum polycephalum . Motorway networks of 14 geographical areas are considered: Australia, Africa, Belgium, Brazil, Canada, China, Germany, Iberia, Italy, Malaysia, Mexico, the Netherlands, UK and USA. For each geographical entity, we represented major urban areas by oat flakes and inoculated the slime mould in a capital. After slime mould spanned all urban areas with a network of its protoplasmic tubes, we extracted a generalised Physarum graph from the network and compared the graphs with an abstract motorway graph using most common measures. The measures employed are the number of independent cycles, cohesion, shortest paths lengths, diameter, the Harary index and the Randic index. We obtained a series of intriguing results, and found that the slime mould approximates best of all the motorway graphs of Belgium, Canada and China, and that for all entities studied the best match between Physarum and motorway graphs is detected by the Randic index molecular branching index.

Pedro Paulo Balbi de Oliveira

Papers

Very Effective Evolutionary Techniques for Searching Cellular Automata Rule Spaces.

Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space

The best currently known class of dynamically equivalent cellular automata rules for density classification

On Density Determination With Cellular Automata: Results, Constructions and Directions.

Are motorways rational from slime mould's point of view?