Zobrazeno 1 - 10
of 150
pro vyhledávání: '"Verel, Sébastien"'
Publikováno v:
Evolutionary Computation in Combinatorial Optimization Conference (evoCOP), Apr 2024, Aberystwyth, United Kingdom
The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the phase transition of the QAP, which can be described as a dramatic chang
Externí odkaz:
http://arxiv.org/abs/2403.02783
Publikováno v:
International Conference on Artificial Evolution (Evolution Artificielle), Oct 2017, Paris, France. pp.30-46
In the context of the introduction of intermittent renewable energies, we propose to optimize the main variables of the control rods of a nuclear power plant to improve its capability to load-follow. The design problem is a black-box combinatorial op
Externí odkaz:
http://arxiv.org/abs/2107.11201
Autor:
Dreo, Johann, Liefooghe, Arnaud, Verel, Sébastien, Schoenauer, Marc, Merelo, Juan J., Quemy, Alexandre, Bouvier, Benjamin, Gmys, Jan
The success of metaheuristic optimization methods has led to the development of a large variety of algorithm paradigms. However, no algorithm clearly dominates all its competitors on all problems. Instead, the underlying variety of landscapes of opti
Externí odkaz:
http://arxiv.org/abs/2105.00420
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
This paper introduces a novel theoretically sound approach for the celebrated CMA-ES algorithm. Assuming the parameters of the multi variate normal distribution for the minimum follow a conjugate prior distribution, we derive their optimal update at
Externí odkaz:
http://arxiv.org/abs/1904.01401
Publikováno v:
In Applied Soft Computing Journal March 2023 136
Publikováno v:
Natural Computing; Jun2024, Vol. 23 Issue 2, p431-451, 21p
Publikováno v:
In Computers and Electronics in Agriculture January 2021 180
This work studies the behavior of three elitist multi- and many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set. Several search-assessment indicators are defined to trace the dynamics of survival
Externí odkaz:
http://arxiv.org/abs/1409.7478
Recently, there has been a renewed interest in decomposition-based approaches for evolutionary multiobjective optimization. However, the impact of the choice of the underlying scalarizing function(s) is still far from being well understood. In this p
Externí odkaz:
http://arxiv.org/abs/1409.5752