Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling
Speaker:Prof. Frank Neumann
coming from:University of Adelaide
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Friday, 15 May 2015
Duration:30 Minutes
Building:E1 4
Evolutionary algorithms have been frequently used for
dynamic optimization problems. With this paper, we contribute to the
theoretical understanding of this research area. We present the
first computational complexity analysis of evolutionary algorithms

for a dynamic variant of a classical combinatorial optimization
problem, namely makespan scheduling. We study the model of a strong
adversary which is allowed to change one job at regular intervals.
Furthermore, we investigate the setting of random changes. Our
results show that randomized local search and a simple evolutionary
algorithm are very effective in dynamically tracking changes made to
the problem instance.
Joint work with Carsten Witt
To appear at IJCAI 2015

Name(s):Christina Fries
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Christina Fries, 04/21/2015 10:30 AM -- Created document.