Abstract
A major issue while conceiving or parameterizing an optimization heuristic is to ensure an appropriate balance between exploitation and exploration of the search. Evolution strategies and neighborhood-based metaheuristics constitute relevant high-level frameworks, which ease the problem solving but are often complex to configure. Moreover, their effective behavior, according to the particularities of the search landscapes, remains difficult to grasp. In this paper, we deeply investigate the sampled walk search algorithm, which is a local search equivalent of the \((1,\lambda )\)-evolution strategy, considering that the neighborhood relation describes mutation possibilities. We specifically designed experiments to better understand the behavior of such a strategy offering a fine way to deal with the exploration versus exploitation dilemma. The main contribution is the analysis of search trajectories by evaluating and visualizing both their width (exploration) and their height (exploitation). More generally, we aim at bringing insights about the behavior of the \((1,\lambda )\)-ES in a discrete optimization context and within a fitness landscape perspective.
Similar content being viewed by others
References
Amitrano C, Peliti L, Saber M (1989) Population dynamics in a spin-glass model of chemical evolution. J Mol Evol 29(6):513–525
Back T, Hoffmeister F, Schwefel H-P (1991) A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms, vol 2. Morgan Kaufmann Publishers San Mateo, CA
Basseur M, Goëffon A (2013) Hill-climbing strategies on various landscapes: an empirical comparison. In: Proceedings of the 15th annual conference on Genetic and evolutionary computation, pp 479–486
Beyer H-G, Schwefel H-P (2002) Evolution strategies—a comprehensive introduction. Nat Comput 1(1):3–52
Cai J, Thierauf G (1996) Evolution strategies for solving discrete optimization problems. Adv Eng Softw 25(2–3):177–183
Daolio F, Liefooghe A, Verel S, Aguirre H, Tanaka K (2017) Problem features versus algorithm performance on rugged multiobjective combinatorial fitness landscapes. Evolut Comput 25(4):555–585
Garey MR (1979) A guide to the theory of NP-completeness. Computers and intractability
Glover F, Laguna M (1998) Tabu search. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization. Springer, Berlin, pp 2093–2229
Hansen N, Müller SD, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolut Comput 11(1):1–18
Hoos HH, Stützle T (2004) Stochastic local search: foundations and applications. Elsevier, Amsterdam
Hordijk W (1996) A measure of landscapes. Evolut Comput 4(4):335–360
Jones TC (1995) Evolutionary algorithms, fitness landscapes and search. PhD thesis, CiteseerD
Kauffman SA, Weinberger ED (1989) The NK model of rugged fitness landscapes and its application to maturation of the immune response. J Theor Biol 141(2):211–245
Kirkpatrick S, Daniel Gelatt C, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680
Lissack MR (1999) Complexity: the science, its vocabulary, and its relation to organizations. Emergence 1(1):110–126
Lourenço HR, Martin OC, Stützle T (2003) Iterated local search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Springer, Berlin, pp 320–353
Malan KM, Engelbrecht AP (2013) A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf Sci 241:148–163
Merz P (2004) Advanced fitness landscape analysis and the performance of memetic algorithms. Evolut Comput 12(3):303–325
Neveu B, Trombettoni G, Glover F (2004) ID walk: a candidate list strategy with a simple diversification device. In: Wallace M (ed) International conference on principles and practice of constraint programming. Springer, Berlin, pp 423–437
Ochoa G, Malan KM, Blum C (2020) Search trajectory networks of population-based algorithms in continuous spaces. In: Castillo P, Jiménez LJ, FernándezdeVega F (eds) International conference on the applications of evolutionary computation. Springer, Berlin, pp 70–85
Ochoa G, Tomassini M, Vérel S, Darabos C (2008) A study of NK landscapes’ basins and local optima networks. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp 555–562
Palmer ME, Smith SJ (1992) Improved evolutionary optimization of difficult landscapes: control of premature convergence through scheduled sharing. Complex Syst 5(5):443–458
Palubeckis G (2004) Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann Oper Res 131(1–4):259–282
Pitzer E, Affenzeller M (2012) A comprehensive survey on fitness landscape analysis. In: Fodor J, Klempous R, Suárez Araujo CP (eds) Recent advances in intelligent engineering systems, Springer, Berlin, pp 161–191
Richter H (2014) Fitness landscapes: from evolutionary biology to evolutionary computation. In: Richter H, Engelbrecht A (eds) Recent advances in the theory and application of fitness landscapes. Springer, Berlin, pp 3–31
Richter H, Engelbrecht A (2014) Recent advances in the theory and application of fitness landscapes. Springer, Berlin
Stadler PF (2002) Fitness landscapes. In: Lässig M, Valleriani A (eds) Biological evolution and statistical physics. Springer, Berlin, pp 183–204
Tari S, Basseur M, Goëffon A (2016) Toward the design of efficient pivoting rules for local search. In: Proceedings of the 2016 on genetic and evolutionary computation conference companion, pp 55–56
Tari S, Basseur M, Goëffon A (2017) Sampled walk and binary fitness landscapes exploration. In: Lutton E, Legrand P, Parrend P, Monmarché N, Schoenauer M (eds) International conference on artificial evolution. Springer, Berlin, pp 47–57
Tari S, Basseur M, Goëffon A (2018) Worst improvement based iterated local search. In: Liefooghe A, López-Ibáñez M (eds) Evolutionary computation in combinatorial optimization. Springer, Berlin, pp 50–66
Vassilev VK, Fogarty TC, Miller JF (2003) Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In: Ghosh A, Tsutsui S (eds) Advances in evolutionary computing. Springer, Berlin, pp 3–44
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67–82
Wright S (1932) The roles of mutation, inbreeding, crossbreeding, and selection in evolution
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Tari, S., Basseur, M. & Goëffon, A. On the use of \((1,\lambda )\)-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat Comput 20, 345–361 (2021). https://doi.org/10.1007/s11047-020-09822-2
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-020-09822-2