{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:20Z","timestamp":1742914220322,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811555763"},{"type":"electronic","value":"9789811555770"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-981-15-5577-0_37","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:02:46Z","timestamp":1590411766000},"page":"473-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nested Simulated Annealing Algorithm to Solve Large-Scale TSP Problem"],"prefix":"10.1007","author":[{"given":"Lei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangshun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijia","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiongdan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongya","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"37_CR1","unstructured":"Gao, J.: Hierarchical Solving Method for Large Scale TSP Problems. Master\u2019s thesis, Inner Mongolia University For Nationlities (2014)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.neucom.2013.07.052","volume":"134","author":"X Hu","year":"2014","unstructured":"Hu, X., Zhang, J., Qi, P., Zhang, B.: Modeling response properties of v2 neurons using a hierarchical k-means model. Neurocomputing 134, 198\u2013205 (2014). \nhttps:\/\/doi.org\/10.1016\/j.neucom.2013.07.052","journal-title":"Neurocomputing"},{"key":"37_CR3","unstructured":"Huang, Q.: Based on Fusion on Feature-Level Image Technique Study Intelligent. Master\u2019s thesis, China University of Petroleum (2012)"},{"issue":"3","key":"37_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1515\/jaiscr-2017-0015","volume":"7","author":"NA Khan","year":"2017","unstructured":"Khan, N.A., Shaikh, A.: A smart amalgamation of spectral neural algorithm for nonlinear lane-emden equations with simulated annealing. J. Artif. Intell. Soft Comput. Res. 7(3), 215\u2013224 (2017). \nhttps:\/\/doi.org\/10.1515\/jaiscr-2017-0015","journal-title":"J. Artif. Intell. Soft Comput. Res."},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1016\/j.asoc.2011.11.008","volume":"12","author":"YK Lam","year":"2012","unstructured":"Lam, Y.K., Tsang, P.W.: eXploratory k-means: A new simple and efficient algorithm for gene clustering. Appl. Soft Comput. 12(3), 1149\u20131157 (2012). \nhttps:\/\/doi.org\/10.1016\/j.asoc.2011.11.008","journal-title":"Appl. Soft Comput."},{"key":"37_CR6","unstructured":"Li, J.: Color separation research and implementation based on printing and dyeing CAD system. Master\u2019s thesis, Zhejiang University (2004)"},{"key":"37_CR7","unstructured":"Liu, X.: The Application and Research of an Improved Genetic Algoruthm on the TSP Problem. Master\u2019s thesis, Harbin University of Science and Technology (2011)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.4028\/www.scientific.net\/AMM.687-691.1316","volume":"687-691","author":"Jun Pan","year":"2014","unstructured":"Pan, J., Cheng, Z.G., Lv, J.Y.: Study on the TSP problem based on SA algorithm. In: Applied Mechanics and Materials, vol. 687\u2013691, pp. 1316\u20131319 (2014). \nhttps:\/\/doi.org\/10.4028\/www.scientific.net\/amm.687-691.1316","journal-title":"Applied Mechanics and Materials"},{"key":"37_CR9","unstructured":"Shi, Z.: The single machine parallel-batching scheduling problem with family-jobs. Master\u2019s thesis, Zhengzhou University (2008)"},{"key":"37_CR10","unstructured":"Wang, P.: Research on Parallel Ant Colony Algorithm and Application. Master\u2019s thesis, Southwest Jiaotong University (2008)"},{"key":"37_CR11","unstructured":"Xiaoping, Z., Shengbowen, L.: Fetal electrocardiogram extraction based on independent component analysis and particle swarm optimizer. Inf. Electron. Eng. 6 (2009)"},{"key":"37_CR12","first-page":"66","volume":"5","author":"Y Xie","year":"1995","unstructured":"Xie, Y.: A summary on the simulated annealing algorithm. Control Autom. 5, 66\u201368 (1995)","journal-title":"Control Autom."},{"issue":"6","key":"37_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1515\/cait-2016-0075","volume":"16","author":"M Yang","year":"2016","unstructured":"Yang, M., Gao, X., Li, L.: Improved bidirectional CABOSFV based on multi-adjustment clustering and simulated annealing. Cybern. Inf. Technol. 16(6), 27\u201342 (2016). \nhttps:\/\/doi.org\/10.1515\/cait-2016-0075","journal-title":"Cybern. Inf. Technol."},{"issue":"6","key":"37_CR14","first-page":"96","volume":"31","author":"YT Lu","year":"2015","unstructured":"Lu, Y.T., Lin, Y.Y., Peng, Q.Z., Wang, Y.Z.: A review of improvement and research on parameters of simulated annealing algorithm. Coll. Math. 31(6), 96\u2013103 (2015)","journal-title":"Coll. Math."},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"1849","DOI":"10.3969\/j.issn.0372-2112.2018.08.008","volume":"46","author":"ZC Zhang","year":"2018","unstructured":"Zhang, Z.C., Han, W., Mao, B.: Adaptive discrete cuckoo algorithm based on simulated annealing for solving tsp. Tien Tzu Hsueh Pao\/Acta Electronica Sinica 46, 1849\u20131857 (2018). \nhttps:\/\/doi.org\/10.3969\/j.issn.0372-2112.2018.08.008","journal-title":"Tien Tzu Hsueh Pao\/Acta Electronica Sinica"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.4028\/www.scientific.net\/AMM.380-384.1109","volume":"380-384","author":"Jian Zhuang Zhi","year":"2013","unstructured":"Zhi, J.Z., Yu, G.B., Deng, S.J., Chen, Z.L., Bai, W.Y.: Modeling and simulation about tsp based on simulated annealing algorithm. In: Applied Mechanics and Materials, vol. 380, pp. 1109\u20131112 (2013). Trans Tech Publ","journal-title":"Applied Mechanics and Materials"}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-5577-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:08:39Z","timestamp":1590412119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-5577-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811555763","9789811555770"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-5577-0_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISICA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligence Computation and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isica2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.cn\/isica2019\/","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":"112","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":"45","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":"20","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":"40% - 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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}