A robust stochastic genetic algorithm (StGA) for global numerical optimization

  title={A robust stochastic genetic algorithm (StGA) for global numerical optimization},
  author={Zhenguo Tu and Yong Lu},
  journal={IEEE Transactions on Evolutionary Computation},
  • Z. Tu, Yong Lu
  • Published 1 October 2004
  • Computer Science
  • IEEE Transactions on Evolutionary Computation
Many real-life problems can be formulated as numerical optimization of certain objective functions. However, often an objective function possesses numerous local optima, which could trap an algorithm from moving toward the desired global solution. Evolutionary algorithms (EAs) have emerged to enable global optimization; however, at the present stage, EAs are basically limited to solving small-scale problems due to the constraint of computational efficiency. To improve the search efficiency… 
Hybrid Ant Colony-Genetic Algorithm (GAAPI) for Global Continuous Optimization
  • I. Ciornei, E. Kyriakides
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
  • 2012
The algorithm proposed is a hybridization between two optimization techniques: a special class of ant colony optimization for continuous domains entitled API and a genetic algorithm (GA), which adopts the downhill behavior of API and the good spreading in the solution space of the GA.
Global Optimization Accuracy and Evolutionary Dynamics of the Generalized Generation Gap Algorithm with Adaptive Mutation
The objective of this paper is to augment the G3 algorithm with adaptive mutation operations which are dynamically activated according to some explicit feedback during the evolutionary optimization process in order to improve its performance for solving multimodal optimization problems.
Self-adaptive mutation for enhancing evolutionary search in real-coded genetic algorithms
  • J. Teo
  • Computer Science
    2006 International Conference on Computing & Informatics
  • 2006
This research investigates the feasibility of introducing a self-adaptive mutation operator into a real-coded evolutionary algorithm called the generalized generation gap (G3) algorithm, of which the mutation decision parameter is evolved along with the search variables during the evolutionary optimization process.
Clonal and Cauchy-mutation Evolutionary Algorithm for Global Numerical Optimization
For a suit of 23 benchmark test functions, CCEA is able to locate the near-optimal solutions for almost 23 test functions with relatively small variance and can get better solutions than other algorithms.
An improved multi-agent genetic algorithm for numerical optimization
The improved IMAGA makes use of the agent evolutionary framework, and constructs heuristic search and a hybrid crossover strategy to complete the competition and cooperation of agents, a convex mutation operator and some local search to achieve the self-learning characteristic.
An Intelligent Multi-Restart Memetic Algorithm for Box Constrained Global Optimisation
Compared results show that the algorithm is comparable with the best known EAs, including the winner of the 2005 IEEE Congress on Evolutionary Computation (CEC2005), and significantly better than the others in terms of both the solution quality and computational cost.
A Mutual-Evaluation Genetic Algorithm for Numerical and Routing Optimization
A novel mutual-evaluation approach is employed so that the merit of selected genes in a chromosome can be determined by comparing the fitness changes before and after interchanging with those in the mating chromosome.
A hybrid evolutionary algorithm with importance sampling for multi-dimensional optimization
The proposed hybrid algorithm is an efficient algorithm for multi-dimensional optimization problems considered in this paper and it is found that the resulted offsprings may avoid the trap of local optima.
Hybrid Metaheuristics for Global Optimization: A Comparative Study
It is argued that the published accuracy and convergence speed results are incorrect for most of the testing functions and investigate why the method is failing in those cases.


An efficient evolutionary programming algorithm
Enhanced simulated annealing for globally minimizing functions of many-continuous variables
A new global optimization algorithm for functions of many continuous variables is presented, derived from the basic Simulated annealing method, and used to solve complex circuit design problems, for which the objective function evaluation can be exceedingly costly.
Evolutionary programming made faster
A "fast EP" (FEP) is proposed which uses a Cauchy instead of Gaussian mutation as the primary search operator and is proposed and tested empirically, showing that IFEP performs better than or as well as the better of FEP and CEP for most benchmark problems tested.
Binary and floating-point function optimization using messy genetic algorithms
This dissertation examines the working of a messy GA, analyzes its operators, extends its use to solve problems of nonuniform building block size and scale, and applies messy GAs to solve a real-world engineering problem that is difficult to solve using a simple GA.
Solving large parameter optimization problems using genetic algorithms
The GA variations presented essentially keep the string lengths as small as possible while maintaining good sampling of the search space to facilitate lower number of function evaluations for finding an optimal solution.
Combining mutation operators in evolutionary programming
Simulations indicate that both the adaptive and nonadaptive versions of this operator are capable of producing solutions that are statistically as good as, or better, than those produced when using Gaussian or Cauchy mutations alone.
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms are a probabilistic search approach which are founded on the ideas of evolutionary processes and applicable to many hard optimization problems such as optimization of functions with linear and nonlinear constraints.
Genetic Algorithm Approach for Optimal Control Problems with Linearly Appearing Controls
For optimal control problems in Mayer form with all controls appearing only linearly in the equations of motion, this paper presents a method for calculating the optimal solution without
Evolving nonlinear time-series models using evolutionary programming
The performance of the different types of evolutionary algorithms was tested on standard problems and fast evolutionary programming with recurrent bilinear perceptrons produced the best models with fewer parameters and lower normalized mean square error.