{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:59:15Z","timestamp":1742997555028,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"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_1","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Solving Symmetric and Asymmetric Traveling Salesman Problems Through Probe Machine with Local Search"],"prefix":"10.1007","author":[{"given":"Md. Azizur","family":"Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinwen","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"1_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"1","key":"1_CR2","first-page":"77","volume":"18","author":"SK Lau","year":"2001","unstructured":"Lau, S.K., Shue, L.Y.: Solving travelling salesman problems with an intelligent search approach. Asia Pac. J. Oper. Res. 18(1), 77\u201388 (2001)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba, E., Yang, X.S., Diaz, F., Lopez-Garcia, P., Carballedo, R.: An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng. Appl. Artif. Intell. 48, 59\u201371 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu, A.E.S., Adewumi, A.O.: Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst. Appl. 87, 70\u201378 (2017)","journal-title":"Expert Syst. Appl."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore, S., Chatterjee, A., Dewanji, A.: Improving variable neighborhood search to solve the traveling salesman problem. Appl. Soft Comput. 68, 83\u201391 (2018)","journal-title":"Appl. Soft Comput."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba, E., Del Ser, J., Sadollah, A., Bilbao, M.N., Camacho, D.: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl. Soft Comput. 71, 277\u2013290 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"7","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1109\/TNNLS.2016.2555845","volume":"27","author":"J Xu","year":"2016","unstructured":"Xu, J.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27(7), 1405\u20131416 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1_CR8","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-030-01313-4_41","volume-title":"Intelligence Science II","author":"MdA Rahman","year":"2018","unstructured":"Rahman, Md.A., Ma, J.: Probe machine based consecutive route filtering approach to symmetric travelling salesman problem. In: Shi, Z., Pennartz, C., Huang, T. (eds.) ICIS 2018. IAICT, vol. 539, pp. 378\u2013387. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01313-4_41"},{"key":"1_CR9","unstructured":"TSPLIB. http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html. Accessed 07 Mar 2019"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T13:03:24Z","timestamp":1617282204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_1","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)"}}]}}