Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme

Prof. Günther Raidl gave an excellent talk on the hybridization of metaheuristics with exact methods. He gave an introduction of the topic, showed several hybridization approaches and proceeded to talk about two case studies in which a hybridization has been successful. In the first case he showed an improved hybrid algorithm to solve the Knapsack Constrained Maximum Spanning Tree Problem and in the second case he showed how a combination of Variable Neighborhood Search with Column Generation successfully optimizes a fiber-optic network topology problem. He concludes that the results are very promising, but that tuning and design are still very difficult tasks.

Download:

Raidl - Hybrid Metaheuristics.pdf (~600kb; English)