This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:mfe:ia [2017/04/20 18:33] stuetzle |
teaching:mfe:ia [2018/03/23 11:43] stuetzle [MFE 2015-2016 : Intelligence Artificielle] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MFE 2015-2016 : Intelligence Artificielle ====== | + | ====== MFE 2016-2017 : Intelligence Artificielle ====== |
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 227: | Line 227: | ||
| - | ===== Software framework for ant colony optimization ===== | + | ===== Automated configuration of multi-objective continuous optimizers ===== |
| - | Ants have inspired a number of computational techniques and among the most successful is ant colony optimization (ACO). ACO is an optimization technique that can be applied to tackle a wide variety of computational problems that arise in computer science, telecommunications, and engineering. While ACO has a very wide applicability, the development times for effective ACO algorithms can be relatively high. This is due to the fact that each time a new problem is to be tackled by an ACO algorithm, a researcher needs to implement the algorithms almost from scratch. | + | Many problems arising in real-world applications involve the optimization of various, often conflicting objectives. While the design of algorithms for tackling multi-objective problems has usually done manually, over the recent years automated design methodologies have been established and proved to be very powerful. |
| - | The goal of the project is to provide a software framework to support the application and the implementation of ACO algorithms to new problems. The software framework will offer all the standard procedures that are used in ACO algorithms and will allow for the rapid prototyping of ACO algorithms. | + | The goal of this project is to extend the automated design to multi-objective continuous optimization problems. As the basis of the approach, a framework based on the two-phase plus Pareto local search approach will be developed into which basic search techniques for continuous optimization will be integrated. The goal is to build first a flexible framework from which then in a second step effective multi-objective optimizers will be generated exploiting automated algorithm design techniques. The final goal of this work is to participate in algorithm competitions with the goal of challenging the methodology. |
| - | The application of this software framework will be tested on a number of optimization problems. | + | |
| - | Required skills: The candidate should be well acquainted with programming in object oriented languages. | + | Required skills: The candidate should have very good analytical as well as programming skills. |
| * Contacts : | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | ||
| * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] | ||