Abstract
In this paper, we propose a simple and efficient method for measuring the spatial dispersion of a set of points in a metric space. This method allows the quantifying of the population diversity in genetic algorithms. It can also be used to measure the spatial dispersion of any local search process during a specified time interval. We then use this method to study the way Walksat explores its search space, showing that the search for a solution often includes several stages of intensification and diversification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barker A.L., Martin W.N.: Dynamics of a Distance Based Population Diversity Measure. Congress on Evolutionary Computation, IEEE Press, 2000.
Chvátal V., Szemerédi E.: Many hard examples for Resolution. In Journal of the ACM, pages 759–768, 1988.
Cook S.A.: The complexity of theorem proving procedures. In Conference Records of Third Annual ACM Symposium on Theory of Computing, pages 151–158, 1971.
Dubois O., Andre P., Boufkhad Y., Carlier J.: SAT versus UNSAT. In Clique, Coloring and Satisfiability: Second DIMACS implementation challenge, Volume 26 of DIMACS series in Discrete Mathematics and Computer Science, pages 415–136, American Mathematical Society, 1996.
Frank J., Cheeseman P., Stutz, J. (to appear): When gravity fails: local search topology. Gupta and Nau (1992). On the complexity of blocks-world planning. Artificial Intelligence (1997) 56, 139–403
Goldberg D.E., Richardson J.J.: Genetic algorithms with sharing for multimodal function optimization. Gen. Algs. and their Apps.: Proc. 2nd Intl. Conf. Gen. Algs., Cambridge, MA, July 1987, 28–31 (Lawrence Erlbaum).
Jones T., Forest S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In Proceedings of the 6th International Conference on Genetic Algorithms (1995) 184–192.
Mauldin M.L.: Maintaining diversity in genetic search. In Proceedings of the National Conference on AI (1984) 247–250. AAAI.
McAllester D., Selman B., Kautz H.: Evidence for Invariants in Local Search. In Proceedings of AAAI-97 (1997) 321–326.
Michalewicz Z.: Genetic algorithms + Data Structures = Evolution Programs. Artificial Intelligence, Springer Verlag. New York, 1992.
Miller B.L., Shaw M.J.: Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization. IEEE International Conference on Evolutionary Computation, pp786–791, Piscataway, NJ: IEEE Press 1995.
Schuurmans D., Southey F.: Local search characteristics of incomplete SAT procedures. In Proceedings of the Seventeenth National Conference on Articial Intelligence (AAAI-2000), pages 297–302, 2000.
Sefrioui M., Périaux J.: Fast convergence thanks to diversity. In Proc. of the Fifth Annual Conference on Evolutionary Programming (1996) 313–321
Selman B., Kautz H., Cohen, B.: Noise Strategies for Local Search. In Proceedings of AAAI-94 (1994) 337–343.
Sidaner A., Chabrier J.-J., Bailleux O.: Towards a quantification of attraction in stochastic local search. Proc. of the Workshop on Empirical Methods in Artificial Intelligence at ECAI’00, Berlin, Germany, pp 39–41, August 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-VerlagBerlin Heidelberg
About this paper
Cite this paper
Sidaner, A., Bailleux, O., Chabrier, JJ. (2002). Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat. In: Collet, P., Fonlupt, C., Hao, JK., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2001. Lecture Notes in Computer Science, vol 2310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46033-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-46033-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43544-0
Online ISBN: 978-3-540-46033-6
eBook Packages: Springer Book Archive