Abstract
Genetic Programming Hyper-heuristics (GPHHs) have been successfully applied in various problem domains for automatically designing heuristics such as dispatching rules in scheduling and routing policies in vehicle routing. In the real world, it is normal to encounter related problem domains, such as the vehicle routing problem with different objectives, constraints, and/or graph topology. On one hand, different heuristics are required for different problem domains. On the other hand, the knowledge learned from solving previous related problem domains can be helpful for solving the current one. Most existing studies solve different problem domains in isolation, and train/evolve the heuristic for each of them from scratch. In this chapter, we investigate different mechanisms to improve the effectiveness and efficiency of the heuristic retraining by employing knowledge transfer. Specifically, in the context of GPHH, we explored the following two transfer strategies: (1) useful subtrees and (2) importance of terminals, and verified their effectiveness in a case study of the uncertain capacitated arc routing problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M.A. Ardeh, Y. Mei, M. Zhang, A novel genetic programming algorithm with knowledge transfer for uncertain capacitated arc routing problem, in Pacific Rim International Conference on Artificial Intelligence (Springer, 2019), pp. 196–200
S.J. Branke, S. Nguyen, C.W. Pickardt, M. Zhang, Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110–124 (2016)
E.K. Burke, M.R. Hyde, G. Kendall, G. Ochoa, E. Ozcan, J.R. Woodward, Exploring hyper-heuristic methodologies with genetic programming, in Computational Intelligence, vol. 1, ed. by J. Kacprzyk, L.C. Jain, C.L. Mumford, L.C. Jain (Springer, Berlin Heidelberg, 2009), pp. 177–201
E.K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, J.R. Woodward, A classification of hyper-heuristic approaches, in Handbook of Metaheuristics, vol. 146, ed. by M. Gendreau, J.-Y. Potvin (Springer, US, 2010), pp. 449–468
E.K. Burke, M.R. Hyde, G. Kendall, G. Ochoa, E. Özcan, J.R. Woodward, A classification of hyper-heuristic approaches: revisited, in Handbook of Metaheuristics, vol. 272, ed. by M. Gendreau, J.-Y. Potvin (Springer International Publishing, 2019), pp. 453–477
R. Caruana, Multitask learning. Mach. Learn. 28(1), 41–75 (1997)
B. Da, A. Gupta, Y.-S. Ong, Curbing negative influences online for seamless transfer evolutionary optimization, in IEEE Transactions on Cybernetics (2018), pp. 1–14
T.T.H. Dinh, T.H. Chu, Q.U. Nguyen, Transfer learning in genetic programming, in 2015 IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2015), pp. 1145–1151
L. Feng, Y.-S. Ong, S. Jiang, A. Gupta, Autoencoding evolutionary search with learning across heterogeneous problems. IEEE Trans. Evol. Comput 21(5), 760–772 (2017)
L. Feng, Y.-S. Ong, M.-H. Lim, I.W. Tsang, Memetic search with interdomain learning: a realization between CVRP and CARP. IEEE Trans. Evol. Comput. 19(5), 644–658 (2015)
L. Feng, Y.-S. Ong, I. Wai-Hung Tsang, A.-H. Tan, An evolutionary search paradigm that learns with past experiences, in 2012 IEEE Congress on Evolutionary Computation (IEEE, 2012), pp. 1–8
G. Fleury, P. Lacomme, C. Prins, Evolutionary algorithms for stochastic arc routing problems, in Applications of Evolutionary Computing, vol. 3005, ed. by T. Kanade, J. Kittler, J.M. Kleinberg, F. Mattern, J.C. Mitchell, O. Nierstrasz, C. Pandu Rangan, B. Steffen, D. Terzopoulos, D. Tygar, M.Y. Vardi, G.R. Raidl, S. Cagnoni, J. Branke, D.W. Corne, R. Drechsler, Y. Jin, C.G. Johnson, P. Machado, E. Marchiori, F. Rothlauf, G.D. Smith, G. Squillero (Springer Berlin Heidelberg, 2004), pp. 501–512
A.S. Fukunaga, Automated discovery of local search heuristics for satisfiability testing. Evol. Comput. 16(1), 31–61 (2008)
A. Gupta, Y.-S. Ong, L. Feng, Insights on transfer optimization: because experience is the best teacher. IEEE Trans. Emerg. Top. Comput. Intell. 2(1), 51–64 (2018)
A. Gupta, Y.-S. Ong, L. Feng, K.C. Tan, Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans. Cybern. 47(7), 1652–1665 (2017)
E. Haslam, B. Xue, M. Zhang, Further investigation on genetic programming with transfer learning for symbolic regression, in 2016 IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2016), pp. 3598–3605
T. Hildebrandt, J. Branke, On using surrogates with genetic programming. Evol. Comput. 23(3), 343–367 (2015)
M. Iqbal, B. Xue, H. Al-Sahaf, M. Zhang, Cross-domain reuse of extracted knowledge in genetic programming for image classification. IEEE Trans. Evol. Comput. 21(4), 569–587 (2017)
J. Jacobsen-Grocott, Y. Mei, G. Chen, M. Zhang, Evolving heuristics for dynamic vehicle routing with time windows using genetic programming, in Proceedings of the IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2017), pp. 1948–1955
M. Jurasević, D. Jakobović, K. Knežević, Adaptive scheduling on unrelated machines with genetic programming. Appl. Soft Comput. 48, 419–430 (2016)
J. Lin, L. Zhu, K. Gao, A genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Expert Syst. Appl. 140 (2020)
Y. Liu, Y. Mei, M. Zhang, Z. Zhang, Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (ACM, 2017), pp. 290–297
Y. Liu, Y. Mei, M. Zhang, Z. Zhang, A predictive-reactive approach with genetic programming and cooperative co-evolution for uncertain capacitated arc routing problem. Evolutionary Computation (2019)
M.A. Martin, D.R. Tauritz, A problem configuration study of the robustness of a black-box search algorithm hyper-heuristic, in Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO Comp ’14 (ACM, 2014), pp. 1389–1396
R.I. McKay, N.X. Hoai, P.A. Whigham, Y. Shan, M. O’Neill, Grammar-based genetic programming: a survey. Genet. Program. Evol. Mach. 11(3-4), 365–396 (2010)
Y. Mei, B. Xue, S. Nguyen, M. Zhang, An efficient feature selection algorithm for evolving job shop scheduling rules with genetic programming. IEEE Trans. Emerg. Topics Comput. Intell. 1(5), 339–353 (2017)
Y. Mei, K. Tang, X. Yao, Capacitated arc routing problem in uncertain environments, in Proceedings of the IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2010), pp. 1–8
Y. Mei, M. Zhang, Genetic programming hyper-heuristic for multi-vehicle uncertain capacitated arc routing problem, in Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO) (ACM, 2018), pp. 141–142
Y. Mei, M. Zhang, Genetic programming hyper-heuristic for stochastic team orienteering problem with time windows, in 2018 IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2018), pp. 1–8
Y. Mei, M. Zhang, S. Nyugen, Feature selection in evolving job shop dispatching rules with genetic programming, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (ACM, 2016), pp. 365–372
S. Nguyen, Y. Mei, M. Zhang, Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3(1), 41–66 (2017)
S. Nguyen, M. Zhang, K.C. Tan, Surrogate-assisted genetic programming with simplified models for automated design of dispatching rules. IEEE Trans. Cybern. 47(9), 2951–2965 (2017)
L. Nie, L. Gao, P. Li, X. Li, A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J. Intell. Manuf. 24(4), 763–774 (2013)
D. O’Neill, H. Al-Sahaf, B. Xue, M. Zhang, Common subtrees in related problems: a novel transfer learning approach for genetic programming, in 2017 IEEE Congress on Evolutionary Computation (CEC) (2017), pp. 1287–1294
J.C. Ortiz-Bayliss, E. Özcan, A.J. Parkes, H. Terashima-Marín, A genetic programming hyper-heuristic: turning features into heuristics for constraint satisfaction, in 2013 13th UK Workshop on Computational Intelligence (UKCI) (IEEE, 2013), pp. 183–190
S.J. Pan, Q. Yang, A survey on transfer learning. IEEE Trans. Knowl. Data Eng. 22(10), 1345–1359 (2010)
U. Ritzinger, J. Puchinger, R.F. Hartl, A survey on dynamic and stochastic vehicle routing problems. Int. J. Prod. Res. 54(1), 215–231 (2016)
N.R. Sabar, M. Ayob, G. Kendall, Q. Rong, A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Trans. Cybern. 45(2), 217–228 (2015)
Y. Shan, R.I. McKay, D. Essam, H.A. Abbass, A survey of probabilistic model building genetic programming, in Scalable Optimization via Probabilistic Modeling, Studies in Computational Intelligence, ed. by M. Pelikan, K. Sastry, E. CantúPaz (Springer, Berlin Heidelberg, 2006), pp. 121–160
A. Sosa-Ascencio, G. Ochoa, H. Terashima-Marin, S.E. Conant-Pablos, Grammar-based generation of variable-selection heuristics for constraint satisfaction problems. Genet. Program. Evol. Mach. 17(2), 119–144 (2016)
B. Tan, H. Ma, Y. Mei, A genetic programming hyper-heuristic approach for online resource allocation in container-based clouds, in Proceedings of the Australasian Joint Conference on Artificial Intelligence (AI) (Springer, 2018), pp. 146–152
M.E. Taylor, P. Stone, Transfer learning for reinforcement learning domains: a survey. J. Mach. Learn. Res. 10(Jul), 1633–1685 (2009)
S. Thrun, L. Pratt, Learning to Learn (Springer Science & Business Media, 2012)
J. Wang, K. Tang, J.A. Lozano, X. Yao, Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems. IEEE Trans. Evol. Comput. 20(1), 96–109 (2016)
D. Yogatama, G. Mann, Efficient transfer learning method for automatic hyperparameter tuning, in Artificial Intelligence and Statistics (2014), pp. 1077–1085
F. Zhang, Y. Mei, M. Zhang, A two-stage genetic programming hyper-heuristic approach with feature selection for dynamic flexible job shop scheduling, in Proceedings of the Genetic and Evolutionary Computation Conference (2019), pp. 347–355
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Mei, Y., Ardeh, M.A., Zhang, M. (2021). Knowledge Transfer in Genetic Programming Hyper-heuristics. In: Pillay, N., Qu, R. (eds) Automated Design of Machine Learning and Search Algorithms. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-030-72069-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-72069-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72068-1
Online ISBN: 978-3-030-72069-8
eBook Packages: Computer ScienceComputer Science (R0)