EVOlutionary Learning by Intelligent Variation and choice of suitable Operator sets

Internally funded project


Project Details

Project leader:
Prof. Dr.-Ing. Jürgen Teich

Project members:
Prof. Dr.-Ing. Christian Haubelt
Sanaz Mostaghim

Contributing FAU Organisations:
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Technische Fakultät

Acronym: EVOLIVO
Start date: 01/10/1998
End date: 31/03/2005


Abstract (technical / expert description):


EVOLIVO - EVOlutionary Learning by Intelligent Variation and choice of suitable Operator sets – is the name of our project describing our research in the area of Evolutionary Algorithms and Programs including problems of analysis, improvement and on-line adaptation of existing standard operator sets (basically selection and recombination) and the development of new problem-specific operator sets and their application to problems of technical interest, in particular to automatic system synthesis. Recent research was focused on multi-objective optimization with uncertain objectives. Here, it is assumed that the objectives of a solution are not precisely known, but are given by intervals. These intervals determine the minimal and maximal values of an objective. An essential notion in multi-objective optimization is the term dominance describing the superiority of a solution over another solution. In case of uncertain objectives the dominance is no longer defined. This obviously restricts the use of multi-objective optimization methods in the presence of fuzzy objectives. In the EVOLIVO project we succeeded to generalize these optimization strategies by defining the so-called probability of dominance regarding uncertain objectives. These results are expected to have impact on other research areas outside the domain of embedded systems. Last year we successfully applied these multi-objective optimization strategies to the task of automatic design space exploration. Therein we proposed methods for hierarchical design space exploration using a class of so-called Pareto-Front-Arithmetics for the accelerated design space exploration. The idea of Pareto-Front-Arithmetics is that generally, optimization problems are of hierarchical nature and can be decomposed into sub-problems. By combining the partial results of the optimization, we have to consider the problem that, in general, a global optimum is not composed of optima of its sub-problems. This only holds for monotonous objective functions. The contribution of this project is that we have shown the viability of the combination of partial results leading to uncertain objectives for the top-level optimization problem. By using the dominance probability, we separated the optimization problem and we were able to construct good approximations of the overall solutions in a short time. Future work will focus on the integration of population-based optimization methods into dynamic systems. We will analyze the usability of these methods for online optimization. Target architectures are networked embedded systems. Beside Evolutionary Algorithms we will explore novel population-based optimization strategies like Ant Colony Optimization and Particle Swarm Optimization.



Publications
Go to first page Go to previous page 1 of 2 Go to next page Go to last page

Helwig, S., Haubelt, C., & Teich, J. (2005). Modeling and analysis of indirect communication in Particle Swarm Optimization. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation (pp. 1246-1253). Edinburgh, GB.
Mostaghim, S., & Teich, J. (2005). Quad-trees: A Data structure for storing Pareto-sets in Multi-objective Evolutionary Algorithms with Elitism. In Ajith Abraham and Lakhmi Jain and Robert Goldberg (Eds.), Evolutionary Multiobjective Optimization (pp. 81-104). London: Springer.
Mostaghim, S., & Teich, J. (2004). Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization. In Proceedings of the Congress on Evolutionary Computation (CEC '04) (pp. 1404-1411). Portland, OR, US.
Frauenheim, T., Hoffmann, M., König, P., Mostaghim, S., & Teich, J. (2004). Molecular Force Field Parameterization using Multi-Objective Evolutionary Algorithms. In Proceedings of the Congress on Evolutionary Computation (CEC '04) (pp. 212-219). Portland, US.
Bambha, N., Bhattacharyya, S.S., Teich, J., & Zitzler, E. (2004). Systematic Integration of Parameterized Local Search Techniques in Evolutionary Algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (pp. 383-384). Seattle, Washington, US: Berlin, Heidelberg: Springer-verlag.
Dellnitz, M., Mostaghim, S., Schütze, O., & Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In Proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization (EMO) (pp. 118-132). Faro, PT: Springer-verlag.
Haubelt, C., Mostaghim, S., Slomka, F., Teich, J., & Tyagi, A. (2003). Hierachical Synthesis of Embedded Systems Using Evolutionary Algorithms. In Drechsler, R. and Drechsler, N (Eds.), Evolutionary Algorithms in System Design (pp. 63-104). Boston, Dordrecht, London: Kluwer Academic Publishers.
Teich, J., Haubelt, C., Mostaghim, S., & Tyagi, A. (2003). Solving hierarchical optimization problems using MOEAs. In Carlos M. Fonseca, Peter J. Fleming, Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele (Eds.), Evolutionary Multi-Criterion Optimization (pp. 162-176). Berlin, Heidelberg, New York: Springer.
Mostaghim, S., & Teich, J. (2003). Strategies for finding good local guides in multi-objective particle swarm optimization. In Proceedings of the Swarm Intelligence Symposium (pp. 26-33). Indianapolis, US.
Mostaghim, S., & Teich, J. (2003). The role of e-dominance in Multi-Objective Particle Swarm Optimization Methods. In Proceedings of the Congress on Evolutionary Computation (CEC'03) (pp. 1764-1771). Canberra, AU: IEEE Computer Society.

Last updated on 2018-22-11 at 17:22