Conference Paper

A Knowledge-Based Genetic Algorithm to the Global Numerical Optimization

DOI: 10.1109/CSO.2009.228 Conference: Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on, Volume: 1
Source: IEEE Xplore

ABSTRACT Global optimization algorithms have received much attention recently. This paper presented a Knowledge-based Genetic Algorithm (KGA) for the global numerical optimization. In KGA, some innovative operators were proposed by integrating the empirical knowledge with the existing operation. In particular, we proposed two novel operators: knowledge-based mutation operator based on round or immunity operation, and knowledge-based local search operator based on sensitivity analysis and steepest descent method. The experimental results suggest that KGA outperforms to some published algorithms.

1 Follower
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In the evolutionary optimization field, there exist some algorithms taking advantage of the known property of the benchmark functions, such as local optima lying along the coordinate axes, global optimum having the same values for many variables and so on. Multiagent genetic algorithm (MAGA) is an example for this class of algorithms. In this paper, we identify shortcomings associated with the existing test functions. Novel hybrid benchmark functions, whose complexity and properties can be controlled easily, are introduced and several evolutionary algorithms are evaluated with the novel test functions.
    Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE; 07/2005
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The particle swarm optimizer (PSO) is a stochastic, population-based optimization technique that can be applied to a wide range of problems, including neural network training. This paper presents a variation on the traditional PSO algorithm, called the cooperative particle swarm optimizer, or CPSO, employing cooperative behavior to significantly improve the performance of the original algorithm. This is achieved by using multiple swarms to optimize different components of the solution vector cooperatively. Application of the new PSO algorithm on several benchmark optimization problems shows a marked improvement in performance over the traditional PSO.
    IEEE Transactions on Evolutionary Computation 07/2004; 8(3-8):225 - 239. DOI:10.1109/TEVC.2004.826069 · 5.55 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A gray-encoded hybrid accelerating genetic algorithm (GHAGA) with Nelder–Mead simplex searching operator and simplex algorithm is developed for the global optimization of dynamical systems. The corresponding convergence theorem is developed to guarantee the new algorithm to be convergent. The efficiency of the new algorithm is verified by application of several well-investigated nonlinear functions. This algorithm overcomes any Hamming-cliff phenomena in existing genetic methods, and it is very efficient for optimizing nonlinear models compared to existing genetic algorithms and other traditional optimization methods.
    Communications in Nonlinear Science and Numerical Simulation 06/2005; 10(4):355-363. DOI:10.1016/j.cnsns.2003.12.005 · 2.57 Impact Factor