Author Archives: Community

Average Drift Analysis and Population Scalability

This paper aims to study how the population size affects the computation time of evolutionary algorithms (EAs) in a rigorous way. The computation time of EAs can be measured by either the number of generations (hitting time) or the number of fitness ev… Continue reading

Comments Off on Average Drift Analysis and Population Scalability

A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection

Detecting community structure has become one important technique for studying complex networks. Although many community detection algorithms have been proposed, most of them focus on separated communities, where each node can belong to only one communi… Continue reading

Comments Off on A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection

Introducing IEEE Collabratec

Comments Off on Introducing IEEE Collabratec

Toward Fast Niching Evolutionary Algorithms: A Locality Sensitive Hashing-Based Approach

Niching techniques have recently been incorporated into evolutionary algorithms (EAs) for multisolution optimization in multimodal landscape. However, existing niching techniques inevitably increase the time complexity of basic EAs due to the computati… Continue reading

Comments Off on Toward Fast Niching Evolutionary Algorithms: A Locality Sensitive Hashing-Based Approach

A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition

Decomposition is a well-known strategy in traditional multiobjective optimization. However, the decomposition strategy was not widely employed in evolutionary multiobjective optimization until Zhang and Li proposed multiobjective evolutionary algorithm… Continue reading

Comments Off on A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition

A Strength Pareto Evolutionary Algorithm Based on Reference Direction for Multiobjective and Many-Objective Optimization

While Pareto-based multiobjective optimization algorithms continue to show effectiveness for a wide range of practical problems that involve mostly two or three objectives, their limited application for many-objective problems, due to the increasing pr… Continue reading

Comments Off on A Strength Pareto Evolutionary Algorithm Based on Reference Direction for Multiobjective and Many-Objective Optimization

The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise

Practical optimization problems frequently include uncertainty about the quality measure, for example, due to noisy evaluations. Thus, they do not allow for a straightforward application of traditional optimization techniques. In these settings, random… Continue reading

Comments Off on The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise

IEEE Transactions on Evolutionary Computation publication information

Comments Off on IEEE Transactions on Evolutionary Computation publication information

Table of contents

Comments Off on Table of contents

GPEM 18(2) is available

The second issue of Volume 18 of Genetic Programming and Evolvable Machines is now available for download.

It contains:

An iterative genetic programming approach to prototype generation
by José María Valencia-Ramírez, Mario Graff, Hugo Jair Escalante & Jaime Cerda-Jacobo

Recursion in tree-based genetic programming
by Alexandros Agapitos, Michael O’Neill, Ahmed Kattan & Simon M. Lucas

Recurrent Cartesian Genetic Programming of Artificial Neural Networks
by Andrew James Turner & Julian Francis Miller

An analysis of the genetic marker diversity algorithm for genetic programming
by Armand R. Burks & William F. Punch

Solving metameric variable-length optimization problems using genetic algorithms
by Matthew L. Ryerkerk, Ronald C. Averill, Kalyanmoy Deb & Erik D. Goodman

SOFTWARE REVIEW
Software review: CGP-Library
by Emerson Carlos Pedrino, Paulo Cesar Donizeti Paris, Denis Pereira de Lima & Valentin Obac Roda

Continue reading

Comments Off on GPEM 18(2) is available