{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:14Z","timestamp":1767340094274,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_14","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"187-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["How a\u00a0Different Ant Behavior Affects on\u00a0the\u00a0Performance of\u00a0the\u00a0Whole Colony"],"prefix":"10.1007","author":[{"given":"Carolina","family":"Crespi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6211-8675","authenticated-orcid":false,"given":"Rocco A.","family":"Scollo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6444-1564","authenticated-orcid":false,"given":"Georgia","family":"Fargetta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3421-3293","authenticated-orcid":false,"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Akka, K., Khaber, F.: Mobile robot path planning using an improved ant colony optimization. Int. J. Adv. Robot. Syst. 15(3) (2018). https:\/\/doi.org\/10.1177\/1729881418774673","DOI":"10.1177\/1729881418774673"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Brand, M., Masuda, M., Wehner, N., Yu, X.: Ant colony optimization algorithm for robot path planning. In: 2010 International Conference On Computer Design and Applications, vol. 3, pp. V3-436\u2013V3-440 (2010). https:\/\/doi.org\/10.1109\/ICCDA.2010.5541300","DOI":"10.1109\/ICCDA.2010.5541300"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Consoli, P., Coller\u00e0, A., Pavone, M.: Swarm intelligence heuristics for graph coloring problem. In: 2013 IEEE Congress on Evolutionary Computation, pp. 1909\u20131916 (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557792","DOI":"10.1109\/CEC.2013.6557792"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-11683-9_19","volume-title":"Artificial Evolution","author":"P Consoli","year":"2014","unstructured":"Consoli, P., Pavone, M.: O-BEE-COL: optimal BEEs for COLoring graphs. In: Legrand, P., Corsini, M.-M., Hao, J.-K., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2013. LNCS, vol. 8752, pp. 243\u2013255. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11683-9_19"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-030-63710-1_18","volume-title":"Bioinspired Optimization Methods and Their Applications","author":"C Crespi","year":"2020","unstructured":"Crespi, C., Fargetta, G., Pavone, M., Scollo, R.A., Scrimali, L.: A game theory approach for crowd evacuation modelling. In: Filipi\u010d, B., Minisci, E., Vasile, M. (eds.) BIOMA 2020. LNCS, vol. 12438, pp. 228\u2013239. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63710-1_18"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Crespi, C., Scollo, R.A., Pavone, M.: Effects of different dynamics in an ant colony optimization algorithm. In: 2020 7th International Conference on Soft Computing Machine Intelligence (ISCMI2020), pp. 8\u201311. IEEE (2020). https:\/\/doi.org\/10.1109\/ISCMI51676.2020.9311553","DOI":"10.1109\/ISCMI51676.2020.9311553"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"W Deng","year":"2019","unstructured":"Deng, W., Xu, J., Zhao, H.: An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7, 20281\u201320292 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2897580","journal-title":"IEEE Access"},{"key":"14_CR8","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-91086-4_10","volume-title":"Handbook of Metaheuristics","author":"M Dorigo","year":"2019","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant colony optimization: overview and recent advances. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 311\u2013351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_10"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cam.2015.04.030","volume":"293","author":"S Fidanova","year":"2016","unstructured":"Fidanova, S., Pop, P.: An improved hybrid ant-local search algorithm for the partition graph coloring problem. J. Comput. Appl. Math. 293, 55\u201361 (2016). https:\/\/doi.org\/10.1016\/j.cam.2015.04.030","journal-title":"J. Comput. Appl. Math."},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Jia, Y.H., Mei, Y., Zhang, M.: A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem. IEEE Trans. Cybern. 1\u201314 (2021). https:\/\/doi.org\/10.1109\/TCYB.2021.3069942","DOI":"10.1109\/TCYB.2021.3069942"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ejor.2018.09.038","volume":"274","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: An efficient ant colony optimization algorithm for the blocks relocation problem. Eur. J. Oper. Res. 274(1), 78\u201390 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.09.038","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"14_CR12","doi-asserted-by":"publisher","first-page":"e0141012","DOI":"10.1371\/journal.pone.0141012","volume":"10","author":"T O\u2019Shea-Wheller","year":"2015","unstructured":"O\u2019Shea-Wheller, T., Sendova-Franks, A., Franks, N.: Differentiated anti-predation responses in a superorganism. PLoS One 10(11), e0141012 (2015). https:\/\/doi.org\/10.1371\/journal.pone.0141012","journal-title":"PLoS One"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"69203","DOI":"10.1109\/ACCESS.2018.2879583","volume":"6","author":"H Peng","year":"2018","unstructured":"Peng, H., Ying, C., Tan, S., Hu, B., Sun, Z.: An improved feature selection algorithm based on ant colony optimization. IEEE Access 6, 69203\u201369209 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2879583","journal-title":"IEEE Access"},{"key":"14_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-62524-9_8","volume-title":"Soft Computing Applications","author":"C-M Pintea","year":"2018","unstructured":"Pintea, C.-M., Matei, O., Ramadan, R.A., Pavone, M., Niazi, M., Azar, A.T.: A fuzzy approach of sensitivity for multiple colonies on ant colony optimization. In: Balas, V.E., Jain, L.C., Balas, M.M. (eds.) SOFA 2016. AISC, vol. 634, pp. 87\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-62524-9_8"},{"key":"14_CR15","unstructured":"Wilensky, U.: NetLogo. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL (1999). http:\/\/ccl.northwestern.edu\/netlogo\/"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"129958","DOI":"10.1109\/ACCESS.2020.3009399","volume":"8","author":"D Zhang","year":"2020","unstructured":"Zhang, D., You, X., Liu, S., Pan, H.: Dynamic multi-role adaptive collaborative ant colony optimization for robot path planning. IEEE Access 8, 129958\u2013129974 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3009399","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:03:46Z","timestamp":1688198626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","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":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","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":"48","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":"17","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":"67% - 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":"3","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)"}}]}}