Sciweavers

CEC
2009
IEEE
13 years 11 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan
CEC
2009
IEEE
13 years 11 months ago
Implicit Context Representation Cartesian Genetic Programming for the assessment of visuo-spatial ability
— In this paper, a revised form of Implicit Context Representation Cartesian Genetic Programming is used in the development of a diagnostic tool for the assessment of patients wi...
Stephen L. Smith, Michael A. Lones
CEC
2009
IEEE
13 years 11 months ago
Dynamic optimization using Self-Adaptive Differential Evolution
Abstract— In this paper we investigate a Self-Adaptive Differential Evolution algorithm (jDE) where F and CR control parameters are self-adapted and a multi-population method wit...
Janez Brest, Ales Zamuda, Borko Boskovic, Mirjam S...
CEC
2009
IEEE
13 years 11 months ago
The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances
—This paper describes the idea of MOEA/D and proposes a strategy for allocating the computational resource to different subproblems in MOEA/D. The new version of MOEA/D has been ...
Qingfu Zhang, Wudong Liu, Hui Li
CEC
2009
IEEE
13 years 11 months ago
Evolving hypernetwork models of binary time series for forecasting price movements on stock markets
— The paper proposes a hypernetwork-based method for stock market prediction through a binary time series problem. Hypernetworks are a random hypergraph structure of higher-order...
Elena Bautu, Sun Kim, Andrei Bautu, Henri Luchian,...
CEC
2009
IEEE
13 years 11 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...
CEC
2009
IEEE
13 years 11 months ago
When is an estimation of distribution algorithm better than an evolutionary algorithm?
—Despite the wide-spread popularity of estimation of distribution algorithms (EDAs), there has been no theoretical proof that there exist optimisation problems where EDAs perform...
Tianshi Chen, Per Kristian Lehre, Ke Tang, Xin Yao
CEC
2009
IEEE
13 years 11 months ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao