| On 2011-05-16 at 14:30:00 (Brussels Time) |
Abstract
Tuning methods for selecting appropriate parameter configurations of optimization algorithms have been the object of several recent studies. The selection of the appropriate configuration may strongly impact on the performance of evolutionary algorithms. We study the performance of three memetic algorithms for the quadratic assignment problem when their parameters are tuned either off-line or on-line. Off-line tuning selects a priori one configuration to be used throughout the whole run for all the instances to be tackled. On-line tuning selects the configuration during the solution process, adapting parameter settings on an instance-per-instance basis, and possibly to each phase of the search. The results suggest that off-line tuning achieves a better performance than on-line tuning.
Keywords
tuning, QAP, memetic algorithm
