{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:46:52Z","timestamp":1762253212050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375836"},{"type":"electronic","value":"9783030375843"}],"license":[{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"content-version":"tdm","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-37584-3_6","type":"book-chapter","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T01:02:43Z","timestamp":1575939763000},"page":"109-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Genetic Algorithm Approach to Multi-Agent Mission Planning Problems"],"prefix":"10.1007","author":[{"given":"Branko","family":"Miloradovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baran","family":"\u00c7\u00fcr\u00fckl\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Ekstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1364-8127","authenticated-orcid":false,"given":"Alessandro V.","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,11]]},"reference":[{"key":"6_CR1","unstructured":"Alighanbari, M., Kuwata, Y., How, J.P.: Coordination and control of multiple UAVs with timing constraints and loitering. In: Proceedings of the 2003 American Control Conference, vol. 6, pp. 5311\u20135316, June 2003"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker, B.M., Ayechew, M.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5), 787\u2013800 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"key":"6_CR4","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-25017-5_16","volume-title":"Intelligent Distributed Computing IX","author":"G Bello-Orgaz","year":"2016","unstructured":"Bello-Orgaz, G., Ramirez-Atencia, C., Fradera-Gil, J., Camacho, D.: GAMPP: genetic algorithm for UAV mission planning problems. In: Novais, P., Camacho, D., Analide, C., El Fallah Seghrouchni, A., Badica, C. (eds.) Intelligent Distributed Computing IX. SCI, vol. 616, pp. 167\u2013176. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-25017-5_16"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bhatt, N., Chauhan, N.R.: Genetic algorithm applications on job shop scheduling problem: a review. In: International Conference on Soft Computing Techniques and Implementations (ICSCTI), pp. 7\u201314 (2015)","DOI":"10.1109\/ICSCTI.2015.7489556"},{"key":"6_CR6","unstructured":"Brie, A.H., Morignot, P.: Genetic planning using variable length chromosomes. In: International Conference on Automated Planning and Scheduling, pp. 320\u2013329. ICAPS (2005)"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"e0137724","DOI":"10.1371\/journal.pone.0137724","volume":"10","author":"C Contreras-Bolton","year":"2015","unstructured":"Contreras-Bolton, C., Parada, V.: Automatic combination of operators in a genetic algorithm to solve the traveling salesman problem. PLoS One 10(9), e0137724 (2015)","journal-title":"PLoS One"},{"key":"6_CR8","unstructured":"Cushing, W., Kambhampati, S., Mausam, Weld, D.S.: When is temporal planning really temporal? In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI 2007, pp. 1852\u20131859 (2007)"},{"issue":"4","key":"6_CR9","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"28573","DOI":"10.1109\/ACCESS.2018.2831228","volume":"6","author":"A Dorri","year":"2018","unstructured":"Dorri, A., Kanhere, S.S., Jurdak, R.: Multi-agent systems: a survey. IEEE Access 6, 28573\u201328593 (2018)","journal-title":"IEEE Access"},{"issue":"1","key":"6_CR11","first-page":"167","volume":"41","author":"G Finke","year":"1984","unstructured":"Finke, G., Claus, A., Gunn, E.: A two-commodity network flow approach to the traveling salesman problem. Congressus Numerantium 41(1), 167\u2013178 (1984)","journal-title":"Congressus Numerantium"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Frasheri, M., C\u00fcr\u00fckl\u00fc, B., Ekstr\u00f6m, M., Papadopoulos, A.V.: Adaptive autonomy in a search and rescue scenario. In: Proceedings of the 12th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 150\u2013155, September 2018","DOI":"10.1109\/SASO.2018.00026"},{"issue":"9","key":"6_CR13","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B.P., Matari\u0107, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 939\u2013954 (2004)","journal-title":"Int. J. Robot. Res."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2011\/483643","volume":"2011","author":"Giovanni Giardini","year":"2011","unstructured":"Giardini, G., Kalm\u00e1r-Nagy, T.: Genetic algorithm for combinatorial path planning: the subtour problem. Math. Probl. Eng. 1\u201331 (2011)","journal-title":"Mathematical Problems in Engineering"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/net.21765","volume":"71","author":"L Gouveia","year":"2018","unstructured":"Gouveia, L., Pesneau, P., Ruthmair, M., Santos, D.: Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Networks 71(4), 451\u2013465 (2018)","journal-title":"Networks"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","journal-title":"Sci. Am."},{"issue":"10","key":"6_CR17","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"R Qing-dao-er ji","year":"2012","unstructured":"Qing-dao-er ji, R., Wang, Y.: A new hybrid genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 39(10), 2291\u20132299 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ejor.2017.07.027","volume":"265","author":"RL Kadri","year":"2018","unstructured":"Kadri, R.L., Boctor, F.F.: An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case. Eur. J. Oper. Res. 265(2), 454\u2013462 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1, 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"6_CR20","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-18299-5_2","volume-title":"Cooperative Robots and Sensor Networks 2015","author":"A Khamis","year":"2015","unstructured":"Khamis, A., Hussein, A., Elmogy, A.: Multi-robot task allocation: a review of the state-of-the-art. In: Koub\u00e2a, A., Mart\u00ednez-de Dios, J.R. (eds.) Cooperative Robots and Sensor Networks 2015. SCI, vol. 604, pp. 31\u201351. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18299-5_2"},{"issue":"12","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1177\/0278364913496484","volume":"32","author":"GA Korsah","year":"2013","unstructured":"Korsah, G.A., Stentz, A., Dias, M.B.: A comprehensive taxonomy for multi-robot task allocation. Int. J. Robot. Res. 32(12), 1495\u20131512 (2013)","journal-title":"Int. J. Robot. Res."},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"152","DOI":"10.15807\/jorsj.34.152","volume":"34","author":"M Kubo","year":"1991","unstructured":"Kubo, M., Kasugai, H.: The precedence constrained traveling salesman problem. J. Oper. Res. Soc. Jpn. 34(2), 152\u2013172 (1991)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"6_CR23","first-page":"153","volume":"5","author":"T Kuschel","year":"2008","unstructured":"Kuschel, T.: Two-commodity network flow formulations for vehicle routing problems with simultaneous pickup & delivery and a many-to-many structure. Inform. Kommunikationssysteme Supply Chain Manag. Logist. Transp. 5, 153\u2013169 (2008)","journal-title":"Inform. Kommunikationssysteme Supply Chain Manag. Logist. Transp."},{"issue":"4:762","key":"6_CR24","first-page":"1","volume":"17","author":"I Landa-Torres","year":"2017","unstructured":"Landa-Torres, I., Manjarres, D., Bilbao, S., Del Ser, J.: Underwater robot task planning using multi-objective meta-heuristics. Sensors 17(4:762), 1\u201315 (2017)","journal-title":"Sensors"},{"issue":"7","key":"6_CR25","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1002\/net.3230230706","volume":"23","author":"A Langevin","year":"1993","unstructured":"Langevin, A., Desrochers, M., Desrosiers, J., G\u00e9linas, S., Soumis, F.: A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows. Networks 23(7), 631\u2013640 (1993)","journal-title":"Networks"},{"issue":"11","key":"6_CR26","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1109\/TCYB.2014.2371918","volume":"45","author":"J Li","year":"2015","unstructured":"Li, J., Zhou, M., Sun, Q., Dai, X., Yu, X.: Colored traveling salesman problem. IEEE Trans. Cybern. 45(11), 2390\u20132401 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Ma, F., Li, H.: An algorithm in solving the TSP based on the improved genetic algorithm. In: 2009 First International Conference on Information Science and Engineering (ICISE 2009), pp. 106\u2013108, December 2009","DOI":"10.1109\/ICISE.2009.231"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Maoudj, A., Bouzouia, B., Hentout, A., Toumi, R.: Multi-agent approach for task allocation and scheduling in cooperative heterogeneous multi-robot team: Simulation results. In: 13th International Conference on Industrial Informatics (INDIN), pp. 179\u2013184, July 2015","DOI":"10.1109\/INDIN.2015.7281731"},{"issue":"7","key":"6_CR29","first-page":"126","volume":"2","author":"AKM Masum","year":"2011","unstructured":"Masum, A.K.M., Shahjalal, M., Faruque, F., Sarker, I.H.: Solving the vehicle routing problem using genetic algorithm. Int. J. Adv. Comput. Sci. Appl. 2(7), 126\u2013131 (2011)","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"issue":"4","key":"6_CR30","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1109\/TITS.2017.2706720","volume":"19","author":"X Meng","year":"2018","unstructured":"Meng, X., Li, J., Dai, X., Dou, J.: Variable neighborhood search for a colored traveling salesman problem. IEEE Trans. Intell. Transp. Syst. 19(4), 1018\u20131026 (2018)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TSMC.2016.2591267","volume":"48","author":"X Meng","year":"2018","unstructured":"Meng, X., Li, J., Zhou, M., Dai, X., Dou, J.: Population-based incremental learning algorithm for a serial colored traveling salesman problem. IEEE Trans. Syst. Man Cybern.: Syst. 48(2), 277\u2013288 (2018)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Miloradovi\u0107., B., \u00c7\u00fcr\u00fckl\u00fc., B., Ekstr\u00f6m., M., Papadopoulos., A.V.: Extended colored traveling salesperson for modeling multi-agent mission planning problems. In: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, INSTICC, pp. 237\u2013244. SciTePress (2019)","DOI":"10.5220\/0007309002370244"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Miloradovi\u0107, B., \u00c7\u00fcr\u00fckl\u00fc, B., Ekstr\u00f6m, M.: A genetic planner for mission planning of cooperative agents in an underwater environment. In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20138, December 2016","DOI":"10.1109\/SSCI.2016.7850163"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-319-61833-3_51","volume-title":"Advances in Swarm Intelligence","author":"B Miloradovi\u0107","year":"2017","unstructured":"Miloradovi\u0107, B., \u00c7\u00fcr\u00fckl\u00fc, B., Ekstr\u00f6m, M.: A genetic mission planner for solving temporal multi-agent problems with concurrent tasks. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds.) ICSI 2017. LNCS, vol. 10386, pp. 481\u2013493. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-61833-3_51"},{"issue":"2","key":"6_CR35","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0166-218X(81)90038-X","volume":"3","author":"C Monma","year":"1981","unstructured":"Monma, C.: Sequencing with general precedence constraints. Discrete Appl. Math. 3(2), 137\u2013150 (1981)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"6_CR36","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon, C., Kim, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140(3), 606\u2013617 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Nian, L., Jinhua, Z.: Hybrid genetic algorithm for TSP. In: Seventh International Conference on Computational Intelligence and Security, pp. 71\u201375, December 2011","DOI":"10.1109\/CIS.2011.24"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.robot.2016.10.008","volume":"90","author":"E Nunes","year":"2017","unstructured":"Nunes, E., Manner, M., Mitiche, H., Gini, M.: A taxonomy for task allocation problems with temporal and ordering constraints. Robot. Autonom. Syst. 90, 55\u201370 (2017)","journal-title":"Robot. Autonom. Syst."},{"issue":"2","key":"6_CR39","first-page":"359","volume":"18","author":"K Pulji\u0107","year":"2013","unstructured":"Pulji\u0107, K., Manger, R.: Comparison of eight evolutionary crossover operators for the vehicle routing problem. Math. Commun. 18(2), 359\u2013375 (2013)","journal-title":"Math. Commun."},{"issue":"17","key":"6_CR40","doi-asserted-by":"publisher","first-page":"4883","DOI":"10.1007\/s00500-016-2376-7","volume":"21","author":"C Ramirez-Atencia","year":"2017","unstructured":"Ramirez-Atencia, C., Bello-Orgaz, G., R-Moreno, M.D., Camacho, D.: Solving complex multi-UAV mission planning problems using multi-objective genetic algorithms. Soft Comput. 21(17), 4883\u20134900 (2017)","journal-title":"Soft Comput."},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.swevo.2018.06.005","volume":"44","author":"C Ramirez-Atencia","year":"2019","unstructured":"Ramirez-Atencia, C., Del Ser, J., Camacho, D.: Weighted strategies to guide a multi-objective evolutionary algorithm for multi-UAV mission planning. Swarm Evol. Comput. 44, 480\u2013495 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"6_CR42","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s13748-017-0123-7","volume":"6","author":"C Ramirez-Atencia","year":"2017","unstructured":"Ramirez-Atencia, C., R-Moreno, M.D., Camacho, D.: Handling swarm of UAVs based on evolutionary multi-objective optimization. Prog. Artif. Intell. 6(3), 263\u2013274 (2017)","journal-title":"Prog. Artif. Intell."},{"key":"6_CR43","doi-asserted-by":"crossref","unstructured":"Ramirez-Atencia, C., Rodr\u00edguez-Fern\u00e1ndez, V., Gonzalez-Pardo, A., Camacho, D.: New artificial intelligence approaches for future UAV ground control stations. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2775\u20132782 (2017)","DOI":"10.1109\/CEC.2017.7969645"},{"key":"6_CR44","volume-title":"Handbook of Unmanned Aerial Vehicles","author":"KP Valavanis","year":"2014","unstructured":"Valavanis, K.P., Vachtsevanos, G.J.: Handbook of Unmanned Aerial Vehicles. Springer, Heidelberg (2014)"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Yu, Y., Chen, Y., Li, T.: A new design of genetic algorithm for solving TSP. In: Fourth International Joint Conference on Computational Sciences and Optimization, pp. 309\u2013313, April 2011","DOI":"10.1109\/CSO.2011.46"},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. Inform. J. Comput. 25, 346\u2013363 (2013)","journal-title":"Inform. J. Comput."},{"issue":"4","key":"6_CR47","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.12733\/jics20102973","volume":"11","author":"W Zhong","year":"2014","unstructured":"Zhong, W.: Multiple traveling salesman problem with precedence constraints based on modified dynamic tabu artificial bee colony algorithm. J. Inform. Comput. Sci. 11(4), 1225\u20131232 (2014)","journal-title":"J. Inform. Comput. Sci."},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, X., Wang, W., Wang, T., Li, X., Li, Z.: A research framework on mission planning of the UAV swarm. In: 12th System of Systems Engineering Conference, pp. 1\u20136, June 2017","DOI":"10.1109\/SYSOSE.2017.7994984"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37584-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T04:25:28Z","timestamp":1576211128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37584-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,11]]},"ISBN":["9783030375836","9783030375843"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37584-3_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019,12,11]]},"assertion":[{"value":"11 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2019","order":10,"name":"conference_id","label":"Conference ID","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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"20","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":"24","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":"25% - 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":"Extended and revised versions of 9 contributions were published in the Springer CCIS series","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)"}}]}}