A GA-Based Algorithm with a Very Fast Rate of Convergence

Authors:
Navid Seifipour;Mohammad Bagher Menhaj
Affiliations:
-;-
Venue:
Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
Year:
2001

Citing 10
Cited 0

Introduction to non-linear optimization

Introduction to non-linear optimization
Optimization of control parameters for genetic algorithms

IEEE Transactions on Systems, Man and Cybernetics
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms for fuzzy controllers

AI Expert
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
System Identification through Simulated Evolution: A Machine Learning Approach to Modeling

System Identification through Simulated Evolution: A Machine Learning Approach to Modeling
Genetic Algorithms and Robotics

Genetic Algorithms and Robotics
Towards an Optimal Mutation Probability for Genetic Algorithms

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Dynamic Programming

Dynamic Programming
Training feedforward neural networks using genetic algorithms

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new model-free optimization method, which is called as On-line Genetic-Based Algorithm (OGA). In order to compare the performance of the OGA with that of the Conventional Genetic Algorithm (CGA), a constraint optimization problem has been considered. The simulation results show that the OGA remarkably outperform the CGA.