{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:05:22Z","timestamp":1742922322169,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366246"},{"type":"electronic","value":"9783031366253"}],"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-36625-3_42","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"526-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Group Simulated Annealing Algorithm for\u00a0ICSI-OC 2022"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7388-9379","authenticated-orcid":false,"given":"Mingyin","family":"Zou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0322-9826","authenticated-orcid":false,"given":"Peichen","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1301-7840","authenticated-orcid":false,"given":"Xiaomin","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.asoc.2018.02.003","volume":"65","author":"BO Alijla","year":"2018","unstructured":"Alijla, B.O., Lim, C.P., Wong, L.P., Khader, A.T., Al-Betar, M.A.: An ensemble of intelligent water drop algorithm for feature selection optimization problem. Appl. Soft Comput. 65, 531\u2013541 (2018)","journal-title":"Appl. Soft Comput."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.renene.2021.03.101","volume":"172","author":"G \u00c7etin","year":"2021","unstructured":"\u00c7etin, G., Ke\u00e7eba\u015f, A.: Optimization of thermodynamic performance with simulated annealing algorithm: A geothermal power plant. Renewable Energy 172, 968\u2013982 (2021)","journal-title":"Renewable Energy"},{"key":"42_CR3","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-91086-4_1","volume-title":"Handbook of Metaheuristics","author":"D Delahaye","year":"2019","unstructured":"Delahaye, D., Chaimatanan, S., Mongeau, M.: Simulated annealing: from basics to applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 1\u201335. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_1"},{"issue":"4","key":"42_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"42_CR5","doi-asserted-by":"publisher","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Handbook of Combinatorial Optimization, pp. 2093\u20132229. Springer (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_33","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"42_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TNSE.2018.2827997","volume":"7","author":"L Liu","year":"2018","unstructured":"Liu, L., Yin, B., Zhang, S., Cao, X., Cheng, Y.: Deep learning meets wireless network optimization: Identify critical links. IEEE Trans. Netw. Sci. Eng. 7(1), 167\u2013180 (2018)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"42_CR9","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-93025-1_4","volume-title":"Evolutionary Algorithms and Neural Networks","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili, S.: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks. SCI, vol. 780, pp. 43\u201355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-93025-1_4"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.asoc.2016.12.027","volume":"53","author":"FY Vincent","year":"2017","unstructured":"Vincent, F.Y., Redi, A.P., Hidayat, Y.A., Wibowo, O.J.: A simulated annealing heuristic for the hybrid vehicle routing problem. Appl. Soft Comput. 53, 119\u2013132 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TR.2009.2035796","volume":"59","author":"WC Yeh","year":"2010","unstructured":"Yeh, W.C., Lin, Y.C., Chung, Y.Y., Chih, M.: A particle swarm optimization approach based on monte carlo simulation for solving the complex network reliability problem. IEEE Trans. Reliab. 59(1), 212\u2013221 (2010)","journal-title":"IEEE Trans. Reliab."},{"key":"42_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2020.107237","volume":"85","author":"L Zhang","year":"2020","unstructured":"Zhang, L., Ma, H., Qian, W., Li, H.: Protein structure optimization using improved simulated annealing algorithm on a three-dimensional ab off-lattice model. Comput. Biol. Chem. 85, 107237 (2020)","journal-title":"Comput. Biol. Chem."}],"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-031-36625-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T20:18:19Z","timestamp":1729714699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36625-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366246","9783031366253"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36625-3_42","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":"8 July 2023","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":"Shenzhen","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","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":"swarm2023","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","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":"81","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":"48% - 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.6","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)"}}]}}