The analysis of time complexity of evolutionary algorithms has always focused on some artificial binary problems. This paper considers the average time complexity of an evolutionary algorithm for maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce matchings with nearly maximum cardinality in average polynomial time.

according to this fact that wind is now a part of global energy portfolio and due to unreliable and discontinuous production of wind energy; prediction of wind power value is proposed as a main necessity. in recent years, various methods have been proposed for wind power prediction. in this paper the prediction structure involves feature selection and use of artificial neural network (ann). in ...

The Distributed Differential Evolution (dDE) algorithm is a natural extension of the Differential Evolution (DE) algorithm, which is a recent addition to the Evolutionary Algorithms (EAs) pool, in the Evolutionary Computing (EC) field of computer science. The algorithmic novelty of the dDE algorithm is well evident in the literature. However, the theoretical studies on the performance of the dD...

Based on the problems caused by today conventional vehicles, much attention has been put on the fuel cell vehicles researches. However, using a fuel cell system is not adequate alone in transportation applications, because the load power profile includes transient that is not compatible with the fuel cell dynamic. To resolve this problem, hybridization of the fuel cell and energy storage device...

In previous work of the second author a rigorous mathematical foundation for re-encoding one evolutionary search algorithm by another has been developed. A natural issue to consider then is the complexity of deciding whether or not a given evolutionary algorithm can be re-encoded by one of the standard classical evolutionary algorithms such as a binary genetic algorithm. In the current paper we...