Memetic algorithms, which hybridise evolutionary algorithms with local search, are well-known metaheuristics for solving combinatorial optimisation problems. A common issue with the application of a memetic algorithm is determining the best initial setting for the algorithmic parameters, but these can greatly influence its overall performance. Unlike traditional studies where parameters are tuned for a particular problem domain, in this study we do tuning that is applicable to cross-domain search. We extend previous work by tuning the parameters of a steady state memetic algorithm via a ‘design of experiments’ approach and provide surprising empirical results across nine problem domains, using a cross-domain heuristic search tool, namely HyFlex. The parameter tuning results show that tuning has value for cross-domain search. As a side gain, the results suggest that the crossover operators should not be used and, more interestingly, that single point based search should be preferred over a population based search, turning the overall approach into an iterated local search algorithm. The use of the improved parameter settings greatly enhanced the cross-domain performance of the algorithm, converting it from a poor performer in previous work to one of the stronger competitors.
['Düriye Betül Gümüş', 'Ender Özcan', 'Jason A. D. Atkin']
An investigation of tuning a memetic algorithm for cross-domain search