Abstract
A primary role for hyper-heuristics is to control search processes based on moves generated by neighbourhood operators. Studies have shown that such hyper-heuristics can be effectively used, without modification, for solving unseen problem instances not only from a particular domain, but also on different problem domains. They hence provide a general-purpose software component to help reduce the implementation time needed for effective search methods. However, hyper-heuristic studies have generally used time-contract algorithms (i.e. a fixed execution time) and also solved each problem instance independently. We consider the potential gains and challenges of a hyper-heuristic being able to treat a set of instances as a batch; to be completed within an overall joint execution time. In batched mode, the hyper-heuristic can freely divide the computational effort between the individual instances, and also exploit what it learns on one instance to help solve other instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
- 3.
- 4.
In experiments, the “10 minute” is a “nominal” (or normalised) standardised time as determined by a benchmarking program available via the CHeSC website. To aid future comparisons, we always report results using nominal seconds (nsecs).
References
Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176–190. Springer, Heidelberg (2001)
Chen, X., Ong, Y.S.: A conceptual modeling of meme complexes in stochastic search. IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 42(5), 612–625 (2012)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. Technical Report NOTTCS-TR-SUB-0906241418-2747, School of Computer Science, University of Nottingham (2010)
Özcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3–23 (2008)
Ochoa, G., et al.: HyFlex: a benchmark framework for cross-domain heuristic search. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 136–147. Springer, Heidelberg (2012)
Mısır, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: A new hyper-heuristic implementation in HyFlex: a study on generality. In: Fowler, J., Kendall, G., McCollum, B. (eds.) Proceedings of the MISTA’11, pp. 374–393 (2011)
Zilberstein, S., Russell, S.J.: Approximate reasoning using anytime algorithms. In: Natarajan, S. (ed.) Imprecise and Approximate Computation. Kluwer Academic Publishers, The Netherlands (1995)
Kheiri, A., Özcan, E.: A Hyper-heuristic with a round robin neighbourhood selection. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 1–12. Springer, Heidelberg (2013)
Parkes, A.J., Walser, J.P.: Tuning local search for satisfiability testing. In: Proceedings of AAAI 1996, pp. 356–362 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asta, S., Özcan, E., Parkes, A. (2013). Batched Mode Hyper-heuristics. In: Nicosia, G., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2013. Lecture Notes in Computer Science(), vol 7997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44973-4_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-44973-4_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44972-7
Online ISBN: 978-3-642-44973-4
eBook Packages: Computer ScienceComputer Science (R0)