Abstract
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a particular interest because of its characteristics: it is NP-hard, it has a direct and important industrial application, it is easy-to-state and it shares some properties of the wellknown Ising spin glass model. Moreover, it is appropriate for the application of randomized algorithms: for local search heuristics because of its strong 2-dimensional local structure, and for Genetic Algorithms since there is a very natural and direct encoding which results in a variable alphabet. We present the problem from two points of view, an abstract view with a very simple definition of smoothness and the real-world application. We run local search, Genetic and Memetic Algorithms. We compare the direct encoding with unary and binary codings, and we try a 2-dimensional encoding. For a simple smoothness criterion, the Memetic Algorithm clearly performs best. However, if the smoothness citerion is more complex, the local search needs many function evaluations. Therefore we prefer the pure Genetic Algorithm for the application.
BMW Group, 80788 München, Germany.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Mitterer. Optimierung vielparametriger Systeme in der Antriebsentwicklung, Statistische Versuchsplanung und Künstliche Neuronale Netze in der Steuergeräteauslegung zur Motorabstimmung. PhD thesis, Lehrstuhl für Meßsystem-und Sensortechnik, TU München, 2000.
C. De Simone, M. Diehl, M. Jünger, P. Mutzel, G. Reinelt, and G. Rinaldi. Exact ground states of Ising spin glasses: New experimental results witha branchand cut algorithm. Journal of Statistical Physics, 80:487–496, 1995.
J. Poland. Finding smoothmaps is NP-complete. Preprint, 2001.
F. Barahona. On the computational complexity of ising spin glass model. J.Phys:A: Math.Gen., 15:3241–3253, 1982.
D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
J. Holland. Adaptions in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press, 1975.
T. N. Bui and B. R. Moon. On multidimensional encoding/crossover. In 6th International Conference on Genetic Algorithms, pages 49–56, 1995.
J. Poland, K. Knödler, and A. Zell. On the efficient arrangement of given points in a rectangular grid. In E. J. W. Boers et al., editor, Applications of Evolutionary Computation (LNCS 2037), pages 110–119, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poland, J., Knödler, K., Mitterer, A., Fleischhauer, T., Zuber-Goos, F., Zell, A. (2001). Evolutionary Search for Smooth Maps in Motor Control Unit Calibration. In: Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2001. Lecture Notes in Computer Science, vol 2264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45322-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-45322-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43025-4
Online ISBN: 978-3-540-45322-2
eBook Packages: Springer Book Archive