{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:21:33Z","timestamp":1743135693259,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267629"},{"type":"electronic","value":"9783030267636"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-26763-6_67","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"697-706","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-verse Optimization Algorithm for Solving Two-Dimensional TSP"],"prefix":"10.1007","author":[{"given":"Guo","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"67_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"issue":"6","key":"67_CR2","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1137\/S0097539793251244","volume":"28","author":"B Chandra","year":"1999","unstructured":"Chandra, B., Karloff, H., Tovey, C.: New results on the old k-opt algorithm for the traveling salesman problem. SIAM J. Comput. 28(6), 1998\u20132029 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"67_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73\u201381 (1997)","journal-title":"Biosystems"},{"issue":"3","key":"67_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.cor.2009.03.004","volume":"37","author":"Y Marinakis","year":"2010","unstructured":"Marinakis, Y., Marinaki, M.: A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput. Oper. Res. 37(3), 432\u2013442 (2010)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Niasar, N.S., Shanbezade, J., Perdam, M.M., et al.: Discrete fuzzy particle swarm optimization for solving traveling salesman problem. In: Information and Financial Engineering 2009, pp. 162\u2013165. IEEE Press, New York (2009)","key":"67_CR5","DOI":"10.1109\/ICIFE.2009.37"},{"issue":"3","key":"67_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y.: Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3), 337\u2013370 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"67_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., et al.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"67_CR8","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)"},{"key":"67_CR9","first-page":"11","volume":"2","author":"K Menger","year":"1932","unstructured":"Menger, K.: Das botenproblem. Ergebnisse Eines Mathema tischen Kolloquiums 2, 11\u201312 (1932)","journal-title":"Ergebnisse Eines Mathema tischen Kolloquiums"},{"key":"67_CR10","first-page":"393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large scale traveling salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"67_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00521-015-1870-7","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput. Appl. 27, 495\u2013513 (2016)","journal-title":"Neural Comput. Appl."},{"unstructured":"http:\/\/blog.csdn.net\/zjujqq\/article\/details\/8829879","key":"67_CR12"},{"key":"67_CR13","doi-asserted-by":"publisher","first-page":"086007","DOI":"10.1103\/PhysRevD.65.086007","volume":"65","author":"J Khour","year":"2002","unstructured":"Khour, J., Ovrut, B.A., Seiberg, N., Steinhardt, P.J., Turok, N.: From big crunch to big bang. Phys. Rev. D 65, 086007 (2002)","journal-title":"Phys. Rev. D"},{"key":"67_CR14","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1088\/0034-4885\/41\/8\/004","volume":"41","author":"PC Davies","year":"1978","unstructured":"Davies, P.C.: Thermodynamics of black holes. Rep. Prog. Phys. 41, 1313 (1978)","journal-title":"Rep. Prog. Phys."},{"key":"67_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1119\/1.15620","volume":"56","author":"MS Morris","year":"1998","unstructured":"Morris, M.S., Thorne, K.S.: Wormholes in spacing and their use for interstellar travel: a tool for teaching general relativity. Am. J. Phys. 56, 395\u2013412 (1998)","journal-title":"Am. J. Phys."},{"key":"67_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1088\/1751-8113\/40\/25\/S25","volume":"40","author":"AH Guth","year":"2007","unstructured":"Guth, A.H.: Eternal inflation and its implications. J. Phys. A Math. Theor. 40, 43\u201357 (2007)","journal-title":"J. Phys. A Math. Theor."},{"key":"67_CR17","volume-title":"Fundamentals of Physics","author":"D Holliday","year":"1993","unstructured":"Holliday, D., Resnick, R., Walker, J.: Fundamentals of Physics. Wiley, Hoboken (1993)"},{"key":"67_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807800","volume-title":"Gravity from the Ground Up","author":"B Schutz","year":"2003","unstructured":"Schutz, B.: Gravity from the Ground Up. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26763-6_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T13:19:26Z","timestamp":1617283166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanchang","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":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","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":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ICIC Website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"609","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":"217","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":"36% - 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.43","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}