zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. (English) Zbl 1062.65065
Summary: A niche hybrid genetic algorithm (NHGA) is proposed to solve continuous multimodal optimization problems more efficiently, accurately and reliably. It provides a new architecture of hybrid algorithms, which organically merges the niche techniques and Nelder-Mead’s simplex method into genetic algorithms (GAs). In the new architecture, the simplex search is first performed in the potential niches, which likely contain a global optimum, to locate the promising zones within search space, quickly and reliably. Then another simplex search is used to quickly discover the global optimum in the located promising zones. The proposed method not only makes the exploration capabilities of GAs stronger through niche techniques, but also has more powerful exploitation capabilities by using simplex search. So it effectively alleviates premature convergence and improves weak exploitation capacities of GAs. A set of benchmark functions is used to demonstrate the validity of NHGA and the role of every component of NHGA. Numerical experiments show that the NHGA may, efficiently and reliably, obtain a more accurate global optimum for the complex and high-dimension multimodal optimization problems. It also demonstrates that the new hybrid architecture is potential and can be used to generate more potential hybrid algorithms.

65K05Mathematical programming (numerical methods)
90C29Multi-objective programming; goal programming
90C30Nonlinear programming
Full Text: DOI
[1] Goldberg, D. E.: Genetic algorithm in search, optimization and machine learning. (1989) · Zbl 0721.68056
[2] G. Berthiau, P. Siarry, A genetic algorithm for globally minimizing functions of several continuous variables, in: Second International Conference on Meta-heuristics, Sophia-Antipolis, France, July 1997 · Zbl 0882.65049
[3] Chelouah, R.; Siarry, P.: A continuous genetic algorithm designed for the global optimization of multimodal functions. Journal of heuristics 6, 191-213 (2000) · Zbl 0969.68641
[4] Michalewicz, Z.: Genetic algorithms+Data structures=Evolution programs. (1996) · Zbl 0841.68047
[5] Chelouah, R.; Siarry, P.: Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. European journal of operational research 148, 335-348 (2003) · Zbl 1035.90062
[6] Siarry, P.; Pétrowski, A.; Bessaou, M.: A multipopulation genetic algorithm aimed at multimodal optimization. Advances in engineering software 33, No. 4, 207-213 (2002) · Zbl 1011.68115
[7] S.W. Mahfoud, Niching Methods for Genetic Algorithms, Ph.D. dissertation, Univ. of Illinois, Urbana-Champaign, 1995
[8] Yin, X.; Germay, N.: A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. Artificial neural networks and genetic algorithms, Proceedings of the international conference in Innsbruck, 450-457 (1993)
[9] Pétrowski, A.; Genet, M. Girod: A classification tree for speciation. Proceedings of IEEE, 204-211 (1999)
[10] A. Pétrowski, A clearing procedure as a niching method for genetic algorithms, in: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, Nagoya, Japan, 1996, pp. 798--803
[11] Sareni, B.; Krähenbühl, L.: Fitness sharing and niching methods revisited. IEEE transactions on evolutionary computation 3, No. 2, 97-106 (1998)
[12] Preuxa, Ph.; Talbi, E. -G.: Towards hybrid evolutionary algorithms. International transactions in operational research 6, 557-570 (1999)
[13] K.E. Mathias, L.D. Whitley, C. Stork, T. Kusuma, Staged hybrid genetic search for seismic data imaging, in: Proceedings of the 1st IEEE Conference on Evolutionary Computation, Orlando, FL, June 1994, pp. 356--361
[14] Renders, J. M.; Flasse, S. P.: Hybrid method using genetic algorithms for the global optimization. IEEE transactions on systems, man, and cybernetics 26, No. 2, 243-258 (1996)
[15] Nelder, J. A.; Mead, R.: A simplex method for function minimization. The computer journal, 308-313 (1965) · Zbl 0229.65053
[16] Glover, F.; Laguna, M.: Tabu search. (1997) · Zbl 0930.90083
[17] S. Smith, The simplex method and evolutionary algorithms, in: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, Pricataway, 1998, pp. 799--804