Abstract
In previous work, we have introduced an effective, grammar-based, linear Genetic-Programming hyperheuristic, i.e., a search heuristic on the space of heuristics. Here we further investigate this approach in the context of search performance and resource utilisation. For the chosen realistic travelling salesperson problems it shows that the hyperheuristic routinely produces metaheuristics that find tours whose lengths are highly competitive with the best results from literature, while population size, genotype size, and run time can be kept very moderate.
This is a preview of subscription content, log in via an institution to check access.
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
http://www.iwr.uni-heidelberg.de/groups/comopt/software/tsplib95/tsp/
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: On the Automatic Evolution of Computer Programs and its Applications. In: Genetic Programming – An Introduction, Morgan Kaufmann, San Francisco, CA, USA (1998)
Brameier, M., Banzhaf, W.: Linear Genetic Programming. In: vol. 1, Genetic and Evolutionary Computation, Springer, Heidelberg (2006)
Burke, E., Hyde, M., Kendall, G.: Evolving bin packing heuristics with genetic programming. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 860–869. Springer, Heidelberg (2006)
Burke, E., Hyde, M., Kendall, G., Woodward, J.: Scalability of evolved on line bin packing heuristics. In: Proceedings of Congress on Evolutionary Computation, CEC 2007 (2007)
Burke, E., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), 451–470 (2003)
Chakhlevitch, K., Cowling, P.: Choosing the fittest subset of low level heuristics in a hyperheuristic framework. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 23–33. Springer, Heidelberg (2005)
Dowsland, K., Soubeiga, E., Burke, E.: A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research 179(3), 759–774 (2007)
Gaw, A., Rattadilok, P., Kwan, R.: Distributed choice function hyper-heuristics for timetabling and scheduling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 495–497. Springer, Heidelberg (2005)
Janikow, C.Z.: Constrained genetic programming. In: Hussain, T.S. (ed.) Advanced Grammar Techniques Within Genetic Programming and Evolutionary Computation, Orlando, Florida, USA, 13 July 1999, pp. 80–82 (1999)
Jayalakshmi, G., Sathiamoorthy, S., Rajaram, R.: An hybrid genetic algorithm — a new approach to solve traveling salesman problem. International Journal of Computational Engineering Science 2(2), 339–355 (2001)
Keller, R.E., Banzhaf, W.: The evolution of genetic code on a hard problem. In: Spector, L., Langdon, W.B., Wu, A., Voigt, H.-M., Gen, M. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, CA, July 7–11, 2001. pp. 50–66, Morgan Kaufmann, San Francisco, CA (2001)
Keller, R.E., Poli, R.: Linear genetic programming of metaheuristics. In: GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 7-11, 2007, ACM Press, London (2007)
Keller, R.E., Poli, R.: Linear genetic programming of parsimonious metaheuristics. In: Proceedings of Congress on Evolutionary Computation (CEC 2007), Swissotel The Stamford, Singapore September 25-28 (2007)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)
Lawler, E., Lenstra, J., Kan, A.R., Shmoys, D. (eds.): The Travelling Salesman Problem. Wiley, Chichester (1985)
Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation 3(2), 199–230 (1995)
Oltean, M.: Evolving evolutionary algorithms using linear genetic programming. Evolutionary Computation 13(3), 387–410 (Fall 2005)
O’Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language. Genetic programming, vol. 4. Kluwer Academic Publishers, Dordrecht (2003)
Ross, P.: Hyperheuristics. In: Burke, E., Kendall, G. (eds.) Search Methodologies, pp. 529–556. Springer, New York, Berlin (2005)
Soubeiga, E.: Development and application of hyper-heuristics to personnel scheduling. PhD thesis, Computer Science, University of Nottingham (2003)
Whigham, P.A.: Search bias, language bias, and genetic programming. In: Koza, J.R., Goldberg, D.E., Fogel, D.B., Riolo, R.L. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, July 28–31, 1996, pp. 230–237, MIT Press, Cambridge (1996)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)
Wong, M.L., Leung, K.S.: Applying logic grammars to induce sub-functions in genetic programming. In: 1995 IEEE Conference on Evolutionary Computation, Perth, Australia, November 29 - 1 December, 1995, vol. 2, pp. 737–740. IEEE Press, Los Alamitos (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keller, R.E., Poli, R. (2008). Cost-Benefit Investigation of a Genetic-Programming Hyperheuristic. In: Monmarché, N., Talbi, EG., Collet, P., Schoenauer, M., Lutton, E. (eds) Artificial Evolution. EA 2007. Lecture Notes in Computer Science, vol 4926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79305-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-79305-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79304-5
Online ISBN: 978-3-540-79305-2
eBook Packages: Computer ScienceComputer Science (R0)