Evolutionary search algorithms are used routinely to find optimal solutions for multi-parameter problems, such as complex pulse shapes in coherent control experiments. The algorithms are based on evolving a set of trial solutions iteratively until an optimum is reached, at which point the experiment ends. We have extended this approach by recording the best solution in each iteration and subsequently applying these to a modified system. By studying the shape of the learning curves in different systems, features of the fitness landscape are revealed that aid in deriving the underlying control mechanisms. We illustrate our method with two example
If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track thei...
Evolutionary algorithms are general, randomized search heuristics that are influ-enced by many param...
Abstract If the optimization problem is dynamic, the goal is no longer to find the extrema, but to t...
Evolutionary search algorithms are used routinely to find optimal solutions for multi-parameter prob...
Abstract. Evolution strategies are inspired in biology and form part of a larger research field know...
In this thesis we investigate how intelligent techniques, such as Evolutionary Algorithms, can be ap...
The paper concerns the application of Genetic Algorithms and Genetic Programming to complex tasks su...
Evolutionary algorithms (EA) are efficient population-based stochastic algorithms for solving optimi...
Many physical systems of interest to scientists and engineers can be modeled using a partial differe...
In this paper we present a new evolutionary method for complex-process opti-mization. It is partiall...
International audienceThis paper presents a method to encapsulate parameters of evolutionary algorit...
In this paper, we investigate how adaptive operator selection techniques are able to efficiently man...
In this paper we examine a modification to the genetic algorithm. The variable local search ("V...
The purpose of this thesis is to examine the ability of evolutionary algorithms (EAs) to develop nea...
Abstract—Evolutionary Algorithms (EAs) use a simplified abstraction of biological evolution to inter...
If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track thei...
Evolutionary algorithms are general, randomized search heuristics that are influ-enced by many param...
Abstract If the optimization problem is dynamic, the goal is no longer to find the extrema, but to t...
Evolutionary search algorithms are used routinely to find optimal solutions for multi-parameter prob...
Abstract. Evolution strategies are inspired in biology and form part of a larger research field know...
In this thesis we investigate how intelligent techniques, such as Evolutionary Algorithms, can be ap...
The paper concerns the application of Genetic Algorithms and Genetic Programming to complex tasks su...
Evolutionary algorithms (EA) are efficient population-based stochastic algorithms for solving optimi...
Many physical systems of interest to scientists and engineers can be modeled using a partial differe...
In this paper we present a new evolutionary method for complex-process opti-mization. It is partiall...
International audienceThis paper presents a method to encapsulate parameters of evolutionary algorit...
In this paper, we investigate how adaptive operator selection techniques are able to efficiently man...
In this paper we examine a modification to the genetic algorithm. The variable local search ("V...
The purpose of this thesis is to examine the ability of evolutionary algorithms (EAs) to develop nea...
Abstract—Evolutionary Algorithms (EAs) use a simplified abstraction of biological evolution to inter...
If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track thei...
Evolutionary algorithms are general, randomized search heuristics that are influ-enced by many param...
Abstract If the optimization problem is dynamic, the goal is no longer to find the extrema, but to t...