Authors: Reichel, Joachim
Skutella, Martin
Title: On the size of weights in randomized search heuristics
Language (ISO): en
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.
Subject Headings: analysis of algorithms and problem complexity
evolutionary algorithms
randomized search heuristics
theory of computation
Issue Date: 2008-08
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
25308.pdfDNB393.7 kBAdobe PDFView/Open

This item is protected by original copyright

If no CC-License is given, pleas contact the the creator, if you want to use thre resource other than only read it.