Abstract
This paper proposes an evolutionary-based iterative local search hyper-heuristic approach called Iterated Search Driven by Evolutionary Algorithm Hyper-Heuristic (ISEA). Two versions of this algorithm, ISEA-chesc and ISEA-adaptive, that differ in the re-initialization scheme are presented. The performance of the two algorithms was experimentally evaluated on six hard optimization problems using the HyFlex experimental framework and the algorithms were compared with algorithms that took part in the CHeSC 2011 challenge. Achieved results are very promising, the ISEA-adaptive would take the second place in the competition. It shows how important for good performance of this iterated local search hyper-heuristic is the re-initialization strategy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with GP. Artificial Evolution 1, 177–201 (2009)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A Classification of Hyper-heuristic Approaches. In: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 449–468 (2010)
Burke, E.K., Curtois, T., Hyde, M.R., Kendall, G., Ochoa, G., Petrovic, S., Vázquez Rodríguez, J.A., Gendreau, M.: Iterated Local Search vs. Hyper-heuristics: Towards General-Purpose Search Algorithms. In: IEEE Congress on Evolutionary Computation CEC 2010, pp. 1–8 (2010)
Burke, E., Curtois, T., Hyde, M., Ochoa, G., Vazquez-Rodriguez, J.A.: HyFlex: A Benchmark Framework for Cross-domain Heuristic Search, ArXiv e-prints, arXiv:1107.5462v1 (July 2011)
Garrido, P., Riff, M.C.: DVRP: A Hard Dynamic Combinatorial Optimisation Problem Tackled by an Evolutionary Hyper-Heuristic. Journal of Heuristics 16(6), 795–834 (2010)
Kubalik, J., Faigl, J.: Iterative Prototype Optimisation with Evolved Improvement Steps. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 154–165. Springer, Heidelberg (2006)
Kubalik, J.: Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations. In: Genetic and Evolutionary Computation Conference 2009 (CD-ROM), pp. 301–308. ACM, New York (2009)
Kubalik, J.: Efficient stochastic local search algorithm for solving the shortest common supersequence problem. In: Proceedings of the 12th Genetic and Evolutionary Computation Conference, pp. 249–256. ACM, New York (2010) ISBN 978-1-4503-0073-5
Luke, S.: Essentials of Metaheuristics. Lulu (2009), http://cs.gmu.edu/~sean/book/metaheuristics/
The results of the first Cross-domain Heuristic Search Challenge, CHeSC (2011), http://www.asap.cs.nott.ac.uk/chesc2011/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kubalík, J. (2012). Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm. In: Hao, JK., Middendorf, M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2012. Lecture Notes in Computer Science, vol 7245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29124-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-29124-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29123-4
Online ISBN: 978-3-642-29124-1
eBook Packages: Computer ScienceComputer Science (R0)