Efficiency of local search with multiple local optima

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 1, 2001, Pages 122-141

  Garnier, Josselin ^a   Kallel, Leila ^b  

^a INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

^b CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

Combinatorial complexity; Local search; Neighborhood graph; Randomized starting solution

Indexed keywords

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; RANDOM PROCESSES;

COMBINATORIAL COMPLEXITY; LOCAL SEARCH; NEIGHBOURHOOD GRAPHS; RANDOMIZED STARTING SOLUTIONS;

PROBLEM SOLVING;

EID: 10844231176     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199355225     Document Type: Article

References (29)

1. R. AZENCOTT, Grandes déviations et applications, in Proceedings of Ecole d'Eté de Probabilités de Saint-Flour, P L. Hennequin, ed., Springer-Verlag, Berlin, 1980, pp. 1-176.
2. S. BALUJA, An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics, Technical Report CMU-CS-95-193, Carnegie Mellon University, Pittsburgh, PA, 1995.
3. H. CRAMER, Mathematical Methods of Statistics, Princeton University Press, Princeton, NJ, 1946.
4. R. DURRETT, Probability: Theory and Applications, Wadsworth and Brooks/Cole, Pacific Grove, CA, 1991.
5. W. FELLER, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1971.
6. D. B. FOGEL AND A. GHOZEIL, Using fitness distributions to design more efficient evolutionary computations, in Proceedings of the Third IEEE International Conference on Evolutionary Computation, T. Fukuda, ed., IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 11-19.
7. D. E. GOLDBERG, Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, MA, 1989.
8. J. H. HOLLAND, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI. 1975.
9. T. JONES AND S. FORREST, Fitness distance correlation as a measure of problem difficulty for genetic algorithms, in Proceedings of the 6th International Conference on Genetic Algorithms, L. J. Eshelman, ed., Morgan Kaufmann, San Francisco, CA, 1995, pp. 184-192.
10. L. KALLEL, Convergence des algorithmes génétiques : aspects spatiaux et temporels, Ph.D. thesis, Ecole Polytechnique, Palaiseau, France, 1998.
11. L. KALLEL, B. NAUDTS, AND M. SCHOENAUER, On functions with a fixed fitness distance relation, in Proceedings of the 1999 Congress on Evolutionary Computation (ICBC'99), IEEE, 1999, pp. 1910-1916.
12. L. KALLEL AND M. SCHOENAUER, Alternative random initialization in genetic algorithms, in Proceedings of the 7th International Conference on Genetic Algorithms, Th. Bäeck, ed., Morgan Kaufmann, San Francisco, CA, 1997, pp. 268-275.
13. L. KALLEL AND M. SCHOENAUER, A priori predictions of operator efficiency, in Artificial Evolution'97, Lecture Notes in Comput. Sci. 1363, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, eds., Springer-Verlag, Berlin, 1997.
14. B. MANDERICK, M. DE WEGER, AND P. SPIESSENS, The genetic algorithm and the structure of the fitness landscape, in Proceedings of the 4th International Conference on Genetic Algorithms, R. K. Belew and L. B. Booker, eds., Morgan Kaufmann, San Francisco, CA, 1991, pp. 143-150.
15. P. MERZ AND B. FREISLEBEN, Memetic algorithms and the fitness landscape of the graph bipartitioning problem, in Proceedings of the 4th Conference on Parallel Problems Solving from Nature, Lecture Notes in Comput. Sci. 1498, A. E. Eiben, Th. Bäeck, M. Schoenauer, and H.-P. Schwefel, eds., Springer-Verlag, Berlin, 1998, pp. 765-774.
16. C. H. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
17. G. PARISI, M. MEZARD, AND M. A. VIRASORO, Spin Glass Theory and Beyond, World Scientific, Teaneck, NJ, 1987.
18. R. PYKE, Spacings, J. Roy. Statist. Soc. Ser. B, 27 (1965), pp. 395-449.
19. R. J. QUICK, V. J. RAYWARD-SMITH, AND G D. SMITH, Fitness distance correlation and ridge functions, in Proceedings of the 4th Conference on Parallel Problems Solving from Nature, Lecture Notes in Comput. Sci. 1498, A. E. Eiben, Th. Bäeck, M. Schoenauer, and H.-P. Schwefel, eds., Springer-Verlag, Berlin, 1998, pp. 77-86.
20. R. RAMMAL, G. TOULOUSE, AND M. A. VIRASORO, Ultrametricity for physicists, Rev. Modern Phys., 58 (1986), pp. 765-788.
21. V. SLAVOV AND N. I. NIKOLAEV, Genetic algorithms, fitness sublandscapes and subpopulations, in Foundations of Genetic Algorithms 5, W. Banzhaf and C. Reeves. eds., Morgan Kaufmann, San Francisco, CA, 1998.
22. P. STADLER, Complex systems and binary networks, in Towards a Theory of Landscapes, Springer-Verlag, Berlin, 1995, pp. 77-163.
23. P. STADLER, Landscapes and their correlation functions, J Math. Chem., 20 (1996), pp. 1-45.
24. C. A. TOVEY, Local improvement on discrete structures, in Local Search and Combinatorial Optimization, E. Aaarts and J. K. Lenstra, eds., Wiley, New York, 1997, pp. 57-89.
25. C. A. TOVEY, Hill climbing with multiple local optima, SIAM J. Alg. Disc. Math., 6 (1985), pp. 384-393.
26. P. J. VAN LAARHOVEN AND E. H. L AARTS, Simulated Annealing: Theory and Applications, Kluwer Academic Press, Dordrecht, The Netherlands, 1987.
27. E. D WEINBERGER, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics, 63 (1990), pp. 325-336.
28. G. B. WETHERILL, Elementary Statistical Methods, Chapman and Hall, London, 1972.
29. S. S. WILKS, Mathematical Statistics, Wiley, New York, 1962.