Evolutionary algorithms have been shown to be effective in providing config
uration optimisation to dynamic load balancing in distributed database syst
ems and Web sewers. This paper explores the tuning parameter performance pr
ofile of such techniques over a variety of problems, including the adaptive
distributed database management problem (ADDMP), focusing on a range of in
teresting and important features. The ability of the evolutionary search pr
ocess to reliably find good solutions to a dynamic problem in a minimal and
consistent run-time is of paramount importance when considering their appl
ication to real-time industrial control problems. This paper demonstrates t
he existence of certain optimal parameter values, particularly for the rate
of applied mutation, which are shown to produce consistently good problem
solutions in a low number of evaluations with a minimum standard deviation.