Abstract
We introduce a classifying measure of fitness landscapes — the density of states — for continuous and discrete problems, especially optimisation of sequences and graphs. By means of the Boltzmann strategy we obtain a simple algorithm to calculate the density of states for a given problem. Knowing the density of states we are able to approximate the optimal fitness value of the problem which makes it feasible to assess the effectivity of practical optimisations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andresen, B., 1989, Finite-Time Thermodynamics and Simulated Annealing, Proceedings of the Fourth International Conference on Irreversible Processes and Selforganization, Rostock.
Asselmeyer, T., Ebeling, W. and Rosé, H., 1996, Smoothing representation of fitness landscapes — the genotype-phenotype map of evolution, BioSystems 39, 63.
Bernasconi, J., 1987, Low autocorrelation binary sequences: statistical mechanics and configuration space analysis, J. Physique 48, 559.
Berry, R.S. and Kunz, R.E., 1993, Coexistence of Multiple Phases in Finite Systems, Phys. Rev. Lett. 71, 3987.
Boseniuk, T. and Ebeling, W., 1990, Boltzmann-, Darwin-and Haeckel-Strategies in Optimization Problems, (PPSN Dortmund).
Boseniuk, T., Ebeling, W., Engel A., 1987, Boltzmann and Darwin Strategies in Complex Optimization, Phys. Lett. A 125, 307.
Bouchard, J.P. and Mezard, M., 1994, J. Phys. France 4, 1109.
Conrad, M. and Ebeling, W., 1992, M.V. Volkenstein, Evolutionary thinking and the structure of fitness landscapes, BioSystems 27, 125.
Ebeling, W., Engel, A., Feistel, R., 1990, Physik der Evolutionsprozesse. (Akademie-Verlag, Berlin).
Ebeling, W., Rosé, H., Schuchhardt, J., 1994, Evolutionary Strategies for Solving Frustrated Problems, Proceedings, IEEE-WCCI, Orlando, June 27–29 1994, 79–81.
Fogel, L.J., 1962, Autonomous automata. Ind. Research 4, 14.
Fogel, D.B., 1995, Evolutionary computation — toward a new philosophy of machine intelligence. IEEE Press, (Piscataway NJ).
Golay, M.J.E., IEEE Transactions on Information Theory, IT-23, 43 (1977); IT-28, 543 (1982); IT-29, 934 (1983).
Goldberg D.E., 1989, Genetic Algorithms in search, optimization and machine learning, (Readin, MA: Addison-Wesley).
Husemoller, D. and Milnor, J., 1973, Symmetric Bilinear Forms, (Springer Verlag, Berlin).
Koza, J.R., 1992, Genetic programming: On the programming of computers by means of natural selection, (Cambridge, MA. MIT Press).
Rechenberg, I., 1973, Evolutionsstrategien — Optimierung technischer Systeme nach Principien der biologischen Information, (Friedrich Frommann Verlag (Günther Holzboog K.G.) Stuttgart — Bad Cannstatt).
Sibiani, P., Pedersen, K.M. and Hoffmann, K.H. and Salamon, P., 1990, Monte Carlo dynamics of optimization: A scaling description, Phys. Rev. A 42, 7080.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosé, H., Ebeling, W., Asselmeyer, T. (1996). The density of states — A measure of the difficulty of optimisation problems. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_985
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_985
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive