Hostname: page-component-848d4c4894-pjpqr Total loading time: 0 Render date: 2024-07-03T17:01:27.237Z Has data issue: false hasContentIssue false

An optimization method fitted for model inversion in non destructive control by eddy currents*

Published online by Cambridge University Press:  15 December 2000

R. Chelouah
Affiliation:
Université de Cergy-Pontoise, Neuville-sur-Oise, 95031 Cergy-Pontoise, France
P. Siarry*
Affiliation:
Université de Paris XII, LERISS, 61 avenue du Général de Gaulle, 94010 Créteil, France
G. Berthiau
Affiliation:
CEA Saclay, CEREM/STA/LCME, 91191 Gif-sur-Yvette, France
B. De Barmon
Affiliation:
CEA Saclay, CEREM/STA/LCME, 91191 Gif-sur-Yvette, France
Get access

Abstract

An hybrid method combining two algorithms is proposed for the global optimization of inverted pattern functions encountered in non destructive control by eddy currents. This method performs first the exploration with a Genetic Algorithm, allowing to localize a "promising area" . Then the search is intensified inside that area, through a Nelder-Mead Simplex Search.

Keywords

Type
Research Article
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

This paper has been presented at NUMELEC 2000.

References

J.E. Baker, Reducing Bias and Inefficiency in the Selection Algorithm, Proceedings of the Second International Conference on Genetic Algorithms and their Applications, New Jersey, USA, 1985.
G. Berthiau, P. Siarry, A Genetic Algorithm for Globally Minimizing Functions of Several Continuous Variables, Second Metaheuristics International Conference MIC'97, Sophia-Antipolis, France, July 1997, pp. 259-260.
R. Chelouah, P. Siarry, An hybrid method combining a Genetic Algorithm and a Nelder-Mead Simplex Search for the global optimization of multiminima functions, Third Metaheuristics International Conference MIC'99, Angra dos Reis, Brazil, July 1999, pp. 151-156.
R. Chelouah, P. Siarry, A Continuous Genetic Algorithm designed for the global optimization of multimodal functions, J. Heuristics 6, 191 (2000).
A.J. Chipperfield, P.J. Fleming, H. Pohlheim, C.M. Fonseca, Genetic Algorithm Toolbox User's Guide, ACSE Research Report No. 512, University of Sheffield, 1994.
K.A. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems, University of Michigan, Ann Arbor, MI, Ph.D. thesis, 1975.
D.E Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, 1989).
Holland, J.H., Outline for Logical Theory of Adaptive Systems, J. ACM 3, 297 (1962). CrossRef
J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, Internal report, 1975.
Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs (Springer-Verlag, Heidelberg, 1996).
H. Mühlenbein, Evolution in Time and Space - The Parallel Genetic Algorithm, in Foundations of Genetic Algorithms, edited by G. Rawlins (Morgan-Kaufman, 1991), pp. 316-337.
H. Mühlenbein, M. Schomish, J. Born, The Parallel Genetic Algorithm as function optimizer, Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, 1991, pp. 271-278.
H. Mühlenbein, D. Schlierkamp-Voosen, Analysis of Selection, Mutation and Recombination in Genetic Algorithms, Technical Report 93/94, GMD, 1993.
Nelder, J.A., Mead, R., A simplex method for function minimization, Comput. J. 7, 308 (1965). CrossRef
J.M. Renders, S.P. Flasse, Hybrid method using Genetic Algorithms for the Global Optimization, IEEE Trans. Systems, Man, and Cybernetics 26, 243 (1996).