Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMay 2009
Recombining angles in differential evolution
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3353–3356In this paper we wish to investigate how optimization problems involving angles can best be handled when using Differential Evolution (DE) as the optimization technique. Specifically we state the hypothesis that angles should not be recombined naïvly. ...
- ArticleMay 2009
Optimum robot manipulator path generation using differential evolution
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3322–3329A new evolutionary-based algorithm is proposed to solve the robot manipulator optimal path generation problem. The following scenario is considered: given a learnt joint path describing a robot manipulator simple task in the Cartesian space, an optimal ...
- ArticleMay 2009
Shrinking neighborhood evolution: a novel stochastic algorithm for numerical optimization
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3300–3305In this paper we develop and test a novel stochastic algorithm SNE (Shrinking Neighborhood Evolution) based on the issue of bound constrained optimization problem. Its heuristic strategy is simple and direct-related to the search region of the solving ...
- ArticleMay 2009
A quality metric for multi-objective optimization based on hierarchical clustering techniques
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3292–3299This paper presents the Hierarchical Cluster Counting (HCC), a new quality metric for nondominated sets generated by multi-objective optimizers that is based on hierarchical clustering techniques. In the computation of the HCC, the samples in the ...
- ArticleMay 2009
Bare bones particle swarm optimization with Gaussian or cauchy jumps
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3285–3291Bare Bones Particle Swarm Optimization (BBPSO) is a powerful algorithm, which has shown potential to solving multimodal optimization problems. Unfortunately, BBPSO may also get stuck into local optima when optimizing functions with many local optima in ...
-
- ArticleMay 2009
On simultaneous perturbation particle swarm optimization
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3271–3276In this paper, we describes the simultaneous perturbation particle swarm optimization which is a combination of the particle swarm optimization and the simultaneous perturbation optimization method. The method has global search capability of the ...
- ArticleMay 2009
Swarm's flight: accelerating the particles using C-CUDA
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3264–3270With the development of Graphics Processing Units (GPU) and the Compute Unified Device Architecture (CUDA) platform, several areas of knowledge are being benefited with the reduction of the computing time. Our goal is to show how optimization algorithms ...
- ArticleMay 2009
A modified PSO with a dynamically varying population and its application to the multi-objective optimal design of alloy steels
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3241–3248In this paper, a new mechanism for dynamically varying the population size is proposed based on a previously modified PSO algorithm (nPSO). This new algorithm is extended to the multi-objective optimisation case by applying the Random Weighted ...
- ArticleMay 2009
The importance of search space dimensionality in a computational model of embryogeny
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3207–3212This paper investigates the role of genotypic search space dimensionality on the behaviour and characteristics of a computational model of embryogeny. By varying genome length, it is shown that genotype dimensionality can have an impact on the ...
- ArticleMay 2009
Control of a flexible plate structure using particle swarm optimization
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3183–3190An investigation on control mechanism using particle swarm optimization (PSO) to suppress the vibration of flexible plate has been carried out. Active vibration control (AVC) is implemented for the case of single-input single output (SISO), and the ...
- ArticleMay 2009
Solving inverse problems by the multi-deme hierarchic genetic strategy
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3157–3163The new hp-HGS multi-deme, genetic strategy (hp-adaptive Finite Element Method combined with Hierarchic Genetic Strategy) for economic solving parametric inverse problems is presented in this paper. Inverse problems under consideration are formulated as ...
- ArticleMay 2009
Improving performance of radial basis function network based with particle swarm optimization
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3149–3156In conventional RBF Network structure, different layers perform different tasks. Hence, it is useful to split the optimization process of hidden layer and output layer of the network accordingly. This study proposes hybrid learning of RBF Network with ...
- ArticleMay 2009
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3127–3134A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization problems. Most of such algorithms inherently prefer a feasible solution over an ...
- ArticleMay 2009
Pareto-dominance in noisy environments
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3119–3126Noisy environments are a challenging task for multiobjective evolutionary algorithms. The algorithms may be trapped in local optima or even become a random search in the decision and objective space. In the course of the paper the classical definition of ...
- ArticleMay 2009
A hybrid self-adaptive genetic algorithm based on sexual reproduction and Baldwin effect for global optimization
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3087–3094Global optimization problems with numerous local and global optima are difficult to solve, which can trap traditional genetic algorithms. To solve the problems, a hybrid self-adaptive genetic algorithm based on sexual reproduction and Baldwin effect is ...
- ArticleMay 2009
Particle swarm optimization algorithm with adaptive velocity and its application to fault diagnosis
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3075–3079This paper introduces a particle swarm optimization algorithm with adaptive velocity (VPSO), in which a moving maximum limited velocity is set in original particle swarm optimization (PSO) algorithm to improve the performance of the PSO. The test ...
- ArticleMay 2009
Preventing premature convergence in a PSO and EDA hybrid
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 3060–3066Particle Swarm Optimization (PSO) is a stochastic optimization approach that originated from earlier attempts to simulate the behavior of birds and was successfully applied in many applications as an optimization tool. Estimation of distributions ...
- ArticleMay 2009
Semi-supervised training of least squares support vector machine using a multiobjective evolutionary algorithm
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 2996–3002Support Vector Machines (SVMs) are considered state-of-the-art learning machines techniques for classification problems. This paper studies the training of SVMs in the special case of problems in which the raw data to be used for training purposes is ...
- ArticleMay 2009
Improved shuffled frog leaping algorithm for continuous optimization problem
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 2992–2995Shuffled frog leaping algorithm (SFLA) is mainly used for the discrete space optimization. For SFLA, the population is divided into several memeplexes, several frogs of each memeplex are selected to compose a submemeplex for local evolvement, according ...
- ArticleMay 2009
Evolutionary techniques in a constraint satisfaction problem: puzzle eternity II
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationPages 2985–2991This work evaluates three evolutionary algorithms in a constraint satisfaction problem. Specifically, the problem is the Eternity II, a edge-matching puzzle with 256 unique square tiles that have to be placed on a square board of 16 × 16 cells. The aim ...