{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:41Z","timestamp":1742912621224,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030624590"},{"type":"electronic","value":"9783030624606"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62460-6_21","type":"book-chapter","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:03:00Z","timestamp":1605002580000},"page":"235-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Capacitated Vehicle Routing Problem with Order Release Time Based on a Hybrid Harmony Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0571-8316","authenticated-orcid":false,"given":"Ling","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5335-2144","authenticated-orcid":false,"given":"Sen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5822-8743","authenticated-orcid":false,"given":"Ben","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6873-1983","authenticated-orcid":false,"given":"Hui","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.sbspro.2014.01.1483","volume":"125","author":"R Gevaers","year":"2014","unstructured":"Gevaers, R., Van de Voorde, E., Vanelslander, T.: Cost modelling and simulation of last-mile characteristics in an innovative B2C supply chain environment with implications on urban areas and cities. Proc. Soc. Behav. Sci. 125, 398\u2013411 (2014). https:\/\/doi.org\/10.1016\/j.sbspro.2014.01.1483","journal-title":"Proc. Soc. Behav. Sci."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1080\/00207543.2012.677071","volume":"51","author":"CY Low","year":"2013","unstructured":"Low, C.Y., Li, R.K., Chang, C.M.: Integrated scheduling of production and delivery with time windows. Int. J. Logist. Res. Appl. 51, 897\u2013909 (2013). https:\/\/doi.org\/10.1080\/00207543.2012.677071","journal-title":"Int. J. Logist. Res. Appl."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1016\/j.ejor.2013.07.034","volume":"236","author":"K Li","year":"2014","unstructured":"Li, K., Chen, B., Sivakumar, A.I., Wu, Y.: An inventory\u2013routing problem with the objective of travel time minimization. Eur. J. Oper. Res. 236, 936\u2013945 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.07.034","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959). https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag. Sci."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto, W.Y., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Int. J. Prod. Res. 215, 126\u2013135 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2011.06.006","journal-title":"Int. J. Prod. Res."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2016.05.023","volume":"61","author":"S Akpinar","year":"2016","unstructured":"Akpinar, S.: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Exp. Syst. Appl. 61, 28\u201338 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2016.05.023","journal-title":"Exp. Syst. Appl."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.asoc.2019.03.008","volume":"80","author":"R Liu","year":"2019","unstructured":"Liu, R., Jiang, Z.: A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints. Appl. Soft Comput. 80, 18\u201330 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.03.008","journal-title":"Appl. Soft Comput."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ejor.2017.10.017","volume":"266","author":"T Liu","year":"2018","unstructured":"Liu, T., Luo, Z., Qin, H., Lim, A.: A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. Eur. J. Oper. Res. 266, 487\u2013497 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.10.017","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"104833","DOI":"10.1016\/j.cor.2019.104833","volume":"114","author":"G Marques","year":"2020","unstructured":"Marques, G., Sadykov, R., Deschamps, J.-C., Dupas, R.: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res. 114, 104833 (2020). https:\/\/doi.org\/10.1016\/j.cor.2019.104833","journal-title":"Comput. Oper. Res."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2017.05.004","volume":"109","author":"KKH Ng","year":"2017","unstructured":"Ng, K.K.H., Lee, C.K.M., Zhang, S.Z., Wu, K., Ho, W.: A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput. Ind. Eng. 109, 151\u2013168 (2017). https:\/\/doi.org\/10.1016\/j.cie.2017.05.004","journal-title":"Comput. Ind. Eng."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","volume":"265","author":"L Wei","year":"2018","unstructured":"Wei, L., Zhang, Z., Zhang, D., Leung, S.C.H.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 265, 843\u2013859 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.08.035","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1016\/j.cor.2011.11.008","volume":"39","author":"A Bortfeldt","year":"2012","unstructured":"Bortfeldt, A.: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. 39, 2248\u20132257 (2012). https:\/\/doi.org\/10.1016\/j.cor.2011.11.008","journal-title":"Comput. Oper. Res."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2014.10.048","volume":"242","author":"S Allahyari","year":"2015","unstructured":"Allahyari, S., Salari, M., Vigo, D.: A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur. J. Oper. Res. 242, 756\u2013768 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.10.048","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"106011","DOI":"10.1016\/j.cie.2019.106011","volume":"137","author":"Z Xu","year":"2019","unstructured":"Xu, Z., Elomri, A., Pokharel, S., Mutlu, F.: A model for capacitated green vehicle routing problem with the time-varying vehicle speed and soft time windows. Comput. Ind. Eng. 137, 106011 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.106011","journal-title":"Comput. Ind. Eng."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ejor.2017.11.039","volume":"267","author":"C Ciancio","year":"2018","unstructured":"Ciancio, C., Lagan\u00e1, D., Vocaturo, F.: Branch-price-and-cut for the mixed capacitated general routing problem with time windows. Eur. J. Oper. Res. 267, 187\u2013199 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.11.039","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.cor.2016.03.013","volume":"89","author":"S Madankumar","year":"2018","unstructured":"Madankumar, S., Rajendran, C.: Mathematical models for green vehicle routing problems with pickup and delivery: a case of semiconductor supply chain. Comput. Oper. Res. 89, 183\u2013192 (2018). https:\/\/doi.org\/10.1016\/j.cor.2016.03.013","journal-title":"Comput. Oper. Res."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.eswa.2018.10.031","volume":"118","author":"EH-C Lu","year":"2019","unstructured":"Lu, E.H.-C., Yang, Y.-W.: A hybrid route planning approach for logistics with pickup and delivery. Exp. Syst. Appl. 118, 482\u2013492 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2018.10.031","journal-title":"Exp. Syst. Appl."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"104858","DOI":"10.1016\/j.cor.2019.104858","volume":"115","author":"RP Hornstra","year":"2020","unstructured":"Hornstra, R.P., Silva, A., Roodbergen, K.J., Coelho, L.C.: The vehicle routing problem with simultaneous pickup and delivery and handling costs. Comput. Oper. Res. 115, 104858 (2020). https:\/\/doi.org\/10.1016\/j.cor.2019.104858","journal-title":"Comput. Oper. Res."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.eswa.2016.12.013","volume":"72","author":"Y Shi","year":"2017","unstructured":"Shi, Y., Boudouh, T., Grunder, O.: A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Exp. Syst. Appl. 72, 160\u2013176 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2016.12.013","journal-title":"Exp. Syst. Appl."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.cor.2018.06.012","volume":"99","author":"A Gutierrez","year":"2018","unstructured":"Gutierrez, A., Dieulle, L., Labadie, N., Velasco, N.: A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 99, 135\u2013147 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.06.012","journal-title":"Comput. Oper. Res."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ejor.2018.03.034","volume":"270","author":"L Bertazzi","year":"2018","unstructured":"Bertazzi, L., Secomandi, N.: Faster rollout search for the vehicle routing problem with stochastic demands and restocking. Eur. J. Oper. Res. 270, 487\u2013497 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2018.03.034","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129\u2013146 (2014). https:\/\/doi.org\/10.1016\/j.disopt.2014.03.001","journal-title":"Discrete Optim."},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.jclepro.2019.03.185","volume":"227","author":"Y Li","year":"2019","unstructured":"Li, Y., Soleimani, H., Zohal, M.: An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives. J. Clean. Prod. 227, 1161\u20131172 (2019). https:\/\/doi.org\/10.1016\/j.jclepro.2019.03.185","journal-title":"J. Clean. Prod."},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2017.05.039","volume":"263","author":"V Leggieri","year":"2017","unstructured":"Leggieri, V., Haouari, M.: Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems. Eur. J. Oper. Res. 263, 755\u2013767 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.05.039","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.asoc.2018.12.036","volume":"76","author":"A Bevilaqua","year":"2019","unstructured":"Bevilaqua, A., Bevilaqua, D., Yamanaka, K.: Parallel island based memetic algorithm with Lin-Kernighan local search for a real-life two-echelon heterogeneous vehicle routing problem based on Brazilian wholesale companies. Appl. Soft Comput. 76, 697\u2013711 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2018.12.036","journal-title":"Appl. Soft Comput."},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2019.02.048","volume":"277","author":"M Eskandarpour","year":"2019","unstructured":"Eskandarpour, M., Ouelhadj, D., Hatami, S., Juan, A.A., Khosravi, B.: Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges. Eur. J. Oper. Res. 277, 479\u2013491 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.02.048","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2015.06.057","volume":"247","author":"C Archetti","year":"2015","unstructured":"Archetti, C., Feillet, D., Speranza, M.G.: Complexity of routing problems with release dates. Eur. J. Oper. Res. 247, 797\u2013803 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2015.06.057","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ejor.2017.09.020","volume":"266","author":"D Reyes","year":"2018","unstructured":"Reyes, D., Erera, A.L., Savelsbergh, M.W.P.: Complexity of routing problems with release dates and deadlines. Eur. J. Oper. Res. 266, 29\u201334 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.09.020","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cor.2018.05.001","volume":"98","author":"C Archetti","year":"2018","unstructured":"Archetti, C., Feillet, D., Mor, A., Speranza, M.G.: An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Comput. Oper. Res. 98, 24\u201337 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.05.001","journal-title":"Comput. Oper. Res."},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1080\/0305215x.2016.1188092","volume":"49","author":"L Liu","year":"2017","unstructured":"Liu, L., Li, K., Liu, Z.: A capacitated vehicle routing problem with order available time in e-commerce industry. Eng. Optim. 49, 449\u2013465 (2017). https:\/\/doi.org\/10.1080\/0305215x.2016.1188092","journal-title":"Eng. Optim."},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1080\/0305215x.2019.1642880","volume":"52","author":"W Li","year":"2019","unstructured":"Li, W., Wu, Y., Kumar, P.N.R., Li, K.: Multi-trip vehicle routing problem with order release time. Eng. Optim. 52, 1279\u20131294 (2019). https:\/\/doi.org\/10.1080\/0305215x.2019.1642880","journal-title":"Eng. Optim."},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1287\/trsc.2015.0608","volume":"50","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza, D., Absi, N., Feillet, D.: The multi-trip vehicle routing problem with time windows and release dates. Transp. Sci. 50, 676\u2013693 (2016). https:\/\/doi.org\/10.1287\/trsc.2015.0608","journal-title":"Transp. Sci."},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"101866","DOI":"10.1016\/j.tre.2020.101866","volume":"135","author":"L Zhen","year":"2020","unstructured":"Zhen, L., Ma, C., Wang, K., Xiao, L., Zhang, W.: Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp. Res. E Logist. Transp. Rev. 135, 101866 (2020). https:\/\/doi.org\/10.1016\/j.tre.2020.101866","journal-title":"Transp. Res. E Logist. Transp. Rev."},{"key":"21_CR34","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1287\/ijoc.2017.0756","volume":"29","author":"BC Shelbourne","year":"2018","unstructured":"Shelbourne, B.C., Battarra, M., Potts, C.N.: The vehicle routing problem with release and due dates. INFORMS J. Comput. 29, 705\u2013723 (2018). https:\/\/doi.org\/10.1287\/ijoc.2017.0756","journal-title":"INFORMS J. Comput."},{"key":"21_CR35","doi-asserted-by":"publisher","first-page":"113302","DOI":"10.1016\/j.eswa.2020.113302","volume":"150","author":"JT Soman","year":"2020","unstructured":"Soman, J.T., Patil, R.J.: A scatter search method for heterogeneous fleet vehicle routing problem with release dates under lateness dependent tardiness costs. Expert Syst. Appl. 150, 113302 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2020.113302","journal-title":"Expert Syst. Appl."},{"key":"21_CR36","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, 60\u201368 (2001). https:\/\/doi.org\/10.1177\/003754970107600201","journal-title":"Simulation"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62460-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:27:18Z","timestamp":1605004038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62460-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030624590","9783030624606"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62460-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"ML4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ml4cs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ml4cs2020\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"360","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":"118","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":"40","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":"33% - 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":"2.2","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":"8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}