{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T06:19:39Z","timestamp":1774160379886,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"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_2","type":"book-chapter","created":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:02:31Z","timestamp":1649008951000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A RNN-Based Hyper-heuristic for\u00a0Combinatorial Problems"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Kieffer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Duflo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Danoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Varrette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10479-006-0150-4","volume":"150","author":"Y Ak\u00e7ay","year":"2006","unstructured":"Ak\u00e7ay, Y., Li, H., Xu, S.H.: Greedy algorithm for the general multidimensional knapsack problem. Ann. Oper. Res. 150(1), 17\u201329 (2006). https:\/\/doi.org\/10.1007\/s10479-006-0150-4","journal-title":"Ann. Oper. Res."},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Allen, S., Burke, E.K., Hyde, M., Kendall, G.: Evolving reusable 3D packing heuristics with genetic programming. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation - GECCO 2009. ACM Press (2009). https:\/\/doi.org\/10.1145\/1569901.1570029","DOI":"10.1145\/1569901.1570029"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10852-015-9275-2","volume":"14","author":"MAK Azad","year":"2015","unstructured":"Azad, M.A.K., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Solving large 0\u20131 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm. J. Math. Model. Algorithms Oper. Res. 14(3), 313\u2013330 (2015). https:\/\/doi.org\/10.1007\/s10852-015-9275-2","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M., Poli, R.: Generating SAT local-search heuristics using a GP hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol. 4926, pp. 37\u201349. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79305-2_4"},{"issue":"10","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1057\/palgrave.jors.2602463","volume":"59","author":"R Bai","year":"2008","unstructured":"Bai, R., Burke, E.K., Kendall, G.: Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation. J. Oper. Res. Soc. 59(10), 1387\u20131397 (2008). https:\/\/doi.org\/10.1057\/palgrave.jors.2602463","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10288-011-0182-8","volume":"10","author":"R Bai","year":"2011","unstructured":"Bai, R., Blazewicz, J., Burke, E.K., Kendall, G., McCollum, B.: A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR-Q J. Oper. Res. 10(1), 43\u201366 (2011). https:\/\/doi.org\/10.1007\/s10288-011-0182-8","journal-title":"4OR-Q J. Oper. Res."},{"key":"2_CR7","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-662-43631-8_18","volume-title":"Natural Computing Algorithms","author":"A Brabazon","year":"2015","unstructured":"Brabazon, A., O\u2019Neill, M., McGarraghy, S.: Grammar-based and developmental genetic programming. In: Natural Computing Algorithms. NCS, pp. 345\u2013356. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43631-8_18"},{"issue":"12","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013). https:\/\/doi.org\/10.1057\/jors.2013.71","journal-title":"J. Oper. Res. Soc."},{"key":"2_CR9","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","volume-title":"Computational Intelligence","author":"EK Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. ISRL, vol. 1, pp. 177\u2013201. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01799-5_6"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/tevc.2011.2160401","volume":"16","author":"EK Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Trans. Evol. Comput. 16(3), 406\u2013417 (2012). https:\/\/doi.org\/10.1109\/tevc.2011.2160401","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-a","volume":"14","author":"I Charon","year":"1993","unstructured":"Charon, I., Hudry, O.: The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14(3), 133\u2013137 (1993). https:\/\/doi.org\/10.1016\/0167-6377(93)90023-a","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P Chu","year":"1998","unstructured":"Chu, P., Beasley, J.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63\u201386 (1998). https:\/\/doi.org\/10.1023\/A:1009642405419","journal-title":"J. Heuristics"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-x_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44629-x_11"},{"issue":"9\/10","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1108\/k-09-2013-0201","volume":"43","author":"JH Drake","year":"2014","unstructured":"Drake, J.H., Hyde, M., Khaled, I., \u00d6zcan, E.: A genetic programming hyper-heuristic for the multidimensional knapsack problem. Kybernetes 43(9\/10), 1500\u20131511 (2014). https:\/\/doi.org\/10.1108\/k-09-2013-0201","journal-title":"Kybernetes"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/evco_a_00145","volume":"24","author":"JH Drake","year":"2016","unstructured":"Drake, J.H., \u00d6zcan, E., Burke, E.K.: A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem. Evol. Comput. 24(1), 113\u2013141 (2016). https:\/\/doi.org\/10.1162\/evco_a_00145","journal-title":"Evol. Comput."},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/bf02242185","volume":"40","author":"A Drexl","year":"1988","unstructured":"Drexl, A.: A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40(1), 1\u20138 (1988). https:\/\/doi.org\/10.1007\/bf02242185","journal-title":"Computing"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-b","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161\u2013175 (1990). https:\/\/doi.org\/10.1016\/0021-9991(90)90201-b","journal-title":"J. Comput. Phys."},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/tciaig.2012.2210423","volume":"4","author":"A Elyasaf","year":"2012","unstructured":"Elyasaf, A., Hauptman, A., Sipper, M.: Evolutionary design of FreeCell solvers. IEEE Trans. Comput. Intell. AI Games 4(4), 270\u2013281 (2012). https:\/\/doi.org\/10.1109\/tciaig.2012.2210423","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.procs.2014.05.008","volume":"29","author":"H Fingler","year":"2014","unstructured":"Fingler, H., C\u00e1ceres, E.N., Mongelli, H., Song, S.W.: A CUDA based solution to the multidimensional knapsack problem using the ant colony optimization. Procedia Comput. Sci. 29, 84\u201394 (2014). https:\/\/doi.org\/10.1016\/j.procs.2014.05.008","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/s0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville, A.: The multidimensional 0\u20131 knapsack problem: an overview. Eur. J. Oper. Res. 155(1), 1\u201321 (2004). https:\/\/doi.org\/10.1016\/s0377-2217(03)00274-1","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"2_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0166-218x(94)90209-7","volume":"49","author":"A Freville","year":"1994","unstructured":"Freville, A., Plateau, G.: An efficient preprocessing procedure for the multidimensional 0\u20131 knapsack problem. Discrete Appl. Math. 49(1\u20133), 189\u2013212 (1994). https:\/\/doi.org\/10.1016\/0166-218x(94)90209-7","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ejor.2010.12.005","volume":"211","author":"A Garc\u00eda-Villoria","year":"2011","unstructured":"Garc\u00eda-Villoria, A., Salhi, S., Corominas, A., Pastor, R.: Hyper-heuristic approaches for the response time variability problem. Eur. J. Oper. Res. 211(1), 160\u2013169 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2010.12.005","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"2_CR23","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10732-010-9126-2","volume":"16","author":"P Garrido","year":"2010","unstructured":"Garrido, P., Riff, M.C.: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. J. Heuristics 16(6), 795\u2013834 (2010). https:\/\/doi.org\/10.1007\/s10732-010-9126-2","journal-title":"J. Heuristics"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-71618-1_40","volume-title":"Adaptive and Natural Computing Algorithms","author":"F Hembecker","year":"2007","unstructured":"Hembecker, F., Lopes, H.S., Godoy, W.: Particle swarm optimization for the multidimensional knapsack problem. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol. 4431, pp. 358\u2013365. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71618-1_40"},{"issue":"6","key":"2_CR25","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1057\/palgrave.jors.2602382","volume":"59","author":"G Kendall","year":"2008","unstructured":"Kendall, G.: Scheduling English football fixtures over holiday periods. J. Oper. Res. Soc. 59(6), 743\u2013755 (2008). https:\/\/doi.org\/10.1057\/palgrave.jors.2602382","journal-title":"J. Oper. Res. Soc."},{"key":"2_CR26","unstructured":"Kusner, M.J., Paige, B., Hern\u00e1ndez-Lobato, J.M.: Grammar variational autoencoder. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, pp. 1945\u20131954. PMLR, 06\u201311 August 2017"},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/s11227-014-1268-9","volume":"70","author":"G Lai","year":"2014","unstructured":"Lai, G., Yuan, D., Yang, S.: A new hybrid combinatorial genetic algorithm for multidimensional knapsack problems. J. Supercomput. 70(2), 930\u2013945 (2014). https:\/\/doi.org\/10.1007\/s11227-014-1268-9","journal-title":"J. Supercomput."},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Camacho, E., Terashima-Mar\u00edn, H., Ross, P., Valenzuela-Rend\u00f3n, M.: Problem-state representations in a hyper-heuristic approach for the 2D irregular BPP. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation - GECCO 2010. ACM Press (2010). https:\/\/doi.org\/10.1145\/1830483.1830539","DOI":"10.1145\/1830483.1830539"},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0377-2217(84)90286-8","volume":"16","author":"M Magazine","year":"1984","unstructured":"Magazine, M., Oguz, O.: A heuristic algorithm for the multidimensional zero-one knapsack problem. Eur. J. Oper. Res. 16(3), 319\u2013326 (1984). https:\/\/doi.org\/10.1016\/0377-2217(84)90286-8","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Nguyen, S., Zhang, M., Johnston, M.: A genetic programming based hyper-heuristic approach for combinatorial optimisation. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 1299\u20131306. ACM, New York (2011). https:\/\/doi.org\/10.1145\/2001576.2001752","DOI":"10.1145\/2001576.2001752"},{"issue":"3","key":"2_CR31","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1162\/1063656054794815","volume":"13","author":"M Oltean","year":"2005","unstructured":"Oltean, M.: Evolving evolutionary algorithms using linear genetic programming. Evol. Comput. 13(3), 387\u2013410 (2005). https:\/\/doi.org\/10.1162\/1063656054794815","journal-title":"Evol. Comput."},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Ortiz-Bayliss, J.C., Ozcan, E., Parkes, A.J., Terashima-Marin, H.: Mapping the performance of heuristics for constraint satisfaction. In: IEEE Congress on Evolutionary Computation. IEEE, July 2010. https:\/\/doi.org\/10.1109\/cec.2010.5585965","DOI":"10.1109\/cec.2010.5585965"},{"key":"2_CR33","unstructured":"Petersen, B.K.: Deep symbolic regression: recovering mathematical expressions from data via policy gradients. arXiv abs\/1912.04871 (2019). http:\/\/arxiv.org\/abs\/1912.04871"},{"issue":"2","key":"2_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul, H.: A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Nav. Res. Logist. 34(2), 161\u2013172 (1987)","journal-title":"Nav. Res. Logist."},{"issue":"10201026","key":"2_CR35","first-page":"1","volume":"16","author":"F Qian","year":"2007","unstructured":"Qian, F., Ding, R.: Simulated annealing for the 0\/1 multidimensional knapsack problem. Numer. Math.-Engl. Ser. 16(10201026), 1\u20137 (2007)","journal-title":"Numer. Math.-Engl. Ser."},{"key":"2_CR36","unstructured":"Sahoo, S., Lampert, C., Martius, G.: Learning equations for extrapolation and control. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 4442\u20134450. PMLR, 10\u201315 July 2018"},{"issue":"4","key":"2_CR37","doi-asserted-by":"publisher","first-page":"B-196","DOI":"10.1287\/mnsc.15.4.b196","volume":"15","author":"S Senju","year":"1968","unstructured":"Senju, S., Toyoda, Y.: An approach to linear programming with 0\u20131 variables. Manag. Sci. 15(4), B-196-B-207 (1968). https:\/\/doi.org\/10.1287\/mnsc.15.4.b196","journal-title":"Manag. Sci."},{"key":"2_CR38","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-14834-7_14","volume-title":"Contemporary Computing","author":"S Sundar","year":"2010","unstructured":"Sundar, S., Singh, A., Rossi, A.: An artificial bee colony algorithm for the 0\u20131 multidimensional knapsack problem. In: Ranka, S., et al. (eds.) IC3 2010. CCIS, vol. 94, pp. 141\u2013151. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14834-7_14"},{"issue":"16","key":"2_CR39","doi-asserted-by":"publisher","first-page":"eaay2631","DOI":"10.1126\/sciadv.aay2631","volume":"6","author":"SM Udrescu","year":"2020","unstructured":"Udrescu, S.M., Tegmark, M.: AI Feynman: a physics-inspired method for symbolic regression. Sci. Adv. 6(16), eaay2631 (2020). https:\/\/doi.org\/10.1126\/sciadv.aay2631","journal-title":"Sci. Adv."},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Van Lon, R.R., Holvoet, T., Vanden Berghe, G., Wenseleers, T., Branke, J.: Evolutionary synthesis of multi-agent systems for dynamic dial-a-ride problems. In: Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2012, pp. 331\u2013336. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2330784.2330832","DOI":"10.1145\/2330784.2330832"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Volgenant, A., Zoon, J.A.: An improved heuristic for multidimensional 0-1 knapsack problems. J. Oper. Res. Soc. 41(10), 963\u2013970 (1990). https:\/\/doi.org\/10.2307\/2583274. http:\/\/www.palgrave-journals.com\/doifinder\/10.1057\/jors.1990.148","DOI":"10.2307\/2583274"},{"issue":"8\u20139","key":"2_CR42","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s00500-008-0354-4","volume":"13","author":"E \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Ba\u015faran, C.: A case study of memetic algorithms for constraint optimization. Soft. Comput. 13(8\u20139), 871\u2013882 (2008). https:\/\/doi.org\/10.1007\/s00500-008-0354-4","journal-title":"Soft. Comput."}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:03:55Z","timestamp":1649009035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04148-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031041471","9783031041488"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04148-8_2","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)"}}]}}