{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:51:34Z","timestamp":1761745894058,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031553257"},{"type":"electronic","value":"9783031553264"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55326-4_1","type":"book-chapter","created":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T08:46:10Z","timestamp":1710405970000},"page":"3-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bees, Bats and\u00a0Glowworms: Swarm Algorithms for\u00a0Optimizing Industrial Plants from\u00a0the\u00a0Bottom-Up"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0118-2817","authenticated-orcid":false,"given":"M.","family":"Umlauft","sequence":"first","affiliation":[]},{"given":"M.","family":"Gojkovic","sequence":"additional","affiliation":[]},{"given":"K.","family":"Harshina","sequence":"additional","affiliation":[]},{"given":"K.","family":"Majbour","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0714-6569","authenticated-orcid":false,"given":"M.","family":"Schranz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"issue":"12","key":"1_CR1","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1016\/j.eswa.2013.02.029","volume":"40","author":"A Alvarado-Iniesta","year":"2013","unstructured":"Alvarado-Iniesta, A., Garcia-Alcaraz, J.L., Rodriguez-Borbon, M.I., Maldonado, A.: Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm. Expert Syst. Appl. 40(12), 4785\u20134790 (2013)","journal-title":"Expert Syst. Appl."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-662-43631-8","volume-title":"Natural Computing Series","author":"A Brabazon","year":"2015","unstructured":"Brabazon, A., O\u2019Neill, M., McGarraghy, S.: Natural computing algorithms. In: Rozenberg, G., B\u00e4ck, T., Kari, L., Stepney, S. (eds.) Natural Computing Series, pp. 201\u2013205. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43631-8"},{"doi-asserted-by":"crossref","unstructured":"Chen, X., Zhang, B., Gao, D.: An improved bat algorithm for job shop scheduling problem. In: 2019 IEEE International Conference on Mechatronics and Automation (ICMA), pp. 439\u2013443. IEEE (2019)","key":"1_CR3","DOI":"10.1109\/ICMA.2019.8816578"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10845-015-1121-x","volume":"29","author":"TK Dao","year":"2018","unstructured":"Dao, T.K., Pan, T.S., Pan, J.S., et al.: Parallel bat algorithm for optimizing makespan in job shop scheduling problems. J. Intell. Manuf. 29(2), 451\u2013462 (2018)","journal-title":"J. Intell. Manuf."},{"doi-asserted-by":"crossref","unstructured":"Elmenreich, W., Schnabl, A., Schranz, M.: An artificial hormone-based algorithm for production scheduling from the bottom-up. In: Proceedings of the 13th International Conference on Agents and Artificial Intelligence. SciTePress (2021)","key":"1_CR5","DOI":"10.5220\/0010243902960303"},{"doi-asserted-by":"publisher","unstructured":"Fang, Y., Tang, M.: Scheduling optimization of watt-hour meters\u2019 automatic production line based on improved GSO method. In: 11th IEEE International Conference on Control & Automation (ICCA), pp. 1045\u20131049 (2014). https:\/\/doi.org\/10.1109\/ICCA.2014.6871064","key":"1_CR6","DOI":"10.1109\/ICCA.2014.6871064"},{"issue":"21","key":"1_CR7","doi-asserted-by":"publisher","first-page":"7652","DOI":"10.1016\/j.eswa.2015.06.004","volume":"42","author":"KZ Gao","year":"2015","unstructured":"Gao, K.Z., Suganthan, P.N., Chua, T.J., Chong, C.S., Cai, T.X., Pan, Q.K.: A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst. Appl. 42(21), 7652\u20137663 (2015)","journal-title":"Expert Syst. Appl."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2016.06.014","volume":"109","author":"KZ Gao","year":"2016","unstructured":"Gao, K.Z., Suganthan, P.N., Pan, Q.K., Tasgetiren, M.F., Sadollah, A.: Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl.-Based Syst. 109, 1\u201316 (2016)","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao, K., Cao, Z., Zhang, L., Chen, Z., Han, Y., Pan, Q.: A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA J. Autom. Sinica 6(4), 904\u2013916 (2019)","journal-title":"IEEE\/CAA J. Autom. Sinica"},{"unstructured":"Gupta, M., Sharma, G.: An efficient modified artificial bee colony algorithm for job scheduling problem. Int. J. Soft Comput. Eng. (IJSCE) 1(6) (2012)","key":"1_CR10"},{"issue":"9\u201312","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s00170-011-3680-0","volume":"60","author":"YY Han","year":"2012","unstructured":"Han, Y.Y., Pan, Q.K., Li, J.Q., Sang, H.Y.: An improved artificial bee colony algorithm for the blocking flowshop scheduling problem. Int. J. Adv. Manuf. Technol. 60(9\u201312), 1149\u20131159 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1_CR12","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-67669-2_14","volume-title":"Nature-Inspired Algorithms and Applied Optimization","author":"T Jayabarathi","year":"2018","unstructured":"Jayabarathi, T., Raghunathan, T., Gandomi, A.H.: The bat algorithm, variants and some practical engineering applications: a review. In: Yang, X.-S. (ed.) Nature-Inspired Algorithms and Applied Optimization. SCI, vol. 744, pp. 313\u2013330. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-67669-2_14"},{"doi-asserted-by":"publisher","unstructured":"Jing, L., Song, H., Lv, X.: Research and application on job shop planning based on improved glowworm swarm optimization algorithm. In: 2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, vol.\u00a02, pp. 139\u2013143 (2013). https:\/\/doi.org\/10.1109\/IHMSC.2013.180","key":"1_CR13","DOI":"10.1109\/IHMSC.2013.180"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"6915","DOI":"10.4249\/scholarpedia.6915","volume":"5","author":"D Karaboga","year":"2010","unstructured":"Karaboga, D.: Artificial bee colony algorithm. Scholarpedia 5(3), 6915 (2010)","journal-title":"Scholarpedia"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"1_CR17","first-page":"434","volume":"47","author":"AT Khader","year":"2013","unstructured":"Khader, A.T., Al-betar, M.A., Mohammed, A.A.: Artificial bee colony algorithm, its variants and applications: a survey. J. Theor. Appl. Inf. Technol. 47(2), 434\u2013459 (2013)","journal-title":"J. Theor. Appl. Inf. Technol."},{"unstructured":"Khatmi, E., et al.: Swarm intelligence layer to control autonomous agents (SWILT). In: STAF (Co-Located Events), pp. 91\u201396 (2019)","key":"1_CR18"},{"doi-asserted-by":"publisher","unstructured":"Krishnanand, K., Ghose, D.: Detection of multiple source locations using a glowworm metaphor with applications to collective robotics. In: Proceedings 2005 IEEE Swarm Intelligence Symposium, SIS 2005, pp. 84\u201391 (2005). https:\/\/doi.org\/10.1109\/SIS.2005.1501606","key":"1_CR19","DOI":"10.1109\/SIS.2005.1501606"},{"issue":"3","key":"1_CR20","first-page":"3","volume":"17","author":"A Kumar","year":"2017","unstructured":"Kumar, A., Kumar, D., Jarial, S.: A review on artificial bee colony algorithms and their applications to data clustering. Cybern. Inf. Technol. 17(3), 3\u201328 (2017)","journal-title":"Cybern. Inf. Technol."},{"doi-asserted-by":"crossref","unstructured":"Kumar, S., Sharma, V.K., Kumari, R.: A novel hybrid crossover based artificial bee colony algorithm for optimization problem. arXiv preprint arXiv:1407.5574 (2014)","key":"1_CR21","DOI":"10.5120\/14136-2266"},{"key":"1_CR22","first-page":"445","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. Handb. Oper. Res. Manage. Sci. 4, 445\u2013522 (1993)","journal-title":"Handb. Oper. Res. Manage. Sci."},{"doi-asserted-by":"publisher","unstructured":"Lei, J., Xiaoying, Z., Labao, Z., Kun, W.: Coordinated scheduling of electric vehicles and wind power generation considering vehicle to grid mode. In: 2017 IEEE Transportation Electrification Conference and Expo, Asia-Pacific (ITEC Asia-Pacific), pp.\u00a01\u20135 (2017). https:\/\/doi.org\/10.1109\/ITEC-AP.2017.8081021","key":"1_CR23","DOI":"10.1109\/ITEC-AP.2017.8081021"},{"key":"1_CR24","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, 487\u2013502 (2015)","journal-title":"Inf. Sci."},{"issue":"3","key":"1_CR25","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":"3","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","volume":"13","author":"YF Liu","year":"2013","unstructured":"Liu, Y.F., Liu, S.Y.: A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl. Soft Comput. 13(3), 1459\u20131463 (2013)","journal-title":"Appl. Soft Comput."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"14513","DOI":"10.1109\/ACCESS.2019.2892826","volume":"7","author":"Y Lu","year":"2019","unstructured":"Lu, Y., Jiang, T.: Bi-population based discrete bat algorithm for the low-carbon job shop scheduling problem. IEEE Access 7, 14513\u201314522 (2019)","journal-title":"IEEE Access"},{"doi-asserted-by":"crossref","unstructured":"Luo, Q., Zhou, Y., Xie, J., Ma, M., Li, L.: Discrete bat algorithm for optimal problem of permutation flow shop scheduling. Sci. World J. 2014 (2014)","key":"1_CR28","DOI":"10.1155\/2014\/630280"},{"issue":"1","key":"1_CR29","first-page":"15","volume":"5","author":"M Marichelvam","year":"2013","unstructured":"Marichelvam, M., Prabaharan, T., Yang, X.S., Geetha, M.: Solving hybrid flow shop scheduling problems using bat algorithm. Int. J. Logist. Econ. Glob. 5(1), 15\u201329 (2013)","journal-title":"Int. J. Logist. Econ. Glob."},{"unstructured":"Musikapun, P., Pongcharoen, P.: Solving multi-stage multi-machine multi-product scheduling problem using bat algorithm. In: 2nd International Conference on Management and Artificial Intelligence, vol.\u00a035, pp. 98\u2013102. IACSIT Press, Singapore (2012)","key":"1_CR30"},{"issue":"12","key":"1_CR31","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12), 2455\u20132468 (2011)","journal-title":"Inf. Sci."},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"QK Pan","year":"2014","unstructured":"Pan, Q.K., Wang, L., Li, J.Q., Duan, J.H.: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45, 42\u201356 (2014)","journal-title":"Omega"},{"doi-asserted-by":"crossref","unstructured":"Schranz, M., Umlauft, M., Elmenreich, W.: Bottom-up job shop scheduling with swarm intelligence in large production plants. In: Proceedings of the 11th International Conference on Simulation and Modeling, Methodologies, Technologies and Applications (SIMULTECH), pp. 327\u2013334 (2021)","key":"1_CR33","DOI":"10.5220\/0010551603270334"},{"issue":"3","key":"1_CR34","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.swevo.2011.06.003","volume":"1","author":"J Senthilnath","year":"2011","unstructured":"Senthilnath, J., Omkar, S., Mani, V.: Clustering using firefly algorithm: performance study. Swarm Evol. Comput. 1(3), 164\u2013171 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.06.003","journal-title":"Swarm Evol. Comput."},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.asoc.2018.04.001","volume":"68","author":"N Sharma","year":"2018","unstructured":"Sharma, N., Sharma, H., Sharma, A.: Beer froth artificial bee colony algorithm for job-shop scheduling problem. Appl. Soft Comput. 68, 507\u2013524 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"20","key":"1_CR36","doi-asserted-by":"publisher","first-page":"6085","DOI":"10.1007\/s00500-016-2166-2","volume":"21","author":"TK Sharma","year":"2017","unstructured":"Sharma, T.K., Pant, M.: Shuffled artificial bee colony algorithm. Soft. Comput. 21(20), 6085\u20136104 (2017)","journal-title":"Soft. Comput."},{"issue":"1","key":"1_CR37","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/opre.50.1.197.17783","volume":"50","author":"S Stidham Jr","year":"2002","unstructured":"Stidham, S., Jr.: Analysis, design, and control of queueing systems. Oper. Res. 50(1), 197\u2013216 (2002)","journal-title":"Oper. Res."},{"issue":"10\u201311","key":"1_CR38","doi-asserted-by":"publisher","first-page":"6758","DOI":"10.1016\/j.apm.2013.02.011","volume":"37","author":"MF Tasgetiren","year":"2013","unstructured":"Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Oner, A.: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl. Math. Model. 37(10\u201311), 6758\u20136779 (2013)","journal-title":"Appl. Math. Model."},{"doi-asserted-by":"crossref","unstructured":"Umlauft, M., Gojkovic, M., Harshina, K., Schranz, M.: Bottom-up bio-inspired algorithms for optimizing industrial plants. In: Proc. 15th International Conference on Agents and Artificial Intelligence (ICAART). INSTICC, SciTePress (2023)","key":"1_CR39","DOI":"10.5220\/0011693400003393"},{"doi-asserted-by":"publisher","unstructured":"Umlauft, M., Schranz, M., Elmenreich, W.: SwarmFabSim: a simulation framework for bottom-up optimization in flexible job-shop scheduling using netlogo. In: Proceedings of the 12th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH), vol.\u00a01, pp. 271\u2013279. INSTICC, SciTePress (2022). https:\/\/doi.org\/10.5220\/0011274700003274","key":"1_CR40","DOI":"10.5220\/0011274700003274"},{"issue":"9\u201312","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s00170-011-3665-z","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang, L., Zhou, G., Xu, Y., Liu, M.: An enhanced pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int. J. Adv. Manuf. Technol. 60(9\u201312), 1111\u20131123 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"unstructured":"Wilensky, U.: Netlogo. Webpage (1999). Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL. http:\/\/ccl.northwestern.edu\/netlogo\/","key":"1_CR42"},{"doi-asserted-by":"crossref","unstructured":"Xu, H., Bao, Z., Zhang, T.: Solving dual flexible job-shop scheduling problem using a bat algorithm. Adv. Prod. Eng. Manage. 12(1) (2017)","key":"1_CR43","DOI":"10.14743\/apem2017.1.235"},{"key":"1_CR44","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol. 284, pp. 65\u201374. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"},{"issue":"3","key":"1_CR45","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJBIC.2013.055093","volume":"5","author":"XS Yang","year":"2013","unstructured":"Yang, X.S., He, X.: Bat algorithm: literature review and applications. Int. J. Bio-Inspir. Comput. 5(3), 141\u2013149 (2013)","journal-title":"Int. J. Bio-Inspir. Comput."},{"doi-asserted-by":"crossref","unstructured":"Yao, B.Z., Yang, C.Y., Hu, J.J., Yin, G.D., Yu, B.: An improved artificial bee colony algorithm for job shop problem. In: Applied Mechanics and Materials, vol.\u00a026, pp. 657\u2013660. Trans Tech Publ (2010)","key":"1_CR46","DOI":"10.4028\/www.scientific.net\/AMM.26-28.657"},{"doi-asserted-by":"crossref","unstructured":"Yurtkuran, A., Emel, E.: A modified artificial bee colony algorithm for-center problems. Sci. World J. 2014 (2014)","key":"1_CR47","DOI":"10.1155\/2014\/871242"},{"issue":"1","key":"1_CR48","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ijpe.2012.03.035","volume":"141","author":"R Zhang","year":"2013","unstructured":"Zhang, R., Song, S., Wu, C.: A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int. J. Prod. Econ. 141(1), 167\u2013178 (2013)","journal-title":"Int. J. Prod. Econ."},{"doi-asserted-by":"publisher","unstructured":"Zhao-Ming, L., Fan, Z., Wen-Zhe, L., Peng-Cheng, W.: An improved glowworm swarm optimization for vehicle scheduling in the iron and steel plant logistics. In: 2018 24th International Conference on Automation and Computing (ICAC), pp.\u00a01\u20136 (2018). https:\/\/doi.org\/10.23919\/IConAC.2018.8749065","key":"1_CR49","DOI":"10.23919\/IConAC.2018.8749065"},{"issue":"7","key":"1_CR50","first-page":"999","volume":"13","author":"H Zhu","year":"2017","unstructured":"Zhu, H., He, B., Li, H.: Modified bat algorithm for the multi-objective flexible job shop scheduling problem. Int. J. Perform. Eng. 13(7), 999 (2017)","journal-title":"Int. J. Perform. Eng."},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.procir.2019.04.119","volume":"83","author":"Z Zhuang","year":"2019","unstructured":"Zhuang, Z., Huang, Z., Lu, Z., Guo, L., Cao, Q., Qin, W.: An improved artificial bee colony algorithm for solving open shop scheduling problem with two sequence-dependent setup times. Procedia CIRP 83, 563\u2013568 (2019)","journal-title":"Procedia CIRP"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55326-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T08:46:52Z","timestamp":1710406012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55326-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031553257","9783031553264"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55326-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaart2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaart.scitevents.org\/?y=2023","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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"306","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":"23","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":"111","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":"8% - 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)"}}]}}