{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:40:29Z","timestamp":1774435229440,"version":"3.50.1"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312747\/2021-7"],"award-info":[{"award-number":["312747\/2021-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["405702\/2021-3"],"award-info":[{"award-number":["405702\/2021-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2018\/15417-8"],"award-info":[{"award-number":["2018\/15417-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2022\/05803-3"],"award-info":[{"award-number":["2022\/05803-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2024\/08848-3"],"award-info":[{"award-number":["2024\/08848-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10732-025-09568-z","type":"journal-article","created":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T07:04:01Z","timestamp":1758870241000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Random-Key optimizer for combinatorial optimization"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5767-6798","authenticated-orcid":false,"given":"Antonio A.","family":"Chaves","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Martin J. A.","family":"Schuetz","sequence":"additional","affiliation":[]},{"given":"J. Kyle","family":"Brubaker","sequence":"additional","affiliation":[]},{"given":"Helmut G.","family":"Katzgraber","sequence":"additional","affiliation":[]},{"given":"Edilson F.","family":"de Arruda","sequence":"additional","affiliation":[]},{"given":"Ricardo M. A.","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,26]]},"reference":[{"key":"9568_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105575","volume":"82","author":"CE Andrade","year":"2019","unstructured":"Andrade, C.E., Byers, S.D., Gopalakrishnan, V., Halepovic, E., Poole, D.J., Tran, L.K., Volinsky, C.T.: Scheduling software updates for connected cars with limited availability. Appl. Soft Comput. 82, 105575 (2019)","journal-title":"Appl. Soft Comput."},{"key":"9568_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.eswa.2019.03.007","volume":"128","author":"CE Andrade","year":"2019","unstructured":"Andrade, C.E., Silva, T., Pessoa, L.S.: Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm. Expert Syst. Appl. 128, 67\u201380 (2019)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"9568_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2019.11.037","volume":"289","author":"CE Andrade","year":"2021","unstructured":"Andrade, C.E., Toso, R.F., Gon\u00e7alves, J.F., Resende, M.G.: The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. Eur. J. Oper. Res. 289(1), 17\u201330 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"9568_CR4","volume-title":"Deep Learning: Foundations and Concepts","author":"CM Bishop","year":"2023","unstructured":"Bishop, C.M., Bishop, H.: Deep Learning: Foundations and Concepts. Springer, Singapore (2023)"},{"issue":"4","key":"9568_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.3390\/a10040121","volume":"10","author":"LA Bewoor","year":"2017","unstructured":"Bewoor, L.A., Chandra Prakash, V., Sapkal, S.U.: Evolutionary hybrid particle swarm optimization algorithm for solving np-hard no-wait flow shop scheduling problems. Algorithms 10(4), 121 (2017)","journal-title":"Algorithms"},{"issue":"11","key":"9568_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"9568_CR7","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"issue":"8","key":"9568_CR8","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1073\/pnas.38.8.716","volume":"38","author":"R Bellman","year":"1952","unstructured":"Bellman, R.: On the theory of dynamic programming. Proc. Natl. Acad. Sci. 38(8), 716\u2013719 (1952)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9568_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.promfg.2018.03.010","volume":"22","author":"LA Bewoor","year":"2018","unstructured":"Bewoor, L.A., Prakash, V.C., Sapkal, S.U.: Production scheduling optimization in foundry using hybrid particle swarm optimization algorithm. Procedia Manufacturing 22, 57\u201364 (2018)","journal-title":"Procedia Manufacturing"},{"key":"9568_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"LS Buriol","year":"2005","unstructured":"Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in ospf\/is-is routing. Networks 46, 36\u201356 (2005)","journal-title":"Networks"},{"key":"9568_CR11","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation, pp. 11\u201318 (2002). Morgan Kaufmann Publishers Inc"},{"issue":"12","key":"9568_CR12","doi-asserted-by":"publisher","first-page":"3117","DOI":"10.1016\/j.cor.2008.12.009","volume":"36","author":"I Contreras","year":"2009","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research 36(12), 3117\u20133127 (2009)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"9568_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ejor.2009.05.044","volume":"202","author":"I Contreras","year":"2010","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: The tree of hubs location problem. Eur. J. Oper. Res. 202(2), 390\u2013400 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9568_CR14","doi-asserted-by":"crossref","unstructured":"Chaves, A.A., Lorena, L.H.N.: An adaptive and near parameter-free BRKGA using $$Q$$-learning method. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 2331\u20132338 (2021)","DOI":"10.1109\/CEC45853.2021.9504766"},{"key":"9568_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106589","volume":"165","author":"GO Chagas","year":"2024","unstructured":"Chagas, G.O., Lorena, L.A.N., Santos, R.D.C., Renaud, J., Coelho, L.C.: A parallel variable neighborhood search for $$\\alpha $$-neighbor facility location problems. Computers & Operations Research 165, 106589 (2024)","journal-title":"Computers & Operations Research"},{"key":"9568_CR16","first-page":"855","volume":"8","author":"AA Chaves","year":"2024","unstructured":"Chaves, A.A., Resende, M.G.C., Silva, R.M.A.: A random-key grasp for combinatorial optimization. J. Nonlinear Var. Anal. 8, 855\u2013881 (2024)","journal-title":"J. Nonlinear Var. Anal."},{"key":"9568_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121735","volume":"238","author":"AA Chaves","year":"2024","unstructured":"Chaves, A.A., Vianna, B.L., Silva, T.T., Schenekemberg, C.M.: A parallel branch-and-cut and an adaptive metaheuristic to solve the family traveling salesman problem. Expert Syst. Appl. 238, 121735 (2024)","journal-title":"Expert Syst. Appl."},{"key":"9568_CR18","unstructured":"Davis, L.D. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"key":"9568_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10732-010-9129-z","volume":"17","author":"Y Deng","year":"2011","unstructured":"Deng, Y., Bard, J.F.: A reactive grasp with path relinking for capacitated clustering. Journal of Heuristics 17, 119\u2013152 (2011)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"9568_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.ejor.2015.04.017","volume":"246","author":"EM de S\u00e1","year":"2015","unstructured":"de S\u00e1, E.M., Contreras, I., Cordeau, J.-F.: Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246(1), 186\u2013198 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9568_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ejor.2012.10.051","volume":"226","author":"EM de S\u00e1","year":"2013","unstructured":"de S\u00e1, E.M., de Camargo, R.S., de Miranda, G.: An improved benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226(2), 185\u2013202 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9568_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9568_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in ospf routing. J. Comb. Optim. 6, 299\u2013333 (2002)","journal-title":"J. Comb. Optim."},{"key":"9568_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"CE Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81, 229\u2013256 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"9568_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6(1), 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"9568_CR26","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. WH Freeman and Company, San Francisco, California (1979)"},{"key":"9568_CR27","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M., Marti, R.: Scatter search and path relinking: Advances and applications. Handbook of Metaheuristics, 1\u201335 (2003)","DOI":"10.1007\/0-306-48056-5_1"},{"key":"9568_CR28","unstructured":"Goldberg, D.E.: Genetic algorithms in search. Optimization, and Machine Learning, Addison Wesley (1989)"},{"key":"9568_CR29","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.endm.2013.05.123","volume":"41","author":"F Giroire","year":"2013","unstructured":"Giroire, F., P\u00e9rennes, S., Tahiri, I.: On the hardness of equal shortest path routing. Electronic Notes in Discrete Mathematics 41, 439\u2013446 (2013)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"9568_CR30","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics 17(1), 487\u2013525 (2011)","journal-title":"Journal of Heuristics"},{"key":"9568_CR31","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s10878-009-9282-1","volume":"22","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. 22, 180\u2013201 (2011)","journal-title":"J. Comb. Optim."},{"issue":"11","key":"9568_CR32","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1080\/0305215X.2014.971778","volume":"47","author":"C Garcia-Santiago","year":"2015","unstructured":"Garcia-Santiago, C., Del Ser, J., Upton, C., Quilligan, F., Gil-Lopez, S., Salcedo-Sanz, S.: A random-key encoded harmony search approach for energy-efficient production scheduling with shared resources. Eng. Optim. 47(11), 1481\u20131496 (2015)","journal-title":"Eng. Optim."},{"issue":"1","key":"9568_CR33","first-page":"267","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: an automatic algorithm configuration framework. J. Artif. Int. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Int. Res."},{"key":"9568_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11590-006-0021-6","volume":"1","author":"MJ Hirsch","year":"2007","unstructured":"Hirsch, M.J., Meneses, C.N., Pardalos, P.M., Resende, M.G.C.: Global optimization by continuous grasp. Optimization Letters 1, 201\u2013212 (2007)","journal-title":"Optimization Letters"},{"key":"9568_CR35","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Cambridge, Massachusetts (1992)"},{"key":"9568_CR36","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1287\/opre.2019.1956","volume":"68","author":"DS Johnson","year":"2020","unstructured":"Johnson, D.S., Breslau, L., Diakonikolas, I., Duffield, N., Gu, Y., Hajiaghayi, M.T., Karloff, H., Resende, M.G.C., Sen, S.: Near-optimal disjoint-path facility location through set cover by pairs. Oper. Res. 68, 896\u2013926 (2020)","journal-title":"Oper. Res."},{"key":"9568_CR37","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9568_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105478","volume":"136","author":"B Kay\u0131\u015fo\u011flu","year":"2021","unstructured":"Kay\u0131\u015fo\u011flu, B., Akg\u00fcn, \u0130: Multiple allocation tree of hubs location problem for non-complete networks. Computers & Operations Research 136, 105478 (2021)","journal-title":"Computers & Operations Research"},{"key":"9568_CR39","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. Plenum Press, New York (1972)"},{"key":"9568_CR40","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"9568_CR41","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"9568_CR42","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"issue":"3","key":"9568_CR43","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"T-L Lin","year":"2010","unstructured":"Lin, T.-L., Horng, S.-J., Kao, T.-W., Chen, Y.-H., Run, R.-S., Chen, R.-J., Lai, J.-L., Kuo, I.-H.: An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst. Appl. 37(3), 2629\u20132636 (2010)","journal-title":"Expert Syst. Appl."},{"key":"9568_CR44","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: In: Glover, F. (ed.) Iterated Local Search, pp. 320\u2013353. Springer, Boston, MA (2003)","DOI":"10.1007\/0-306-48056-5_11"},{"key":"9568_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2024.03.030","volume":"321","author":"MA Londe","year":"2025","unstructured":"Londe, M.A., Pessoa, L.S., Andrade, C.E., Resende, M.G.C.: Biased random-key genetic algorithms: a review. Eur. J. Oper. Res. 321, 1\u201322 (2025)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9568_CR46","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"key":"9568_CR47","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s10732-013-9223-0","volume":"19","author":"LF Mor\u00e1n-Mirabal","year":"2013","unstructured":"Mor\u00e1n-Mirabal, L.F., Gonz\u00e1lez-Velarde, J.L., Resende, M.G.C., Silva, R.M.A.: Randomized heuristics for handover minimization in mobility networks. Journal of Heuristics 19, 845\u2013880 (2013)","journal-title":"Journal of Heuristics"},{"key":"9568_CR48","unstructured":"Mangussi, A.D., Pola, H., Macedo, H.G., Juli\u00e3o, L.A., Proen\u00e7a, M.P.T., Gianfelice, P.R.L., Salezze, B.V., Chaves, A.A.: Meta-heur\u00edsticas via chaves aleat\u00f3rias aplicadas ao problema de localiza\u00e7\u00e3o de hubs em \u00e1rvore. In: Anais do Simp\u00f3sio Brasileiro de Pesquisa Operacional. Galo\u00e1, S\u00e3o Jos\u00e9 dos Campos (2023)"},{"key":"9568_CR49","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10732-010-9144-0","volume":"17","author":"GR Mateus","year":"2011","unstructured":"Mateus, G.R., Resende, M.G.C., Silva, R.M.A.: Grasp with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics 17, 527\u2013565 (2011)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"9568_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22(1), 1\u201312 (1998)","journal-title":"Oper. Res. Lett."},{"key":"9568_CR51","doi-asserted-by":"crossref","unstructured":"Nannen, V., Eiben, A.E.: Efficient relevance estimation and value calibration of evolutionary algorithm parameters. In: 2007 IEEE Congress on Evolutionary Computation, pp. 103\u2013110 (2007). IEEE","DOI":"10.1109\/CEC.2007.4424460"},{"issue":"4","key":"9568_CR52","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"9568_CR53","volume-title":"An Introduction to the Theory of Numbers","author":"I Niven","year":"1991","unstructured":"Niven, I., Zuckerman, H.S., Montgomery, H.L.: An Introduction to the Theory of Numbers. John Wiley & Sons, New York (1991)"},{"issue":"4","key":"9568_CR54","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s00500-014-1322-9","volume":"19","author":"A Ouaarab","year":"2015","unstructured":"Ouaarab, A., Ahiod, B., Yang, X.-S.: Random-key cuckoo search for the travelling salesman problem. Soft. Comput. 19(4), 1099\u20131106 (2015)","journal-title":"Soft. Comput."},{"issue":"3","key":"9568_CR55","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1080\/10556788.2021.1884250","volume":"37","author":"BB Oliveira","year":"2022","unstructured":"Oliveira, B.B., Carravilla, M.A., Oliveira, J.F., Resende, M.G.C.: A c++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation. Optimization Methods and Software 37(3), 1065\u20131086 (2022)","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"9568_CR56","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.ejor.2017.10.045","volume":"266","author":"LS Pessoa","year":"2018","unstructured":"Pessoa, L.S., Andrade, C.E.: Heuristics for a flowshop scheduling problem with stepwise job objective function. Eur. J. Oper. Res. 266(3), 950\u2013962 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9568_CR57","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s12351-019-00461-9","volume":"21","author":"A Panteli","year":"2021","unstructured":"Panteli, A., Boutsinas, B., Giannikos, I.: On solving the multiple $$p$$-median problem based on biclustering. Oper. Res. Int. Journal 21(1), 775\u2013799 (2021)","journal-title":"Oper. Res. Int. Journal"},{"key":"9568_CR58","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1007\/s11590-016-1082-9","volume":"11","author":"LS Pessoa","year":"2017","unstructured":"Pessoa, L.S., Santos, A.C., Resende, M.G.C.: A biased random-key genetic algorithm for the tree of hubs location problem. Optimization Letters 11, 1371\u20131384 (2017)","journal-title":"Optimization Letters"},{"key":"9568_CR59","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, New Jersey (2014)"},{"issue":"3","key":"9568_CR60","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"9568_CR61","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750\u2013775 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9568_CR62","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s11590-011-0285-3","volume":"6","author":"MGC Resende","year":"2012","unstructured":"Resende, M.G.C., Toso, R.F., Gon\u00e7alves, J.F., Silva, R.M.A.: A biased random-key genetic algorithm for the steiner triple covering problem. Optimization Letters 6, 605\u2013619 (2012)","journal-title":"Optimization Letters"},{"key":"9568_CR63","unstructured":"Resende, M.G.C., Werneck, R.F.: BRKGA for VRP. In: Amazon Machine Learning Conference (2015). Poster"},{"key":"9568_CR64","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, 2nd edn. MIT Press, Cambridge, MA (2018)","edition":"2"},{"key":"9568_CR65","doi-asserted-by":"crossref","unstructured":"Schuetz, M.J.A., Brubaker, J.K., Montagu, H., van Dijk, Y., Klepsch, J., Ross, P., Luckow, A., Resende, M.G.C., Katzgraber, H.G.: Optimization of robot trajectory planning with nature-inspired and hybrid quantum algorithms. Physical Review Applied 18(5) (2022)","DOI":"10.1103\/PhysRevApplied.18.054045"},{"key":"9568_CR66","unstructured":"Spears, W.M., De Jong, K.A.: On the virtues of parameterised uniform crossover. In: Proceedings of the 4th International Conference on Genetic Algorithms, San Diego, California, pp. 230\u2013236 (1991)"},{"issue":"11","key":"9568_CR67","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 37(11), 1899\u20131911 (2010)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"9568_CR68","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2014.890197","volume":"30","author":"RF Toso","year":"2015","unstructured":"Toso, R.F., Resende, M.G.C.: A c++ application programming interface for biased random-key genetic algorithms. Optimization Methods and Software 30(1), 81\u201393 (2015)","journal-title":"Optimization Methods and Software"},{"key":"9568_CR69","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-1-4613-0303-9_9","volume-title":"Handbook of Combinatorial Optimization","author":"RR Vemuganti","year":"1998","unstructured":"Vemuganti, R.R.: Applications of set covering, set packing and set partitioning models: a survey. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 1, pp. 573\u2013746. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"3","key":"9568_CR70","first-page":"279","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Technical note: q-learning. Mach. Learn. 8(3), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"issue":"6","key":"9568_CR71","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bulletin 1(6), 80\u201383 (1945)","journal-title":"Biometrics Bulletin"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09568-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09568-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09568-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T16:02:20Z","timestamp":1764777740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09568-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,26]]},"references-count":71,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9568"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09568-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,26]]},"assertion":[{"value":"18 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Statement of human rights"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"32"}}