{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:50:14Z","timestamp":1743079814795,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"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-14714-2_20","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"279-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Algorithm for\u00a0Vehicle Routing with\u00a0Diversity Oscillation Mechanism"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0022-7531","authenticated-orcid":false,"given":"Piotr","family":"Cybula","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8839-4873","authenticated-orcid":false,"given":"Przemys\u0142aw","family":"Pe\u0142ka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7323-5017","authenticated-orcid":false,"given":"Marek","family":"Rogalski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4594-1854","authenticated-orcid":false,"given":"Piotr","family":"Sielski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Ahuja, R.K., \u00d6zlem Ergun, Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1), 75\u2013102 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00338-9, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X01003389","DOI":"10.1016\/S0166-218X(01)00338-9"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s13676-017-0111-x","volume":"7","author":"T Borthen","year":"2017","unstructured":"Borthen, T., Loennechen, H., Wang, X., Fagerholt, K., Vidal, T.: A genetic search-based heuristic for a fleet size and periodic routing problem with application to offshore supply planning. EURO J. Transp. Logist. 7(2), 121\u2013150 (2017). https:\/\/doi.org\/10.1007\/s13676-017-0111-x","journal-title":"EURO J. Transp. Logist."},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-75514-2_2","volume-title":"Hybrid Metaheuristics","author":"M Boudia","year":"2007","unstructured":"Boudia, M., Prins, C., Reghioui, M.: An effective memetic algorithm with population management for the split delivery vehicle routing problem. In: Bartz-Beielstein, T., et al. (eds.) HM 2007. LNCS, vol. 4771, pp. 16\u201330. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75514-2_2"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Engi. 99, 300 \u2013 313 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.12.007, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835215004775","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Cherkesly, M., Desaulniers, G., Laporte, G.: A population-based metaheuristic for the pickup and delivery problem with time windows and lifo loading. Comput. Oper. Res. 62, 23\u201335 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.04.002, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054815000829","DOI":"10.1016\/j.cor.2015.04.002"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Christiaens, J., Vanden Berghe, G.: Slack induction by string removals for vehicle routing problems. Transp. Sci. 54(2), 417\u2013433 (2020). https:\/\/doi.org\/10.1287\/trsc.2019.0914","DOI":"10.1287\/trsc.2019.0914"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TEVC.2017.2704781","volume":"22","author":"A Cully","year":"2018","unstructured":"Cully, A., Demiris, Y.: Quality and diversity optimization: a unifying modular framework. IEEE Trans. Evol. Comput. 22(2), 245\u2013259 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2704781","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Cybula, P., Rogalski, M., Sielski, P., Jaszkiewicz, A., Pe\u0142ka, P.: Effective recombination operators for the family of vehicle routing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO 2021, pp. 121\u2013122. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3449726.3459574","DOI":"10.1145\/3449726.3459574"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing, 2nd edn. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8","DOI":"10.1007\/978-3-662-44874-8"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Folkestad, C.A., Hansen, N., Fagerholt, K., Andersson, H., Pantuso, G.: Optimal charging and repositioning of electric vehicles in a free-floating carsharing system. Comput. Oper. Res. 113, 104771 (2020). https:\/\/doi.org\/10.1016\/j.cor.2019.104771, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054819302138","DOI":"10.1016\/j.cor.2019.104771"},{"key":"20_CR11","unstructured":"Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: University of Jyvaskyla, pp. 57\u201364 (1999)"},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/TEVC.2018.2877215","volume":"23","author":"D Gravina","year":"2019","unstructured":"Gravina, D., Liapis, A., Yannakakis, G.N.: Quality diversity through surprise. IEEE Trans. Evol. Comput. 23(4), 603\u2013616 (2019). https:\/\/doi.org\/10.1109\/TEVC.2018.2877215","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10732-019-09431-y","volume":"26","author":"QM Ha","year":"2019","unstructured":"Ha, Q.M., Deville, Y., Pham, Q.D., H\u00e0, M.H.: A hybrid genetic algorithm for the traveling salesman problem with drone. J. Heurist. 26(2), 219\u2013247 (2019). https:\/\/doi.org\/10.1007\/s10732-019-09431-y","journal-title":"J. Heurist."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-78604-7_22","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"H Hashimoto","year":"2008","unstructured":"Hashimoto, H., Yagiura, M.: A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 254\u2013265. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78604-7_22"},{"issue":"11","key":"20_CR15","doi-asserted-by":"publisher","first-page":"7665","DOI":"10.1007\/s00521-018-3592-0","volume":"31","author":"K Hussain","year":"2018","unstructured":"Hussain, K., Salleh, M.N.M., Cheng, S., Shi, Y.: On the exploration and exploitation in popular swarm-based metaheuristic algorithms. Neural Comput. Appl. 31(11), 7665\u20137683 (2018). https:\/\/doi.org\/10.1007\/s00521-018-3592-0","journal-title":"Neural Comput. Appl."},{"issue":"4598","key":"20_CR16","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., Vecchi, M.: Optimization by Simulated Annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Konstantakopoulos, G.D., Gayialis, S.P., Kechagias, E.P.: Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper. Res. (2020). https:\/\/doi.org\/10.1007\/s12351-020-00600-7","DOI":"10.1007\/s12351-020-00600-7"},{"issue":"7","key":"20_CR18","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.3966\/160792642020122107002","volume":"21","author":"N Liu","year":"2020","unstructured":"Liu, N., Pan, J.S., Chu, S.C.: A competitive learning QUasi affine TRansformation evolutionary for global optimization and its application in CVRP. J. Internet Technol. 21(7), 1863\u20131883 (2020). https:\/\/doi.org\/10.3966\/160792642020122107002","journal-title":"J. Internet Technol."},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 363\u2013397. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_12","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-15844-5_54","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Kobayashi, S.: A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 536\u2013545. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_54"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-78604-7_5","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y Nagata","year":"2008","unstructured":"Nagata, Y., Br\u00e4ysy, O.: Efficient local search limitation strategies for vehicle routing problems. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 48\u201360. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78604-7_5"},{"issue":"4","key":"20_CR22","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Braysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4), 724\u2013737 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"20_CR23","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1109\/TEVC.2010.2043362","volume":"14","author":"T Park","year":"2010","unstructured":"Park, T., Ryu, K.R.: A dual-population genetic algorithm for adaptive diversity control. IEEE Trans. Evol. Comput. 14(6), 865\u2013884 (2010). https:\/\/doi.org\/10.1109\/TEVC.2010.2043362","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Petrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 798\u2013803 (1996). https:\/\/doi.org\/10.1109\/ICEC.1996.542703","DOI":"10.1109\/ICEC.1996.542703"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004). https:\/\/doi.org\/10.1016\/S0305-0548(03)00158-8, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054803001588","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Qu, Y., Bard, J.F.: The heterogeneous pickup and delivery problem with configurable vehicle capacity. Transp. Res. Part C - Emerg. Technol. 32(SI), 1\u201320 (2013). https:\/\/doi.org\/10.1016\/j.trc.2013.03.007","DOI":"10.1016\/j.trc.2013.03.007"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Repoussis, P.P., Tarantilis, C.D., Braysy, O., Ioannou, G.: A hybrid evolution strategy for the open vehicle routing problem. Comput. Oper. Res. 37(3, SI), 443\u2013455 (2010). https:\/\/doi.org\/10.1016\/j.cor.2008.11.003","DOI":"10.1016\/j.cor.2008.11.003"},{"issue":"3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/TEVC.2014.2319051","volume":"19","author":"NR Sabar","year":"2015","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Automatic design of a hyper-heuristic framework with gene expression programming for combinatorial optimization problems. IEEE Trans. Evol. Comput. 19(3), 309\u2013325 (2015). https:\/\/doi.org\/10.1109\/TEVC.2014.2319051","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Sabar, N.R., Bhaskar, A., Chung, E., Turky, A., Song, A.: An adaptive memetic approach for heterogeneous vehicle routing problems with two-dimensional loading constraints. Swarm Evol. Comput. 58, 100730 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100730, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2210650220303837","DOI":"10.1016\/j.swevo.2020.100730"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Segura, C., Botello Rionda, S., Hernandez Aguirre, A., Ivvan Valdez Pena, S.: A novel diversity-based evolutionary algorithm for the traveling salesman problem. In: Silva, S (ed.) GECCO 2015: Proceedings of the 2015 Genetic and Evolutionary Computation Conference, pp. 489\u2013496. Assoc Comp Machinery SIGEVO (2015). https:\/\/doi.org\/10.1145\/2739480.2754802, 17th Genetic and Evolutionary Computation Conference (GECCO), Madrid, San Marino, 11\u201315 July 2015","DOI":"10.1145\/2739480.2754802"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Squillero, G., Tonda, A.: Divergence of character and premature convergence: a survey of methodologies for promoting diversity in evolutionary optimization. Inf. Sci. 329, 782\u2013799 (2016). https:\/\/doi.org\/10.1016\/j.ins.2015.09.056, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S002002551500729X,special issue on Discovery Science","DOI":"10.1016\/j.ins.2015.09.056"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Sudholt, D., Squillero, G.: Theory and practice of population diversity in evolutionary computation. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. GECCO 2020, pp. 975\u2013992. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3377929.3389892","DOI":"10.1145\/3377929.3389892"},{"key":"20_CR33","series-title":"Centre for Research on Transportation","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-5755-5_1","volume-title":"Fleet Management and Logistics","author":"P Toth","year":"1998","unstructured":"Toth, P., Vigo, D.: Exact solution of the vehicle routing problem. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics. CRT, pp. 1\u201331. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5755-5_1"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718515"},{"issue":"1","key":"20_CR35","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013)","journal-title":"Comput. Oper. Res."},{"key":"20_CR36","doi-asserted-by":"publisher","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658\u2013673 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.09.045, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S037722171300800X","DOI":"10.1016\/j.ejor.2013.09.045"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Xu, Z., Li, H., Wang, Y.: An improved genetic algorithm for vehicle routing problem. In: 2011 International Conference on Computational and Information Sciences, pp. 1132\u20131135 (2011). https:\/\/doi.org\/10.1109\/ICCIS.2011.78","DOI":"10.1109\/ICCIS.2011.78"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Zhu, K.: A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows. In: Werner, B (ed.) 15TH IEEE International Conference on Tools with Artificial Intelligence, Proceedings. Proceedings-International Conference on Tools With Artificial Intelligence, pp. 176\u2013183. IEEE Comp Sci (2003). https:\/\/doi.org\/10.1109\/TAI.2003.1250187, 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), Sacramento, CA, 03\u201305 November 2003","DOI":"10.1109\/TAI.2003.1250187"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:43:24Z","timestamp":1710261804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"185","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":"85","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":"3.75","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":"3.11","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)"}}]}}