This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:mfe:ia [2017/04/20 18:29] stuetzle [Applications of a hybrid SLS algorithm framework] |
teaching:mfe:ia [2017/04/20 18:29] stuetzle [Automatic configuration of hybrid algorithms] |
||
|---|---|---|---|
| Line 348: | Line 348: | ||
| - | ===== Automatic configuration of hybrid algorithms ===== | + | ===== Automated configuration of hybrid algorithms ===== |
| We have recently developed a software framework from which hybrid local search algorithms can be designed automatically. This framework has only been applied to a few problems. The goal of this project would be to extend this framework to other problems, in particular, vehicle routing problems and to compare the results that can be obtained with the methods proposed in the literature. The student will learn to solve combinatorial optimization problems with heuristic algorithms, automatic configuration of optimization algorithms, and the analysis and comparison of optimization algorithms. | We have recently developed a software framework from which hybrid local search algorithms can be designed automatically. This framework has only been applied to a few problems. The goal of this project would be to extend this framework to other problems, in particular, vehicle routing problems and to compare the results that can be obtained with the methods proposed in the literature. The student will learn to solve combinatorial optimization problems with heuristic algorithms, automatic configuration of optimization algorithms, and the analysis and comparison of optimization algorithms. | ||