{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:25:02Z","timestamp":1779323102369,"version":"3.51.4"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031041471","type":"print"},{"value":"9783031041488","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04148-8_3","type":"book-chapter","created":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:02:31Z","timestamp":1649008951000},"page":"33-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Algorithm Selection for\u00a0the\u00a0Team Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aldy","family":"Gunawan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Vansteenwegen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2007","unstructured":"Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. J. Heuristics 13(1), 49\u201376 (2007). https:\/\/doi.org\/10.1007\/s10732-006-9004-0","journal-title":"J. Heuristics"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","volume":"8","author":"H Bouly","year":"2010","unstructured":"Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR 8(1), 49\u201370 (2010). https:\/\/doi.org\/10.1007\/s10288-008-0094-4","journal-title":"4OR"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-20520-0_48","volume-title":"Applications of Evolutionary Computation","author":"D-C Dang","year":"2011","unstructured":"Dang, D.-C., Guibadj, R.N., Moukrim, A.: A PSO-based memetic algorithm for the team orienteering problem. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 471\u2013480. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20520-0_48"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","volume":"229","author":"DC Dang","year":"2013","unstructured":"Dang, D.C., Guibadj, R.N., Moukrim, A.: An effective PSO-inspired algorithm for the team orienteering problem. Eur. J. Oper. Res. 229(2), 332\u2013344 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. SIMULATION 76(2), 60\u201368 (2001)","journal-title":"SIMULATION"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/0-387-28356-0_6","volume-title":"Search Methodologies","author":"M Gendreau","year":"2005","unstructured":"Gendreau, M., Potvin, J.Y.: Tabu search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 165\u2013186. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-28356-0_6"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search-part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logist. (NRL) 34(3), 307\u2013318 (1987)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF02163027","volume":"14","author":"GH Golub","year":"1970","unstructured":"Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numer. Math. 14(5), 403\u2013420 (1970). https:\/\/doi.org\/10.1007\/BF02163027","journal-title":"Numer. Math."},{"key":"3_CR14","unstructured":"Gomes, C., Selman, B.: Algorithm portfolio design: theory vs. practice. In: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI), Providence\/Rhode Island, USA, 1\u20133 August 1997, pp. 190\u2013197 (1997)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"105034","DOI":"10.1016\/j.cor.2020.105034","volume":"123","author":"F Hammami","year":"2020","unstructured":"Hammami, F., Rekik, M., Coelho, L.C.: A hybrid adaptive large neighborhood search heuristic for the team orienteering problem. Comput. Oper. Res. 123, 105034 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_35"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3), 648\u2013665 (2008)","journal-title":"Comput. Ind. Eng."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2015.08.003","volume":"61","author":"L Ke","year":"2016","unstructured":"Ke, L., Zhai, L., Li, J., Chan, F.T.: Pareto mimic algorithm: an approach to the team orienteering problem. Omega 61, 155\u2013166 (2016)","journal-title":"Omega"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"issue":"8","key":"3_CR23","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1016\/j.eswa.2012.12.022","volume":"40","author":"BI Kim","year":"2013","unstructured":"Kim, B.I., Li, H., Johnson, A.L.: An augmented large neighborhood search method for solving the team orienteering problem. Expert Syst. Appl. 40(8), 3065\u20133072 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.asoc.2012.09.022","volume":"13","author":"SW Lin","year":"2013","unstructured":"Lin, S.W.: Solving the team orienteering problem using effective multi-start simulated annealing. Appl. Soft Comput. 13(2), 1064\u20131073 (2013)","journal-title":"Appl. Soft Comput."},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1613\/jair.4726","volume":"53","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H.H., Hutter, F., Schaub, T.: AutoFolio: an automatically configured algorithm selector. J. Artif. Intelli. Res. 53, 745\u2013778 (2015)","journal-title":"J. Artif. Intelli. Res."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-319-68759-9_16","volume-title":"Simulated Evolution and Learning","author":"M M\u0131s\u0131r","year":"2017","unstructured":"M\u0131s\u0131r, M.: Matrix factorization based benchmark set analysis: a case study on HyFlex. In: Shi, Y., et al. (eds.) SEAL 2017. LNCS, vol. 10593, pp. 184\u2013195. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68759-9_16"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.artint.2016.12.001","volume":"244","author":"M M\u0131s\u0131r","year":"2017","unstructured":"M\u0131s\u0131r, M., Sebag, M.: ALORS: an algorithm recommender system. Artif. Intell. 244, 291\u2013314 (2017)","journal-title":"Artif. Intell."},{"key":"3_CR28","unstructured":"M\u0131s\u0131r, M.: Algorithm selection across selection hyper-heuristics. In: The Data Science for Optimization (DSO)@ IJCAI Workshop at the 29th International Joint Conference on Artificial Intelligence (IJCAI) (2021)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-030-92121-7_20","volume-title":"Learning and Intelligent Optimization","author":"M M\u0131s\u0131r","year":"2021","unstructured":"M\u0131s\u0131r, M.: Algorithm selection on adaptive operator selection: a case study on genetic algorithms. In: Simos, D.E., Pardalos, P.M., Kotsireas, I.S. (eds.) LION 2021. LNCS, vol. 12931, pp. 237\u2013251. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92121-7_20"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"M\u0131s\u0131r, M.: Benchmark set reduction for cheap empirical algorithmic studies. In: IEEE Congress on Evolutionary Computation (CEC), pp. 871\u2013877. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9505012"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Misir, M.: Generalized automated energy function selection for protein structure prediction on 2D and 3D HP models. In: IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/SSCI50451.2021.9659895"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"M\u0131s\u0131r, M.: Selection-based per-instance heuristic generation for protein structure prediction of 2D HP model. In: IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/SSCI50451.2021.9660025"},{"issue":"11","key":"3_CR33","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3_CR34","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/trsc.2019.0923","volume":"54","author":"C Orlis","year":"2020","unstructured":"Orlis, C., Bianchessi, N., Roberti, R., Dullaert, W.: The team orienteering problem with overlaps: an application in cash logistics. Transp. Sci. 54(2), 470\u2013487 (2020)","journal-title":"Transp. Sci."},{"key":"3_CR35","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 399\u2013419. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"key":"3_CR36","unstructured":"Poggi, M., Viana, H., Uchoa, E.: The team orienteering problem: formulations and branch-cut and price. In: 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2010)"},{"key":"3_CR37","unstructured":"Resende, M.G., Ribeiro, C.: Greedy randomized adaptive search procedures (GRASP). AT&T Labs Research Technical Report 98(1), 1\u201311 (1998)"},{"key":"3_CR38","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"MG Resendel","year":"2005","unstructured":"Resendel, M.G., Ribeiro, C.C.: Grasp with path-relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers. ORCS, vol. 32, pp. 29\u201363. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-25383-1_2"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-10172-9_5","volume-title":"Business Process Management","author":"J Ribeiro","year":"2014","unstructured":"Ribeiro, J., Carmona, J., M\u0131s\u0131r, M., Sebag, M.: A recommender system for process discovery. In: Sadiq, S., Soffer, P., V\u00f6lzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 67\u201383. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10172-9_5"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"issue":"11","key":"3_CR41","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau, W., Vansteenwegen, P., Berghe, G.V., Van Oudheusden, D.: A path relinking approach for the team orienteering problem. Comput. Oper. Res. 37(11), 1853\u20131859 (2010)","journal-title":"Comput. Oper. Res."},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1155\/2009\/421425","volume":"2009","author":"X Su","year":"2009","unstructured":"Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. Adv. Artif. Intell. 2009, 4 (2009)","journal-title":"Adv. Artif. Intell."},{"issue":"6","key":"3_CR43","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379\u20131407 (2005)","journal-title":"Comput. Oper. Res."},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1016\/j.asoc.2019.04.038","volume":"80","author":"E Tsakirakis","year":"2019","unstructured":"Tsakirakis, E., Marinaki, M., Marinakis, Y., Matsatsinis, N.: A similarity hybrid harmony search algorithm for the team orienteering problem. Appl. Soft Comput. 80, 776\u2013796 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"3_CR45","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D.: A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118\u2013127 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"3_CR46","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12), 3281\u20133290 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3_CR47","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"T Vidal","year":"2016","unstructured":"Vidal, T., Maculan, N., Ochi, L.S., Vaz Penna, P.H.: Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp. Sci. 50(2), 720\u2013734 (2016)","journal-title":"Transp. Sci."},{"key":"3_CR48","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"3_CR49","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32(1), 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR50","unstructured":"Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: SATzilla 2012: improved algorithm selection based on cost-sensitive classification models. In: Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pp. 57\u201358 (2012)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04148-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T14:21:36Z","timestamp":1726928496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04148-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031041471","9783031041488"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04148-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}