TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)2009

COGA 5-Wheel

Page Content

to Navigation

Preprints 2009

On the Size of Weights in Randomized Search Heuristics
Citation key Report-031-2008
Author Joachim Reichel and Martin Skutella
Year 2008
Number 031
Note To appear in Proceedings of the 10th Foundations of Genetic Algorithms, 2009.
Institution Technische Universität Berlin, Institut für Mathematik
Abstract 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.
Bibtex Type of Publication Preprint
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe