Abstract
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of multi-layer optical coatings, it is shown that it introduces a unintentional bias into the search process with respect to the probability of a dimension being generated by mutation and recombination. In order to examine the impact of the bias, the representation was applied to another variable-dimensional problem, the simultaneous estimation of model orders and model parameters of instances of autoregressive moving average processes (ARMA). The results of the parameter study show that quality of the estimation can be improved by removing the bias.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Bäck and M. Schütz. Evolution strategies for mixed-integer optimization of optical multilayer systems. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Evolutionary Programming IV-Proc. Fourth Annual Conf. Evolutionary Programming (EP-95), pages 33–51, San Diego CA, March 1–4, 1995. The MIT Press, Cambridge MA.
G. E. P. Box and G.M. Jenkins. Time Series Analysis, Forecasting and Control. Holden-Day, San Francisco, 1970.
Y. Davidor. An evolution standing on the design of redundant robot manipulators. In H-P. Schwefel and R. Männer, editors, Parallel Problem Solving from Nature — Proceedings 1st Workshop PPSN I, volume 496 of Lecture Notes in Computer Science, pages 60–69. Springer, Berlin, 1991.
M. Mandischer. Evolving recurrent neural networks with non-binary encoding. In Proc. Second IEEE Int'l Conf. Evolutionary Computation (ICEC '95), vol. 2, pages 584–589, Perth, Australia, Nov. 29–Dec. 1, 1995. IEEE Press, Piscataway NJ.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. 3rd ed. Springer, Berlin, 1996.
S. Rolf, J. Sprave, and W. Urfer. Model identification and parameter estimation of ARMA models by means of evolutionary algorithms. In Proc. Third Conference on Computational Intelligence for Financial Engineering (IEEE/IAFE CIFEr), New York City, March 23–25, 1997.
M. Schütz. Eine Evolutionsstrategie für gemischt-ganzzahlige Optimierungsprobleme mit variabler Dimension, September 1994.
M. Schütz. Other operators: Gene duplication and deletion. In Th. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages C3.4:8–15. Oxford University Press, New York, and Institute of Physics Publishing, Bristol, 1997.
M. Schütz and J. Sprave. Application of parallel mixed-integer evolution strategies with mutation rate pooling. In L. J. Fogel, P. J. Angeline, and T. Bäck, editors, Proceedings of the Fifth Annual Conference on Evolutionary Programming, pages 345–354. The MIT Press, Cambridge, MA, 1996.
H.-P. Schwefel. Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. Wiley, New York, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sprave, J., Rolf, S. (1998). Variable-dimensional optimization with evolutionary algorithms using fixed-length representations. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040779
Download citation
DOI: https://doi.org/10.1007/BFb0040779
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64891-8
Online ISBN: 978-3-540-68515-9
eBook Packages: Springer Book Archive