{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T16:10:10Z","timestamp":1751731810291,"version":"3.41.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959290"},{"type":"electronic","value":"9783319959306"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95930-6_83","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:12:40Z","timestamp":1530771160000},"page":"831-840","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Application of Ant Colony Algorithms to Solve the Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Mei-xian","family":"Song","sequence":"first","affiliation":[]},{"given":"Jun-qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wang","family":"Yong","sequence":"additional","affiliation":[]},{"given":"Pei-yong","family":"Duan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"83_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"83_CR2","first-page":"1","volume":"2013","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Wang, L., Yang, Y.: Dynamic vehicle routing using an improved variable neighborhood search algorithm. J. Appl. Math. 2013(1), 1\u201321 (2013)","journal-title":"J. Appl. Math."},{"issue":"2","key":"83_CR3","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the Traveling-Salesman Problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"83_CR4","unstructured":"Hinton, G.T.: A thesis regarding the vehicle routing problem including a range of novel techniques for its solution. University of Bristol (2010)"},{"issue":"3","key":"83_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1002\/net.21527","volume":"63","author":"AM Campbell","year":"2014","unstructured":"Campbell, A.M., Wilson, J.H.: Forty years of periodic vehicle routing. Networks 63(3), 2\u201315 (2014)","journal-title":"Networks"},{"issue":"1","key":"83_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/ijoc.1050.0145","volume":"19","author":"JW Ohlmann","year":"2017","unstructured":"Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. Inf. J. Comput. 19(1), 80\u201390 (2017)","journal-title":"Inf. J. Comput."},{"key":"83_CR7","first-page":"1","volume":"2016","author":"Zheng Wang","year":"2016","unstructured":"Wang, Z., Zhou, C.: A three-stage saving-based heuristic for vehicle routing problem with time windows and stochastic travel times. Discrete Dynamics in Nature and Society (2016)","journal-title":"Discrete Dynamics in Nature and Society"},{"issue":"5","key":"83_CR8","first-page":"1","volume":"2016","author":"MAC Ch\u00e1vez","year":"2016","unstructured":"Ch\u00e1vez, M.A.C., Martinez-Oropeza, A.: Feasible initial population with genetic diversity for a population-based algorithm applied to the vehicle routing problem with time windows. Math. Prob. Eng. 2016(5), 1\u201311 (2016)","journal-title":"Math. Prob. Eng."},{"key":"83_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45403-0_15","volume-title":"Metaheuristics for Vehicle Routing Problems","author":"C Prodhon","year":"2016","unstructured":"Prodhon, C., Prins, C.: Metaheuristics for Vehicle Routing Problems. Wiley-IEEE Press, Chichester (2016)"},{"issue":"2","key":"83_CR10","first-page":"32","volume":"47","author":"J Caceres-Cruz","year":"2015","unstructured":"Caceres-Cruz, J., Arias, P., Guimarans, D., et al.: Rich vehicle routing problem: survey. ACM Comput. Sur. 47(2), 32 (2015)","journal-title":"ACM Comput. Sur."},{"issue":"1","key":"83_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yua","year":"2009","unstructured":"Yua, B., Yao, B.: An improved ant colony optimization for vehicle routing problem. Eur. J. Oper. Res. 196(1), 171\u2013176 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"83_CR12","first-page":"115","volume":"23","author":"C-H Chen","year":"2006","unstructured":"Chen, C.-H., Ting, C.-J.: An improved ant colony system algorithm for the vehicle routing problem. J. Chin. Inst. Ind. Eng. 23(2), 115\u2013126 (2006)","journal-title":"J. Chin. Inst. Ind. Eng."},{"issue":"1","key":"83_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"FT Hanshar","year":"2007","unstructured":"Hanshar, F.T., Ombuki-Berman, B.M.: Dynamic vehicle routing using genetic algorithms. Appl. Intell. 27(1), 89\u201399 (2007)","journal-title":"Appl. Intell."},{"key":"83_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, A., Yu, D.: Genetic algorithm for vehicle routing problem. In: International Conference on Transportation Engineering, pp. 2876\u20132881 (2013)","DOI":"10.1061\/9780784413159.417"},{"key":"83_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2017.01.047","volume":"55","author":"AMFM Abdallah","year":"2017","unstructured":"Abdallah, A.M.F.M., Essam, D.L., Sarker, R.A.: On solving periodic re-optimization dynamic vehicle routing problems. Appl. Soft Comput. 55, 1\u201312 (2017)","journal-title":"Appl. Soft Comput."},{"key":"83_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-38610-7_50","volume-title":"Artificial Intelligence and Soft Computing","author":"M Okulewicz","year":"2013","unstructured":"Okulewicz, M., Ma\u0144dziuk, J.: Application of particle swarm optimization algorithm to dynamic vehicle routing problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, Lotfi A., Zurada, Jacek M. (eds.) ICAISC 2013. LNCS (LNAI), vol. 7895, pp. 547\u2013558. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38610-7_50"},{"issue":"4","key":"83_CR17","doi-asserted-by":"publisher","first-page":"4618","DOI":"10.1016\/j.eswa.2011.09.076","volume":"39","author":"MB Chandra","year":"2012","unstructured":"Chandra, M.B., Baskaran, R.: Review: a survey: ant colony optimization based recent research and implementation on several engineering domain. Exp. Syst. Appl. 39(4), 4618\u20134627 (2012)","journal-title":"Exp. Syst. Appl."},{"issue":"6791","key":"83_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1038\/35017500","volume":"406","author":"E Bonabeau","year":"2000","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Inspiration for optimization from social insect behavior. Nature 406(6791), 39\u201342 (2000)","journal-title":"Nature"},{"issue":"12","key":"83_CR19","first-page":"910","volume":"11","author":"LI Shi-Yong","year":"2003","unstructured":"Shi-Yong, L.I.: Progresses in ant colony optimization algorithm with applications. Comput. Aut. Mea. Control 11(12), 910\u2013911 (2003)","journal-title":"Comput. Aut. Mea. Control"},{"issue":"10","key":"83_CR20","first-page":"1240","volume":"36","author":"QH Wu","year":"1999","unstructured":"Wu, Q.H., Zhang, J.H., Xu, X.H.: An ant colony algorithm with mutation features. J. Comput. Res. Dev. 36(10), 1240\u20131245 (1999)","journal-title":"J. Comput. Res. Dev."},{"key":"83_CR21","first-page":"1","volume":"2018","author":"Haitao Xu","year":"2018","unstructured":"Xu, H., Pu, P., Duan, F.: Dynamic vehicle routing problems with enhanced ant colony optimization. Discrete Dyn. Nat. Soc., 1\u201313 (2018)","journal-title":"Discrete Dynamics in Nature and Society"},{"key":"83_CR22","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2011","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Tsinghua University Press, Siam (2011)"},{"issue":"5","key":"83_CR23","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.trc.2009.08.005","volume":"18","author":"MA Figliozzi","year":"2010","unstructured":"Figliozzi, M.A.: An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Trans. Res. Part C 18(5), 668\u2013679 (2010)","journal-title":"Trans. Res. Part C"},{"key":"83_CR24","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnherimer","year":"1999","unstructured":"Bullnherimer, B., Hartl, R.F.: An improved Ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319\u2013328 (1999)","journal-title":"Ann. Oper. Res."},{"key":"83_CR25","doi-asserted-by":"crossref","unstructured":"Liu, Z., Cai, Y.: Sweep based multiple ant colonies algorithm for capacitated vehicle routing problem. In: IEEE International Conference E-business Engineering, pp. 387\u2013394. IEEE Computing Society (2005)","DOI":"10.1109\/ICEBE.2005.117"},{"key":"83_CR26","unstructured":"Breedam, A.V.: An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem (1996)"},{"issue":"6","key":"83_CR27","first-page":"40","volume":"19","author":"D Jiang","year":"1999","unstructured":"Jiang, D.: A study on the genetic algorithm for vehicle routing problem. Syst. Eng. Pract. 19(6), 40\u201345 (1999)","journal-title":"Syst. Eng. Pract."},{"issue":"2","key":"83_CR28","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1016\/j.eswa.2007.11.060","volume":"36","author":"SW Lin","year":"2009","unstructured":"Lin, S.W., Lee, Z.J., Ying, K.C., et al.: Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst. Appl. 36(2), 1505\u20131512 (2009)","journal-title":"Expert Syst. Appl."},{"key":"83_CR29","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"S Thomas","year":"2000","unstructured":"Thomas, S., Holger, H.H.: MAX\u2013MIN ant system. Future Gener. Comput. Syst. 16, 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"83_CR30","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li, J.Q., Pan, Q.K., Tasgetiren, M.F.: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl. Math. Model. 38(3), 1111\u20131132 (2014)","journal-title":"Appl. Math. Model."},{"issue":"1","key":"83_CR31","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ijpe.2012.11.005","volume":"145","author":"JQ Li","year":"2013","unstructured":"Li, J.Q., Pan, Q.K.: Chemical-reaction optimization for solving fuzzy job-shop scheduling problem with flexible maintenance activities. Int. J. Prod. Econ. 145(1), 4\u201317 (2013)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"83_CR32","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.engappai.2014.09.015","volume":"37","author":"JQ Li","year":"2015","unstructured":"Li, J.Q., Pan, Q.K., Mao, K.: A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Eng. Appl. Artif. Intell. 37(1), 279\u2013292 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"9\u201312","key":"83_CR33","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Gao, K.Z.: Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int. J. Adv. Manuf. Techol. 55(9\u201312), 1159\u20131169 (2011)","journal-title":"Int. J. Adv. Manuf. Techol."},{"issue":"8","key":"83_CR34","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1080\/00207543.2013.848492","volume":"52","author":"YY Han","year":"2014","unstructured":"Han, Y.Y., Gong, D.W., Sun, X.Y., et al.: An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem. Int. J. Prod. Res. 52(8), 2211\u20132231 (2014)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"83_CR35","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/TASE.2015.2425404","volume":"13","author":"JQ Li","year":"2016","unstructured":"Li, J.Q., Pan, Q.K., Kun, M.: A hybrid fruit fly optimization algorithm for the realistic hybrid flowshop rescheduling problem in steelmaking systems. IEEE Trans. Autom. Sci. Eng. 13(2), 932\u2013949 (2016)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"83_CR36","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1080\/00207543.2011.555427","volume":"50","author":"JQ Li","year":"2012","unstructured":"Li, J.Q., Pan, Q.K., Chen, J.: A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems. Int. J. Prod. Res. 50(4), 1063\u20131078 (2012)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"83_CR37","first-page":"647","volume":"59","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Suganthan, P.N., Chua, T.J.: A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Techol. 59(4), 647\u2013662 (2011)","journal-title":"Int. J. Adv. Manuf. Techol."},{"issue":"1\u20134","key":"83_CR38","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00170-012-4337-3","volume":"66","author":"JQ Li","year":"2013","unstructured":"Li, J.Q., Pan, Y.: A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem. Int. J. Adv. Manuf. Techol. 66(1\u20134), 583\u2013596 (2013)","journal-title":"Int. J. Adv. Manuf. Techol."},{"issue":"6","key":"83_CR39","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1109\/TCYB.2015.2444383","volume":"46","author":"JQ Li","year":"2016","unstructured":"Li, J.Q., Pan, Q.K., Duan, P.Y.: An improved artificial bee colony algorithm for solving hybrid flexible flow shop with dynamic operation skipping. IEEE Trans. Cybern. 46(6), 1311\u20131324 (2016)","journal-title":"IEEE Trans. Cybern."},{"issue":"20","key":"83_CR40","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","volume":"316","author":"JQ Li","year":"2015","unstructured":"Li, J.Q., Pan, Q.K.: Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inf. Sci. 316(20), 487\u2013502 (2015)","journal-title":"Inf. Sci."},{"key":"83_CR41","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.knosys.2018.02.029","volume":"148","author":"D Gong","year":"2018","unstructured":"Gong, D., Han, Y., Sun, J.: A novel hybrid multi-objective artificial bee colony algorithm for the blocking lot-streaming flow shop scheduling problems. Knowl. Sys. 148, 115\u2013130 (2018)","journal-title":"Knowl. Sys."},{"issue":"18","key":"83_CR42","doi-asserted-by":"publisher","first-page":"9353","DOI":"10.1016\/j.amc.2012.03.018","volume":"218","author":"JQ Li","year":"2012","unstructured":"Li, J.Q., Pan, Q.K., Xie, S.: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Appl. Mat. Comput. 218(18), 9353\u20139371 (2012)","journal-title":"Appl. Mat. Comput."},{"issue":"4","key":"83_CR43","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"JQ Li","year":"2010","unstructured":"Li, J.Q., Pan, Q.K., Liang, Y.C.: An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems. Comput. Ind. Eng. 59(4), 647\u2013662 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"83_CR44","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.knosys.2014.08.022","volume":"72","author":"JQ Li","year":"2014","unstructured":"Li, J.Q., Pan, Q.K., Mao, K., Suganthan, P.N.: Solving the steelmaking casting problem using an effective fruit fly optimisation algorithm. Knowl. Based Syst. 72(5), 28\u201336 (2014)","journal-title":"Knowl. Based Syst."},{"issue":"9","key":"83_CR45","doi-asserted-by":"publisher","first-page":"2896","DOI":"10.1016\/j.asoc.2012.04.012","volume":"12","author":"JQ Li","year":"2012","unstructured":"Li, J.Q., Pan, Q.K.: Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity. Appl. Soft Comput. 12(9), 2896\u20132912 (2012)","journal-title":"Appl. Soft Comput."},{"key":"83_CR46","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","volume":"24","author":"JQ Li","year":"2014","unstructured":"Li, J.Q., Pan, Q.K., Wang, F.T.: A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl. Soft Comput. 24, 63\u201377 (2014)","journal-title":"Appl. Soft Comput."},{"key":"83_CR47","first-page":"1","volume":"99","author":"Y Han","year":"2017","unstructured":"Han, Y., Gong, D., Jin, Y.C., Pan, Q.K.: Evolutionary multi-objective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE Trans. Cybern. 99, 1\u201314 (2017)","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"83_CR48","doi-asserted-by":"publisher","first-page":"267","DOI":"10.15837\/ijccc.2011.2.2177","volume":"6","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Xie, S.X., Wang, S.: A hybrid artificial bee colony algorithm for flexible job shop scheduling problems. Int. J. Comput. Commun. Control. 6(2), 267\u2013277 (2011)","journal-title":"Int. J. Comput. Commun. Control."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95930-6_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T15:39:04Z","timestamp":1751729944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95930-6_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959290","9783319959306"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95930-6_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","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":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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.46","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":"0","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)"}}]}}