Adaptive fitness functions have led to very successful evolutionary algorithms for the satisfiability problem. Although comparisons are available for benchmarks, a deeper understanding of the effects of adaptation is desirable. Therefore, we compare three approaches based on adapting weights. The dynamics of these weights motivate the use of decay factors, which significantly improve the success rate for two adaptation schemes. The most successful technique can be further improved by accelerating the adaptation process concerning difficult clauses.
CITATION STYLE
Gottlieb, J., & Voss, N. (2000). Adaptive fitness functions for the satisfiability problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1917, pp. 621–630). Springer Verlag. https://doi.org/10.1007/3-540-45356-3_61
Mendeley helps you to discover research relevant for your work.