Bilel Derbel
- Khulood Alyahya and Jonathan E Rowe. Simple random sampling estimation of the number of local optima. In International Conference on Parallel Problem Solving from <u>Nature</u>, pages 932--941. Springer, 2016.Google Scholar
Cross Ref
- Meriema Belaidouni and Jin-Kao Hao. An analysis of the configuration space of the maximal constraint satisfaction problem. In <u>PPSN VI : Proceedings of the 6th International Conference on Parallel Problem Solving from Nature</u>, pages 49--58, London, UK, 2000. Springer-Verlag.Google Scholar
- U. Bastolla, M. Porto, H. E. Roman, and M. Vendruscolo. Statiscal properties of neutral evolution. <u>Journal Molecular Evolution</u>, 57(S) :103--119, August 2003.Google Scholar
- Josselin Garnier and Leila Kallel. Efficiency of local search with multiple local optima. <u>SIAM Journal on Discrete Mathematics</u>, 15(1) :122--141, 2002.Google Scholar
- David E. Goldberg and Philip Segrest. Finite markov chain analysis of genetic algorithms. In <u>ICGA</u>, pages 1--8, 1987.Google Scholar
- M. Huynen. Exploring phenotype space through neutral evolution. <u>Journal Molecular Evolution</u>, 43 :165--169, 1996.Google Scholar
- E. Izquierdo-Torres. The role of nearly neutral mutations in the evolution of dynamical neural networks. In J. Pollack and al, editors, <u>Ninth International Conference of the Simulation and Synthesis of Living Systems (Alife 9)</u>, pages 322--327. MIT Press, 2004.Google Scholar
- T. Jones. <u>Evolutionary Algorithms, Fitness Landscapes and Search.</u> PhD thesis, University of New Mexico, Albuquerque, 1995.Google Scholar
- M. Kimura. <u>The Neutral Theory of Molecular Evolution.</u> Cambridge University Press, Cambridge, UK, 1983.Google Scholar
- Arnaud Liefooghe, Bilel Derbel, Sébastien Verel, Hernán Aguirre, and Kiyoshi Tanaka. <u>Towards Landscape-Aware Automatic Algorithm Configuration : Preliminary Experiments on Neutral and Rugged Landscapes</u>, pages 215--232. Springer International Publishing, Cham, 2017.Google Scholar
- Guanzhou Lu, Jinlong Li, and Xin Yao. Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms. In <u>European Conference on Evolutionary Computation in Combinatorial Optimization</u>, pages 108--117. Springer, 2011.Google Scholar
- Helge Rosé, Werner Ebeling, and Torsten Asselmeyer. The density of states - a measure of the difficulty of optimisation problems. In <u>Parallel Problem Solving from Nature</u>, pages 208--217, 1996.Google Scholar
- P. Schuster, W. Fontana, P. F. Stadler, and I. L. Hofacker. From sequences to shapes and back : a case study in RNA secondary structures. In <u>Proc. R. Soc. London B.</u>, volume 255, pages 279--284, 1994.Google ScholarCross Ref
- Peter F. Stadler. Landscapes and their correlation functions. <u>J. Math. Chem.</u>, 20 :1--45, 1996.Google ScholarCross Ref
- Sebastien Verel, Philippe Collard, and Manuel Clergue. Measuring the evolvability landscape to study neutrality. In M. Keijzer and et al., editors, <u>Poster at Genetic and</u> Evolutionary Computation - GECCO-2006, pages 613--614, Seatle, 8-12 July 2006. ACM Press.Google ScholarDigital Library
- E. D. Weinberger. Correlated and uncorrelatated fitness landscapes and how to tell the difference. In <u>Biological Cybernetics</u>, pages 63 :325--336, 1990.Google Scholar
- J. P. K. Doye. The network topology of a potential energy landscape : a static scale-free network. <u>Phys. Rev. Lett.</u>, 88 :238701, 2002.Google ScholarCross Ref
- Fabio Daolio, Marco Tomassini, Sébastien Verel, and Gabriela Ochoa. Communities of Minima in Local Optima Networks of Combinatorial Spaces. Physica A : Statistical Mechanics and its Applications, 390(9) :1684 -- 1694, July 2011.Google Scholar
- Fabio Daolio, Sébastien Verel, Gabriela Ochoa, and Marco Tomassini. Local optima networks and the performance of iterated local search. In <u>Proceedings of the fourteenth international conference on Genetic and</u> pages 369--376, Philadelphia, United States, July 2012. ACM.Google Scholar
- Fabio Daolio, Sébastien Verel, Gabriela Ochoa, and Marco Tomassini. Local Optima Networks of the Permutation Flow-Shop Problem. In Springer, editor, <u>International Conference on Artificial Evolution (EA 2013)</u>, Lecture Notes in Computer Science, pages -, Bordeaux, France, October 2013.Google Scholar
- S. A. Kauffman. <u>The Origins of Order.</u> Oxford University Press, New York, 1993.Google Scholar
- Gabriela Ochoa, Marco Tomassini, Sébastien Verel, and Christian Darabos. A Study of NK Landscapes' Basins and Local Optima Networks. In <u>Proceedings of the 10th annual conference on Genetic and evolutionary computation Genetic And Evolutionary Computation Conference</u>, pages 555--562, Atlanta États-Unis d'Amérique, 07 2008. ACM New York, NY, USA. best paper nomination.Google Scholar
- Frank H Stillinger and Thomas A Weber. Packing structures and transitions in liquids and solids. <u>Science(Washington, DC)</u>, 225(4666) :983--9, 1984.Google Scholar
- Marco Tomassini, Sébastien Verel, and Gabriela Ochoa. Complex-network analysis of combinatorial spaces : The NK landscape case. <u>Physical Review E : Statistical, Nonlinear, and Soft Matter Physics</u>, 78(6) :066114, 12 2008. 89.75.Hc ; 89.75.Fb ; 75.10.Nr.Google Scholar
- Sébastien Verel, Gabriela Ochoa, and Marco Tomassini. The Connectivity of NK Landscapes' Basins : A Network Analysis. In <u>Proceedings of the Eleventh International Conference on the Simulation and Synthesis of Living Systems Artificial Life XI</u>, pages 648--655, Winchester France, 08 2008. MIT Press, Cambridge, MA. tea team.Google Scholar
- Sébastien Verel, Gabriela Ochoa, and Marco Tomassini. Local Optima Networks of NK Landscapes with Neutrality. <u>IEEE Transactions on Evolutionary Computation</u>, volume 14(6) :783 -- 797, November 2010.Google Scholar
Index Terms
- Fitness landscape analysis to understand and predict algorithm performance for single- and multi-objective optimization
Index terms have been assigned to the content through auto-classification.
Recommendations
A New Fitness-Landscape-Driven Particle Swarm Optimization
Intelligent Computing Theories and ApplicationAbstractFitness landscape is an evolutionary mechanism and fitness landscape theory has developed considerably since it was proposed by Sewall Wright in the 1930s. In evolutionary algorithms, some characteristic information by analyzing the fitness ...
Bag of local landscape features for fitness landscape analysis
Evolutionary computation is a research field dealing with black-box and complex optimization problems whose fitness landscapes are usually unknown in advance. It is difficult to select an appropriate evolutionary algorithm and parameters for a given ...
A novel multi-population coevolution strategy for single objective immune optimization algorithm
A novel multi-population coevolution strategy for single objective immune optimization algorithm (MCIA) is proposed to solve numerical and engineering optimization problem in real world from the inspiration that how neuro-endocrine system affects T ...
Comments