{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:55:05Z","timestamp":1781369705716,"version":"3.54.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10710-025-09528-3","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T17:42:57Z","timestamp":1766079777000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A structure-based genetic programming generation constructive hyper-heuristic with transfer learning for combinatorial optimisation"],"prefix":"10.1007","volume":"27","author":[{"given":"Darius","family":"Scheepers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"issue":"2","key":"9528_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"M. Karimi-Mamaghan, M. Mohammadi, P. Meyer, A.M. Karimi-Mamaghan, E.-G. Talbi, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.04.032","journal-title":"Eur. J. Oper. Res."},{"key":"9528_CR2","doi-asserted-by":"crossref","unstructured":"N. Pillay, R. Qu, Hyper-Heuristics: Theory and Applications, 1st edn. (Springer, Gewerbestrasse 11, Cham, Ch 6330, Switzerland, 2018)","DOI":"10.1007\/978-3-319-96514-7"},{"key":"9528_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10479-017-2625-x","volume":"275","author":"N Pillay","year":"2019","unstructured":"N. Pillay, E. \u00d6zcan, Automated generation of constructive ordering heuristics for educational timetabling. Ann. Oper. Res. 275, 181\u2013208 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9528_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"EK Burke","year":"2012","unstructured":"E.K. Burke, M.R. Hyde, G. Kendall, J. Woodward, Automating the packing heuristic design process with genetic programming. Evol. Comput. 20(1), 63\u201389 (2012)","journal-title":"Evol. Comput."},{"key":"9528_CR5","first-page":"18","volume":"1","author":"JR Koza","year":"1993","unstructured":"J.R. Koza, Genetic programming: on the programming of computers by means of natural selection (complex adaptive systems). Bradford Book 1, 18 (1993)","journal-title":"Bradford Book"},{"key":"9528_CR6","doi-asserted-by":"crossref","unstructured":"D. Scheepers, N. Pillay, A study of transfer learning in a generation constructive hyper-heuristic for one dimensional bin packing, in 2021 IEEE Symposium Series on Computational Intelligence (SSCI) (IEEE, 2021), p. 1\u20137","DOI":"10.1109\/SSCI50451.2021.9660092"},{"key":"9528_CR7","doi-asserted-by":"publisher","unstructured":"M.A. Ardeh, Y. Mei, M. Zhang, Transfer learning in genetic programming hyper-heuristic for solving uncertain capacitated arc routing problem, in 2019 IEEE Congress on Evolutionary Computation (CEC), (2019), pp. 49\u201356 https:\/\/doi.org\/10.1109\/CEC.2019.8789920","DOI":"10.1109\/CEC.2019.8789920"},{"key":"9528_CR8","doi-asserted-by":"crossref","unstructured":"Mei, Y., Ardeh, M.A., Zhang, M.: Knowledge transfer in genetic programming hyper-heuristics. Automated Design of Machine Learning and Search Algorithms, (2021), p. 149\u2013169","DOI":"10.1007\/978-3-030-72069-8_9"},{"key":"9528_CR9","unstructured":"N. Pillay, An investigation into the use of genetic programming for the induction of novice procedural programming solution algorithms in intelligent programming tutors. PhD thesis, School of Geological and Computer Sciences. University of KwaZulu-Natal (2004)"},{"key":"9528_CR10","doi-asserted-by":"crossref","unstructured":"R. Kapoor, N. Pillay, Iterative structure-based genetic programming for neural architecture design. In: Genetic and Evolutionary Computation\u2014GECCO 23: companion lissabon, Portugal, July 15\u201319, 2023 Proceedings, pp. 595\u2013598. Springer (2023)","DOI":"10.1145\/3583133.3590759"},{"issue":"1","key":"9528_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s10710-024-09483-5","volume":"25","author":"R Kapoor","year":"2024","unstructured":"R. Kapoor, N. Pillay, A genetic programming approach to the automated design of cnn models for image classification and video shorts creation. Genet. Prog. Evolvable Mach. 25(1), 10 (2024)","journal-title":"Genet. Prog. Evolvable Mach."},{"key":"9528_CR12","doi-asserted-by":"publisher","unstructured":"T.T. Huong\u00a0Dinh, T.H. Chu, Q.U. Nguyen, Transfer learning in genetic programming, in 2015 IEEE Congress on Evolutionary Computation (CEC), (2015), pp. 1145\u20131151 https:\/\/doi.org\/10.1109\/CEC.2015.7257018","DOI":"10.1109\/CEC.2015.7257018"},{"key":"9528_CR13","doi-asserted-by":"publisher","unstructured":"N. Pillay, Advances in evolutionary hyper-heuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO \u201925 Companion, Association for Computing Machinery, New York, NY, USA, pp. 1579\u20131591. (2025). https:\/\/doi.org\/10.1145\/3712255.3716520","DOI":"10.1145\/3712255.3716520"},{"key":"9528_CR14","doi-asserted-by":"crossref","unstructured":"K. Sim, E. Hart, Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 1549\u20131556 (2013)","DOI":"10.1145\/2463372.2463555"},{"key":"9528_CR15","doi-asserted-by":"crossref","unstructured":"D. Beckedahl, N. Pillay, A study of bi-space search for solving the one-dimensional bin packing problem. In: International Conference on Artificial Intelligence and Soft Computing, pp. 277\u2013289 (2020). Springer","DOI":"10.1007\/978-3-030-61534-5_25"},{"key":"9528_CR16","doi-asserted-by":"crossref","unstructured":"E.K. Burke, M.R. Hyde, G. Kendall, Evolving bin packing heuristics with genetic programming. In: International Conference on Parallel Problem Solving from Nature, pp. 860\u2013869. Springer (2006)","DOI":"10.1007\/11844297_87"},{"key":"9528_CR17","unstructured":"M. Hyde, A genetic programming hyper-heuristic approach to automated packing PhD thesis, School of Computer Science, University of Nottingham (2010)"},{"key":"9528_CR18","doi-asserted-by":"publisher","unstructured":"R. Ribani, M. Marengoni, A survey of transfer learning for convolutional neural networks, pp. 47\u201357 (2019). https:\/\/doi.org\/10.1109\/SIBGRAPI-T.2019.00010","DOI":"10.1109\/SIBGRAPI-T.2019.00010"},{"issue":"4","key":"9528_CR19","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/TEVC.2017.2657556","volume":"21","author":"M Iqbal","year":"2017","unstructured":"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\u2013587 (2017). https:\/\/doi.org\/10.1109\/TEVC.2017.2657556","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"9528_CR20","doi-asserted-by":"publisher","first-page":"4014","DOI":"10.1109\/TCYB.2023.3270319","volume":"54","author":"B Al-Helali","year":"2024","unstructured":"B. Al-Helali, Q. Chen, B. Xue, M. Zhang, Multitree genetic programming with feature-based transfer learning for symbolic regression on incomplete data. IEEE Trans. Cybern. 54(7), 4014\u20134027 (2024). https:\/\/doi.org\/10.1109\/TCYB.2023.3270319","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"9528_CR21","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1109\/TETCI.2024.3369407","volume":"8","author":"B Al-Helali","year":"2024","unstructured":"B. Al-Helali, Q. Chen, B. Xue, M. Zhang, Genetic programming for feature selection based on feature removal impact in high-dimensional symbolic regression. IEEE Trans. Emerg. Topics Comput. Intell. 8(3), 2269\u20132282 (2024). https:\/\/doi.org\/10.1109\/TETCI.2024.3369407","journal-title":"IEEE Trans. Emerg. Topics Comput. Intell."},{"key":"9528_CR22","doi-asserted-by":"publisher","unstructured":"D. O\u2019Neill, 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), pp. 1287\u20131294 (2017). https:\/\/doi.org\/10.1109\/CEC.2017.7969453","DOI":"10.1109\/CEC.2017.7969453"},{"key":"9528_CR23","doi-asserted-by":"publisher","unstructured":"J. Russell, N. Pillay, A selection hyper-heuristic for transfer learning in genetic programming. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation. GECCO \u201923 Companion, Association for Computing Machinery, New York, NY, USA, pp. 631\u2013634. (2023). https:\/\/doi.org\/10.1145\/3583133.3590686","DOI":"10.1145\/3583133.3590686"},{"key":"9528_CR24","doi-asserted-by":"publisher","unstructured":"N. Pillay, Transfer learning in evolutionary spaces. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO \u201924 Companion, Association for Computing Machinery, New York, NY, USA, pp. 1005\u20131016. (2024). https:\/\/doi.org\/10.1145\/3638530.3648431","DOI":"10.1145\/3638530.3648431"},{"key":"9528_CR25","doi-asserted-by":"publisher","unstructured":"Y. Liu, G. Taylor, Z. Huang, Novel application of mutual information in transfer learning for genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO \u201925 Companion, Association for Computing Machinery, New York, NY, USA, pp. 635\u2013638. (2025). https:\/\/doi.org\/10.1145\/3712255.3726607","DOI":"10.1145\/3712255.3726607"},{"key":"9528_CR26","unstructured":"N. Pillay, Evolving hyper-heuristics for a highly constrained examination timetabling problem. In: Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201910), pp. 336\u2013346 (2010)"},{"key":"9528_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-011-0309-9","volume":"37","author":"NR Sabar","year":"2012","unstructured":"N.R. Sabar, M. Ayob, R. Qu, G. Kendall, A graph coloring constructive hyper-heuristic for examination timetabling problems. Appl. Intell. 37, 1\u201311 (2012)","journal-title":"Appl. Intell."},{"key":"9528_CR28","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10489-013-0422-z","volume":"39","author":"A Soghier","year":"2013","unstructured":"A. Soghier, R. Qu, Adaptive selection of heuristics for assigning time slots and rooms in exam timetables. Appl. Intell. 39, 438\u2013450 (2013)","journal-title":"Appl. Intell."},{"issue":"2","key":"9528_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ejor.2013.06.052","volume":"232","author":"SA Rahman","year":"2014","unstructured":"S.A. Rahman, A. Bargiela, E.K. Burke, E. \u00d6zcan, B. McCollum, P. McMullan, Adaptive linear combination of heuristic orderings in constructing examination timetables. Eur. J. Oper. Res. 232(2), 287\u2013297 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9528_CR30","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"T. M\u00fcller, Itc 2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1), 429\u2013446 (2009)","journal-title":"Ann. Oper. Res."},{"key":"9528_CR31","unstructured":"M. Atsuta, K. Nonobe, T. Ibaraki, Itc2007 track 2, an approach using general csp solver. Practice and theory of automated timetabling (PATAT 2008),p. 19\u201322 (2008)"},{"key":"9528_CR32","first-page":"211","volume":"2010","author":"C Gogos","year":"2010","unstructured":"C. Gogos, G. Goulas, P. Alefragis, V. Kolonias, E. Housos, Distributed scatter search for the examination timetabling problem. PATAT 2010, 211 (2010)","journal-title":"PATAT"},{"key":"9528_CR33","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10951-016-0469-x","volume":"19","author":"Y Bykov","year":"2016","unstructured":"Y. Bykov, S. Petrovic, A step counting hill climbing algorithm applied to university examination timetabling. J. Sched. 19, 479\u2013492 (2016)","journal-title":"J. Sched."},{"key":"9528_CR34","unstructured":"C. Rajah, Structure based partial solution search for the examination timetabling problem. PhD thesis, School of Mathematics, Statistics and Computer Science. University of KwaZulu-Natal (2021)"},{"issue":"2","key":"9528_CR35","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10951-023-00799-1","volume":"28","author":"D Van Bulck","year":"2025","unstructured":"D. Van Bulck, D. Goossens, A. Schaerf, Multi-neighbourhood simulated annealing for the itc-2007 capacitated examination timetabling problem. J. Sched. 28(2), 217\u2013232 (2025). https:\/\/doi.org\/10.1007\/s10951-023-00799-1","journal-title":"J. Sched."},{"key":"9528_CR36","unstructured":"B.H. Korte, J. Vygen, Combinatorial Optimization vol. 1, (Springer, Gewerbestrasse 11, Cham, Ch 6330, Switzerland, 2011)"},{"key":"9528_CR37","doi-asserted-by":"crossref","unstructured":"P. Ross, J.G. Mar\u00edn-Bl\u00e1zquez, S. Schulenburg, E. Hart, Learning a procedure that can solve hard bin-packing problems: a new ga-based approach to hyper-heuristics. In: Genetic and Evolutionary Computation\u2014GECCO 2003: Genetic and Evolutionary Computation Conference Chicago, IL, USA, July 12\u201316, 2003 Proceedings, Part II, pp. 1295\u20131306, Springer (2003)","DOI":"10.1007\/3-540-45110-2_5"},{"issue":"1","key":"9528_CR38","first-page":"31","volume":"48","author":"N Pillay","year":"2012","unstructured":"N. Pillay, A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem. S. Afr. Comput. J. 48(1), 31\u201340 (2012)","journal-title":"S. Afr. Comput. J."},{"key":"9528_CR39","doi-asserted-by":"publisher","unstructured":"K. Sim, E. Hart, B. Paechter, Learning to solve bin packing problems with an immune inspired hyper-heuristic. Note: paper presented at the 12th European Conference on Artificial Life held in Taormina, Italy on 2-6 September 2013 This work was funded by EPSRC grant P\/J1021628\/1 Real World Optimisation with Life-Long Learning School: iidi (2024), https:\/\/doi.org\/10.7551\/978-0-262-31709-2-ch126. http:\/\/researchrepository.napier.ac.uk\/id\/eprint\/6251","DOI":"10.7551\/978-0-262-31709-2-ch126"},{"key":"9528_CR40","doi-asserted-by":"crossref","unstructured":"K. Sim, E. Hart, An improved immune inspired hyper-heuristic for combinatorial optimisation problems. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 121\u2013128 (2014)","DOI":"10.1145\/2576768.2598241"},{"key":"9528_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101095","volume":"72","author":"E Singh","year":"2022","unstructured":"E. Singh, N. Pillay, A study of ant-based pheromone spaces for generation constructive hyper-heuristics. Swarm Evol. Comput. 72, 101095 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"9528_CR42","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"AC Alvim","year":"2004","unstructured":"A.C. Alvim, C.C. Ribeiro, F. Glover, D.J. Aloise, A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10, 205\u2013229 (2004)","journal-title":"J. Heuristics"},{"issue":"2","key":"9528_CR43","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ejor.2010.11.004","volume":"210","author":"K Fleszar","year":"2011","unstructured":"K. Fleszar, C. Charalambous, Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur. J. Oper. Res. 210(2), 176\u2013184 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9528_CR44","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.cie.2014.06.002","volume":"75","author":"T Dokeroglu","year":"2014","unstructured":"T. Dokeroglu, A. Cosar, Optimization of one-dimensional bin packing problem with island parallel grouping genetic algorithms. Comput. Ind. Eng. 75, 176\u2013186 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"9528_CR45","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"M. Quiroz-Castellanos, L. Cruz-Reyes, J. Torres-Jimenez, C. G\u00f3mez, H.J.F. Huacuja, A.C. Alvim, A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52\u201364 (2015)","journal-title":"Comput. Oper. Res."},{"key":"9528_CR46","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2018.08.021","volume":"125","author":"T Kucukyilmaz","year":"2018","unstructured":"T. Kucukyilmaz, H.E. Kiziloz, Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput. Ind. Eng. 125, 157\u2013170 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"9528_CR47","doi-asserted-by":"crossref","unstructured":"A.C. Silva, C.C.H. Borges, An improved heuristic based genetic algorithm for bin packing problem. In: 2019 8th Brazilian Conference on Intelligent Systems (BRACIS), (IEEE 2019), pp. 60\u201365","DOI":"10.1109\/BRACIS.2019.00020"},{"issue":"8","key":"9528_CR48","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"\u00c9. Taillard, Parallel iterative search methods for vehicle routing problems. Netw. 23(8), 661\u2013673 (1993)","journal-title":"Netw."},{"issue":"4","key":"9528_CR49","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","volume":"12","author":"T Volgenant","year":"1983","unstructured":"T. Volgenant, R. Jonker, The symmetric traveling salesman problem and edge exchanges in minimal 1-trees. Eur. J. Oper. Res. 12(4), 394\u2013403 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"9528_CR50","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Y. Rochat, \u00c9.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics. 1, 147\u2013167 (1995)","journal-title":"J. Heuristics."},{"issue":"4","key":"9528_CR51","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1287\/trsc.30.4.379","volume":"30","author":"J Xu","year":"1996","unstructured":"J. Xu, J.P. Kelly, A network flow-based tabu search heuristic for the vehicle routing problem. Transp. Sci. 30(4), 379\u2013393 (1996)","journal-title":"Transp. Sci."},{"issue":"10","key":"9528_CR52","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"S. Lin, Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"9528_CR53","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"P. Toth, D. Vigo, The granular tabu search and its application to the vehicle-routing problem. Informs J. Comput. 15(4), 333\u2013346 (2003)","journal-title":"Informs J. Comput."},{"key":"9528_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6940-7","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"EK Burke","year":"2014","unstructured":"E.K. Burke, E.K. Burke, G. Kendall, G. Kendall, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (Springer, Boston, MA, 2014)"},{"key":"9528_CR55","unstructured":"L. Di\u00a0Gaspero, B. McCollum, A. Schaerf, The second international timetabling competition (itc-2007): curriculum-based course timetabling (track 3). Technical report, Technical Report QUB\/IEEE\/Tech\/ITC2007\/CurriculumCTT\/v1. 0 (2007)"},{"issue":"7","key":"9528_CR56","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"A. Scholl, R. Klein, C. J\u00fcrgens, Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7), 627\u2013645 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(96)00082-2","journal-title":"Comput. Oper. Res."},{"key":"9528_CR57","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"E. Falkenauer, A hybrid grouping genetic algorithm for bin packing. J. heuristics. 2, 5\u201330 (1996)","journal-title":"J. heuristics."},{"issue":"2","key":"9528_CR58","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christofides","year":"1984","unstructured":"N. Christofides, J.E. Beasley, The period routing problem. Netw. 14(2), 237\u2013256 (1984)","journal-title":"Netw."},{"issue":"11","key":"9528_CR59","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1080\/01605682.2020.1796538","volume":"72","author":"N Pillay","year":"2021","unstructured":"N. Pillay, R. Qu, Assessing hyper-heuristic performance. J. Oper. Res. Soc. 72(11), 2503\u20132516 (2021)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9528_CR60","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"H.B. Mann, D.R. Whitney, On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18(1), 50\u201360 (1947). https:\/\/doi.org\/10.1214\/aoms\/1177730491","journal-title":"Ann. Math. Stat."},{"key":"9528_CR61","unstructured":"P.A. Djang, P.R. Finch, Solving one dimensional bin packing problems. J. Heuristics. 123\u2013144 (1998)"},{"key":"9528_CR62","unstructured":"P. Ross, S. Schulenburg, J.G. Mar\u00edn-Bl\u00e4zquez, E. Hart, Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation, pp. 942\u2013948 (2002)"},{"key":"9528_CR63","doi-asserted-by":"crossref","unstructured":"K. Sim, E. Hart, B. Paechter, A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution. In: Parallel Problem Solving from Nature-PPSN XII: 12th International Conference, Taormina, Italy, September 1-5, 2012, Proceedings, Part II 12, pp. 348\u2013357 (2012). Springer","DOI":"10.1007\/978-3-642-32964-7_35"},{"key":"9528_CR64","doi-asserted-by":"crossref","unstructured":"P. Garrido, C. Castro, Stable solving of cvrps using hyperheuristics. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 255\u2013262 (2009)","DOI":"10.1145\/1569901.1569938"},{"issue":"2","key":"9528_CR65","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2008.10.001","volume":"198","author":"R Qu","year":"2009","unstructured":"R. Qu, E.K. Burke, B. McCollum, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. Eur. J. Oper. Res. 198(2), 392\u2013404 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9528_CR66","unstructured":"P. Kilby, P. Prosser, P. Shaw, Dynamic vrps: a study of scenarios. Univ. Strathclyde Tech. Rep. 1(11) (1998)"},{"issue":"4","key":"9528_CR67","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"G. Clarke, J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"issue":"2","key":"9528_CR68","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1057\/jors.1976.95","volume":"27","author":"R Mole","year":"1976","unstructured":"R. Mole, S. Jameson, A sequential route-building algorithm employing a generalised savings criterion. J. Oper. Res. Soc. 27(2), 503\u2013511 (1976)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9528_CR69","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"B.E. Gillett, L.R. Miller, A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974)","journal-title":"Oper. Res."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-025-09528-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10710-025-09528-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-025-09528-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:02:39Z","timestamp":1781366559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10710-025-09528-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s10710-025-09528-3","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"4 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"2"}}