direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 2009

On the Size of Weights in Randomized Search Heuristics
Zitatschlüssel Report-031-2008
Autor Joachim Reichel and Martin Skutella
Jahr 2008
Nummer 031
Notiz To appear in Proceedings of the 10th Foundations of Genetic Algorithms, 2009.
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search heuristic does not change. Upper bounds on the size of the new, equivalent weights allow us to obtain upper bounds on the expected runtime of such randomized search heuristics independent of the size of the actual weights. Furthermore we give lower bounds on the largest weights for worst-case instances. Finally we present some experimental results, including examples for worst-case instances.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag