{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:43:49Z","timestamp":1743137029731,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030787424"},{"type":"electronic","value":"9783030787431"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78743-1_27","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"301-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Initializing Ant Colony Algorithms by Learning from the Difficult Problem\u2019s Global Features"],"prefix":"10.1007","author":[{"given":"Xiangyang","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Limin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1nez, M., St\u00fctzle, T., Dorigo, M.: Ant Colony Optimization: a Component-Wise Overview (2015)","DOI":"10.1007\/978-3-319-07153-4_21-1"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Kaplar, A., Vidakovic, M., Luburic, N., Ivanovic, M.: Improving a distributed agent-based ant colony optimization for solving traveling salesman problem. In: 2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE (2017)","DOI":"10.23919\/MIPRO.2017.7973596"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"38921","DOI":"10.1109\/ACCESS.2018.2853129","volume":"6","author":"E Liao","year":"2018","unstructured":"Liao, E., Liu, C.: A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access 6, 38921\u201338933 (2018)","journal-title":"IEEE Access"},{"key":"27_CR4","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)","journal-title":"IEEE Access"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Wang, Y., Xue, X., Cheng, S., El-Abd, M.: Cooperative co-evolutionary metaheuristics for solving large-scale TSP art project. In: 2019 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE (2019)","DOI":"10.1109\/SSCI44817.2019.9002754"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ACCESS.2018.2876146","volume":"7","author":"H Zhang","year":"2019","unstructured":"Zhang, H., You, X.: Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism. IEEE Access 7, 1 (2019)","journal-title":"IEEE Access"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/3-540-45712-7_86","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN VII","author":"C Blum","year":"2002","unstructured":"Blum, C., Sampels, M.: When model bias is stronger than selection pressure. In: Guerv\u00f3s, J.J.M., Adamidis, P., Beyer, H.-G., Schwefel, H.-P., Fern\u00e1ndez-Villaca\u00f1as, J.-L. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 893\u2013902. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45712-7_86"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1162\/106365602760234090","volume":"10","author":"D Merkle","year":"2002","unstructured":"Merkle, D., Middendorf, M.: Modeling the dynamics of ant colony optimization. Evol. Comput. 10(3), 235\u2013262 (2002)","journal-title":"Evol. Comput."},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Blum, C., Dorigo, M.: Deception in ant colony optimization. In: Ant Colony Optimization and Swarm Intelligence, pp. 118\u2013129. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28646-2_11","DOI":"10.1007\/978-3-540-28646-2_11"},{"issue":"2","key":"27_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TEVC.2004.841688","volume":"9","author":"C Blum","year":"2005","unstructured":"Blum, C., Dorigo, M.: Search bias in ant colony optimization: on the role of competition-balanced systems. IEEE Trans. Evol. Comput. 9(2), 159\u2013174 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Montgomery, J., Randall, M., Hendtlass, T.: Structural advantages for ant colony optimisation inherent in permutation scheduling problems. In: Innovations in Applied Artificial Intelligence, pp. 218\u2013228. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11504894_31","DOI":"10.1007\/11504894_31"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1162\/1064546054407149","volume":"11","author":"J Montgomery","year":"2005","unstructured":"Montgomery, J., Randall, M., Hendtlass, T.: Automated selection of appropriate pheromone representations in ant colony optimization. Artif. Life 11(3), 269\u2013291 (2005)","journal-title":"Artif. Life"},{"key":"27_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Iterated Local Search","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated Local Search. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ejor.2012.01.011","volume":"219","author":"D Karapetyan","year":"2012","unstructured":"Karapetyan, D., Gutin, G.: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2), 234\u2013251 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR15","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"5","key":"27_CR16","first-page":"803","volume":"36","author":"D Haibin","year":"2006","unstructured":"Haibin, D., Daobo, W., Xiufen, Y.: MAX-MIN meeting ant colony algorithm based on cloud model theory and niche ideology. J. Jilin Univ. 36(5), 803\u2013808 (2006)","journal-title":"J. Jilin Univ."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Dubuisson, M.P., Jain, A.K.: A modified Hausdorff distance for object matching. In: Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 1-Conference A: Computer Vision & Amp; Image Processing 1994, vol. 1. IEEE (1994)","DOI":"10.1109\/ICPR.1994.576361"},{"issue":"10","key":"27_CR18","doi-asserted-by":"publisher","first-page":"5591","DOI":"10.1073\/pnas.1031596100","volume":"100","author":"DL Donoho","year":"2003","unstructured":"Donoho, D.L., Grimes, C.: Hessian eigenmaps: locally linear embedding techniques for high-dimensional data. Proc. Natl. Acad. Sci. 100(10), 5591\u20135596 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"27_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"J-L Deneubourg","year":"1990","unstructured":"Deneubourg, J.-L., et al.: The self-organizing exploratory pattern of the argentine ant. J. Insect Behav. 3(2), 159\u2013168 (1990)","journal-title":"J. Insect Behav."},{"issue":"3","key":"27_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/09296179508590051","volume":"2","author":"WA Gale","year":"1995","unstructured":"Gale, W.A., Sampson, G.: Good-turing frequency estimation without tears*. J. Quant. Linguist. 2(3), 217\u2013237 (1995)","journal-title":"J. Quant. Linguist."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","DOI":"10.1109\/4235.585892"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78743-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T13:44:28Z","timestamp":1725371068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78743-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030787424","9783030787431"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78743-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","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":"177","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":"104","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":"0","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":"59% - 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,5","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-5","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)"}}]}}