An investigation of tuning a memetic algorithm for cross-domain search

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.

[1]  Hisao Ishibuchi,et al.  Implementation of Simple Multiobjective Memetic Algorithms and Its Applications to Knapsack Problems , 2004, Int. J. Hybrid Intell. Syst..

[2]  R. Roy.  A Primer on the Taguchi Method , 1990 .

[3]  Ender Özcan,et al.  A tensor-based selection hyper-heuristic for cross-domain heuristic search , 2015, Inf. Sci..

[4]  Patrick De Causmaecker,et al.  An Intelligent Hyper-Heuristic Framework for CHeSC 2011 , 2012, LION.

[5]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

[6]  Sanja Petrovic,et al.  The Cross-Domain Heuristic Search Challenge - An International Research Competition , 2011, LION.

[7]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[8]  Sanja Petrovic,et al.  HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search , 2011, EvoCOP.

[9]  A. E. Eiben,et al.  Comparing parameter tuning methods for evolutionary algorithms , 2009, 2009 IEEE Congress on Evolutionary Computation.

[10]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[11]  Gabriela Ochoa,et al.  Adaptive Evolutionary Algorithms and Extensions to the HyFlex Hyper-heuristic Framework , 2012, PPSN.

[12]  J. U. Sun.  A Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem , 2015 .

[13]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[14]  Ender Özcan,et al.  Memetic algorithms for Cross-domain Heuristic Search , 2013, 2013 13th UK Workshop on Computational Intelligence (UKCI).

[15]  A. Alkan,et al.  Memetic algorithms for timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[16]  Jim Smith,et al.  A Memetic Algorithm With Self-Adaptive Local Search: TSP as a case study , 2000, GECCO.

[17]  Gilbert Syswerda,et al.  A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.

[18]  A. E. Eiben,et al.  Parameter tuning for configuring and analyzing evolutionary algorithms , 2011, Swarm Evol. Comput..

[19]  Edmund K. Burke,et al.  Multimeme Algorithms for Protein Structure Prediction , 2002, PPSN.

[20]  Ender Özcan,et al.  An iterated multi-stage selection hyper-heuristic , 2016, Eur. J. Oper. Res..

[21]  Ender Özcan,et al.  Memetic Algorithms for Parallel Code Optimization , 2004, International Journal of Parallel Programming.

[22]  A. E. Eiben,et al.  Evolutionary Algorithm Parameters and Methods to Tune Them , 2012, Autonomous Search.

[23]  Gabriela Ochoa,et al.  A benchmark set extension and comparative study for the HyFlex framework , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[24]  B. Freisleben,et al.  A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[25]  Ender Özcan,et al.  Final exam scheduler - FES , 2005, 2005 IEEE Congress on Evolutionary Computation.