{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T02:21:31Z","timestamp":1773109291690,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030856717","type":"print"},{"value":"9783030856724","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85672-4_22","type":"book-chapter","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:02:30Z","timestamp":1629147750000},"page":"294-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving QAP with Auto-parameterization in Parallel Hybrid Metaheuristics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3672-1630","authenticated-orcid":false,"given":"Jonathan","family":"Duque","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0762-0571","authenticated-orcid":false,"given":"Danny A.","family":"M\u00fanera","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2700-2271","authenticated-orcid":false,"given":"Daniel","family":"D\u00edaz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1613-4631","authenticated-orcid":false,"given":"Salvador","family":"Abreu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Abdel-Basset, M., Manogaran, G., Rashad, H., Zaied, A.N.H.: A comprehensive review of quadratic assignment problem: variants, hybrids and applications. J. Ambient Intell. Human. Comput. 1\u201324 (2018). https:\/\/doi.org\/10.1007\/s12652-018-0917-x","DOI":"10.1007\/s12652-018-0917-x"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Barbosa, E.B., Senne, E.L.: A heuristic for optimization of metaheuristics by means of statistical methods. In: ICORES 2017 - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems 2017-January (Icores), pp. 203\u2013210 (2017). https:\/\/doi.org\/10.5220\/0006106402030210","DOI":"10.5220\/0006106402030210"},{"issue":"9","key":"22_CR3","first-page":"42","volume":"96","author":"RK Bhati","year":"2014","unstructured":"Bhati, R.K., Rasool, A.: Quadratic assignment problem and its relevance to the real world: a survey. Int. J. Comput. Appl. 96(9), 42\u201347 (2014)","journal-title":"Int. J. Comput. Appl."},{"key":"22_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning Metaheuristics: A Machine Learning Perspective","author":"M Birattari","year":"2009","unstructured":"Birattari, M., Kacprzyk, J.: Tuning Metaheuristics: A Machine Learning Perspective, vol. 197. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00483-4"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33860-1_1","volume-title":"Theory and Practice of Natural Computing","author":"C Blum","year":"2012","unstructured":"Blum, C.: Hybrid metaheuristics in combinatorial optimization: a tutorial. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) TPNC 2012. LNCS, vol. 7505, pp. 1\u201310. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33860-1_1"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0004-3702(00)00007-2","volume":"119","author":"S Boettcher","year":"2000","unstructured":"Boettcher, S., Percus, A.: Nature\u2019s way of optimizing. Artif. Intell. 119(1), 275\u2013286 (2000). https:\/\/doi.org\/10.1016\/S0004-3702(00)00007-2","journal-title":"Artif. Intell."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efd","year":"2013","unstructured":"Boussa\u00efd, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82\u2013117 (2013). https:\/\/doi.org\/10.1016\/j.ins.2013.02.041","journal-title":"Inf. Sci."},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"RE Burkard","year":"1991","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. Eur. J. Oper. Res. 55(1), 115\u2013119 (1991). https:\/\/doi.org\/10.1016\/0377-2217(91)90197-4","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR9","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-91086-4_14","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2019","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches: revisited. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 453\u2013477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_14"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-014-9168-4","volume":"20","author":"Y Caniou","year":"2014","unstructured":"Caniou, Y., Codognet, P., Richoux, F., Diaz, D., Abreu, S.: Large-scale parallelism for constraint-based local search: the costas array case study. Constraints 20(1), 1\u201327 (2014). https:\/\/doi.org\/10.1007\/s10601-014-9168-4","journal-title":"Constraints"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Codognet, P., Munera, D., Diaz, D., Abreu, S.: Parallel local search (2018). https:\/\/doi.org\/10.1007\/978-3-319-63516-3_10","DOI":"10.1007\/978-3-319-63516-3_10"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/0471739383.ch15","volume-title":"Parallel Metaheuristics","author":"C Cotta","year":"2005","unstructured":"Cotta, C., Talbi, E.G., Alba, E.: Parallel hybrid metaheuristics. In: Parallel Metaheuristics, pp. 347\u2013370. Wiley, Hoboken (2005). https:\/\/doi.org\/10.1002\/0471739383.ch15"},{"key":"22_CR13","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-1-4419-1665-5_17","volume-title":"Handbook of Metaheuristics","author":"TG Crainic","year":"2010","unstructured":"Crainic, T.G., Toulouse, M.: Parallel meta-heuristics. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 497\u2013541. Springer, US (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_17"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.engappai.2016.02.004","volume":"52","author":"T Dokeroglu","year":"2016","unstructured":"Dokeroglu, T., Cosar, A.: A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem. Eng. Appl. Artif. Intell. 52, 10\u201325 (2016). https:\/\/doi.org\/10.1016\/j.engappai.2016.02.004","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/S0377-2217(03)00438-7","volume":"160","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. Eur. J. Oper. Res. 160(2), 416\u2013422 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.cie.2010.11.014","volume":"60","author":"N Fescioglu-Unver","year":"2011","unstructured":"Fescioglu-Unver, N., Kokar, M.M.: Self controlling tabu search algorithm for the quadratic assignment problem. Comput. Ind. Eng. 60(2), 310\u2013319 (2011). https:\/\/doi.org\/10.1016\/j.cie.2010.11.014","journal-title":"Comput. Ind. Eng."},{"key":"22_CR17","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\u2014part II. ORSA J. Comput. 2, 4\u201332 (1990). https:\/\/doi.org\/10.1287\/ijoc.2.1.4","journal-title":"ORSA J. Comput."},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.ejor.2006.10.032","volume":"183","author":"Y Hani","year":"2007","unstructured":"Hani, Y., Amodeo, L., Yalaoui, F., Chen, H.: Ant colony optimization for solving an industrial layout problem. Eur. J. Oper. Res. 183(2), 633\u2013642 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.10.032","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"issue":"2","key":"22_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","volume":"24","author":"C Huang","year":"2020","unstructured":"Huang, C., Li, Y., Yao, X.: A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans. Evol. Comput. 24(2), 201\u2013216 (2020). https:\/\/doi.org\/10.1109\/TEVC.2019.2921598","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2808","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009). https:\/\/doi.org\/10.1613\/jair.2808","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2014","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, \u00c1.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19(2), 167\u2013187 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4598","key":"22_CR24","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\u201380 (1983)","journal-title":"Science"},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957). https:\/\/doi.org\/10.2307\/1907742","journal-title":"Econometrica"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Lopez, J., Munera, D., Diaz, D., Abreu, S.: On integrating population-based metaheuristics with cooperative parallelism. In: Proceedings - 2018 IEEE 32nd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018 (2018). https:\/\/doi.org\/10.1109\/IPDPSW.2018.00100","DOI":"10.1109\/IPDPSW.2018.00100"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-319-99253-2_35","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"J L\u00f3pez","year":"2018","unstructured":"L\u00f3pez, J., M\u00fanera, D., Diaz, D., Abreu, S.: Weaving of metaheuristics with cooperative parallelism. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 436\u2013448. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_35"},{"key":"22_CR28","doi-asserted-by":"publisher","unstructured":"Loukil, L., Mehdi, M., Melab, N., Talbi, E.G., Bouvry, P.: A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid. In: IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium (2014). https:\/\/doi.org\/10.1109\/IPDPS.2009.5161126","DOI":"10.1109\/IPDPS.2009.5161126"},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-39930-8_3","volume-title":"Handbook of Heuristics","author":"P Moscato","year":"2004","unstructured":"Moscato, P., Cotta, C., Mendes, A.: Memetic algorithms. In: Handbook of Heuristics, vol. 1\u20132, pp. 53\u201385. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-39930-8_3"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-39636-1_4","volume-title":"Hybrid Metaheuristics","author":"D Munera","year":"2016","unstructured":"Munera, D., Diaz, D., Abreu, S.: Hybridization as cooperative parallelism for\u00a0the\u00a0quadratic assignment problem. In: Blesa, M.J., et al. (eds.) HM 2016. LNCS, vol. 9668, pp. 47\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39636-1_4"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-30698-8_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"D Munera","year":"2016","unstructured":"Munera, D., Diaz, D., Abreu, S.: Solving the quadratic assignment problem with cooperative parallel extremal optimization. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 251\u2013266. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_17"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-44320-0_2","volume-title":"Evolutionary Computation in Combinatorial Optimisation","author":"D Munera","year":"2014","unstructured":"Munera, D., Diaz, D., Abreu, S., Codognet, P.: A parametric framework for cooperative parallel local search. In: Blum, C., Ochoa, G. (eds.) EvoCOP 2014. LNCS, vol. 8600, pp. 13\u201324. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44320-0_2"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: Solving hard stable matching problems via local search and cooperative parallelization. In: AAAI, Austin, TX, USA (2015)","DOI":"10.1609\/aaai.v29i1.9360"},{"issue":"3","key":"22_CR34","first-page":"281","volume":"11","author":"G Palubeckis","year":"2000","unstructured":"Palubeckis, G.: An algorithm for construction of test cases for the quadratic assignment problem. Informatica, Lith. Acad. Sci. 11(3), 281\u2013296 (2000)","journal-title":"Informatica, Lith. Acad. Sci."},{"issue":"1","key":"22_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBIC.2019.097731","volume":"13","author":"RS Parpinelli","year":"2019","unstructured":"Parpinelli, R.S., Plichoski, G.F., Silva, R.S.D., Narloch, P.H.: A review of techniques for online control of parameters in swarm intelligence and evolutionary computation algorithms. Int. J. Bio-Inspired Comput. 13(1), 1\u201320 (2019)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"22_CR36","unstructured":"Saifullah Hussin, M.: Stochastic local search algorithms for single and bi-objective quadratic assignment problems. Ph.D. thesis, Universit\u00e9 de Bruxelles (2016)"},{"key":"22_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.11.035","author":"A Silva","year":"2020","unstructured":"Silva, A., Coelho, L.C., Darvish, M.: Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search. Eur. J. Oper. Res. (xxxx) (2020). https:\/\/doi.org\/10.1016\/j.ejor.2020.11.035","journal-title":"Eur. J. Oper. Res. (xxxx)"},{"issue":"4\u20135","key":"22_CR38","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4\u20135), 443\u2013455 (1991). https:\/\/doi.org\/10.1016\/S0167-8191(05)80147-4","journal-title":"Parallel Comput."},{"issue":"1","key":"22_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10852-005-9029-7","volume":"5","author":"EG Talbi","year":"2006","unstructured":"Talbi, E.G., Bachelet, V.: COSEARCH: a parallel cooperative metaheuristic. J. Math. Modell. Algorithms 5(1), 5\u201322 (2006). https:\/\/doi.org\/10.1007\/s10852-005-9029-7","journal-title":"J. Math. Modell. Algorithms"},{"issue":"1","key":"22_CR40","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"DM Tate","year":"1995","unstructured":"Tate, D.M., Smith, A.E.: A genetic approach to the quadratic assignment problem. Comput. Oper. Res. 22(1), 73\u201383 (1995). https:\/\/doi.org\/10.1016\/0305-0548(93)E0020-T","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"22_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997). https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR42","doi-asserted-by":"publisher","unstructured":"Yagiura, M., Ibaraki, T.: Local search (2002). https:\/\/doi.org\/10.1201\/9781420010749","DOI":"10.1201\/9781420010749"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85672-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T13:17:12Z","timestamp":1673097432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85672-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856717","9783030856724"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85672-4_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Catania","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2021a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"27","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":"44% - 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":"3","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":"4","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held in a virtual mode.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}