Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Languages: English
Types: Unknown
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 crossdomain performance of the algorithm, converting it from a poor performer in previous work to one of the stronger competitors.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] Steven Adriaensen, Gabriela Ochoa, and Ann Nowe´. A benchmark set extension and comparative study for the hyflex framework. In IEEE Congress on Evolutionary Computation, CEC 2015, Sendai, Japan, May 25-28, 2015, pages 784-791. IEEE, 2015.
    • [2] Alpay Alkan and Ender O¨zcan. Memetic algorithms for timetabling. In Evolutionary Computation, 2003. CEC'03. The 2003 Congress on, volume 3, pages 1796-1802. IEEE, 2003.
    • [3] Shahriar Asta and Ender O¨zcan. A tensor-based selection hyper-heuristic for cross-domain heuristic search. Information Sciences, 299:412-432, 2015.
    • [4] Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Barry McCollum, Gabriela Ochoa, Andrew J Parkes, and Sanja Petrovic. The cross-domain heuristic search challenge-an international research competition. In Learning and Intelligent Optimization, pages 631-634. Springer, 2011.
    • [5] Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender O¨zcan, and Rong Qu. Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12):1695-1724, 2013.
    • [6] Peter Cowling, Graham Kendall, and Eric Soubeiga. A hyperheuristic approach to scheduling a sales summit. In Practice and Theory of Automated Timetabling III, pages 176-190. Springer, 2001.
    • [7] A.E. Eiben and S.K. Smit. Evolutionary algorithm parameters and methods to tune them. In Youssef Hamadi, Eric Monfroy, and Frederic Saubion, editors, Autonomous Search, pages 15-36. Springer Berlin Heidelberg, 2012.
    • [8] Agoston E Eiben and Selmar K Smit. Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm and Evolutionary Computation, 1(1):19-31, 2011.
    • [9] Ping-Che Hsiao, Tsung-Che Chiang, and Li-Chen Fu. A variable neighborhood search-based hyperheuristic for cross-domain optimization problems in chesc 2011 competition.
    • [10] Hisao Ishibuchi and Shiori Kaige. Implementation of simple multiobjective memetic algorithms and its applications to knapsack problems. Int. J. Hybrid Intell. Syst., 1(1):22-35, 2004.
    • [11] Ahmed Kheiri and Ender O¨zcan. An iterated multi-stage selection hyperheuristic. European Journal of Operational Research, 2015.
    • [12] Natalio Krasnogor, BP Blackburne, Edmund K Burke, and Jonathan D Hirst. Multimeme algorithms for protein structure prediction. In Parallel Problem Solving from NaturePPSN VII, pages 769-778. Springer, 2002.
    • [13] Natalio Krasnogor, Jim Smith, et al. A memetic algorithm with selfadaptive local search: Tsp as a case study. In GECCO, pages 987-994, 2000.
    • [14] Mathieu Larose. A hyper-heuristic for the chesc 2011, 2011.
    • [15] Helena R Lourenc¸o, Olivier C Martin, and Thomas Stu¨tzle. Iterated local search: Framework and applications. In Handbook of Metaheuristics, pages 363-397. Springer, 2010.
    • [16] P. Merz and B. Freisleben. A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, volume 3, pages 2063-2070, 1999.
    • [17] Mustafa Mısır, Katja Verbeeck, Patrick De Causmaecker, and Greet Vanden Berghe. An intelligent hyper-heuristic framework for chesc 2011. In Learning and Intelligent OptimizatioN, pages 461-466. Springer, 2012.
    • [18] Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfler Calvo. An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research, 37(11):1877-1885, 2010.
    • [19] Gabriela Ochoa, Matthew Hyde, Tim Curtois, Jose A VazquezRodriguez, James Walker, Michel Gendreau, Graham Kendall, Barry McCollum, Andrew J Parkes, Sanja Petrovic, et al. Hyflex: A benchmark framework for cross-domain heuristic search. In Evolutionary Computation in Combinatorial Optimization, pages 136-147. Springer, 2012.
    • [20] Gabriela Ochoa, James Walker, Matthew Hyde, and Tim Curtois. Adaptive evolutionary algorithms and extensions to the hyflex hyper-heuristic framework. In Parallel Problem Solving from Nature-PPSN XII, pages 418-427. Springer, 2012.
    • [21] E. O¨zcan and E. Ersoy. Final exam scheduler - fes. In The 2005 IEEE Congress on Evolutionary Computation, volume 2, pages 1356-1363, 2005.
    • [22] E. O¨zcan and E. Onbasioglu. Memetic algorithms for parallel code optimization. International Journal of Parallel Programming, 35(1):33- 61, 2007.
    • [23] Ender O¨zcan, Shahriar Asta, and Cevriye Altintas. Memetic algorithms for cross-domain heuristic search. In Computational Intelligence (UKCI), 2013 13th UK Workshop on, pages 175-182. IEEE, 2013.
    • [24] R.K. Roy. A primer on the Taguchi method. Competitive manufacturing series. Van Nostrand Reinhold, 1990.
    • [25] Selmar K Smit and Agoston E Eiben. Comparing parameter tuning methods for evolutionary algorithms. In Evolutionary Computation, 2009. CEC'09. IEEE Congress on, pages 399-406. IEEE, 2009.
    • [26] Ji Ung Sun. A taguchi approach to parameter setting in a genetic algorithm for general job shop scheduling problem. IEMS, 6(2):119- 124, 2007.
    • [27] Gilbert Syswerda. A study of reproduction in generational and steady state genetic algorithms. Foundations of genetic algorithms, 2:94-101, 1991.
  • No related research data.
  • No similar publications.
  • BioEntity Site Name

Share - Bookmark

Cite this article