{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:44:49Z","timestamp":1743104689340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030013127"},{"type":"electronic","value":"9783030013134"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01313-4_41","type":"book-chapter","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T11:36:05Z","timestamp":1538393765000},"page":"378-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Probe Machine Based Consecutive Route Filtering Approach to Symmetric Travelling Salesman Problem"],"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":[[2018,10,2]]},"reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"41_CR2","volume-title":"Computers and Intractability: A Guide to the Theoryof NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theoryof NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"41_CR3","first-page":"1","volume-title":"Traveling Salesman Problem, Theory and Applications","author":"R Matai","year":"2010","unstructured":"Matai, R., Singh, S.P., Mittal, M.L.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications, pp. 1\u201324. InTech, Croatia (2010)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"MacGregor, J.N., Chu, Y.: Human performance on the traveling salesman and related problems: a review. J. Probl. Solving 3(2), article 2 (2011)","DOI":"10.7771\/1932-6246.1090"},{"key":"41_CR5","first-page":"167","volume":"41","author":"G Finke","year":"1984","unstructured":"Finke, G., Claus, A., Gunn, E.: A two-commodity network flow approach to the traveling salesman problem. Congr. Numer. 41, 167\u2013178 (1984)","journal-title":"Congr. Numer."},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"B Fleischmann","year":"1985","unstructured":"Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21(3), 307\u2013317 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16(3), 538\u2013558 (1968)","journal-title":"Oper. Res."},{"issue":"3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Philip, M.L.I.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"41_CR10","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"10","key":"41_CR11","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the travelling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I., Roucairol, C.C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433\u2013458. Kluwer Academic Publishers, Boston (1999)"},{"issue":"3","key":"41_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"41_CR15","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."},{"issue":"4598","key":"41_CR16","first-page":"671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.: Optimization by simulated annealing. Sci. New Ser. 220(4598), 671\u2013680 (1983)","journal-title":"Sci. New Ser."},{"issue":"2","key":"41_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994)","journal-title":"Stat. Comput."},{"key":"41_CR18","doi-asserted-by":"publisher","unstructured":"Guo, D., Chen, H., Wang, B.: An improved genetic algorithm with decision function for solving travelling salesman problem. In: Proceeding of 12th ISKE. IEEE Conferences, Nanjing, China, pp. 1\u20137 (2017). https:\/\/doi.org\/10.1109\/ISKE.2017.8258774","DOI":"10.1109\/ISKE.2017.8258774"},{"key":"41_CR19","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F., Bourgine, P. (eds.) Proceedings of European Conference on Artificial Life, Paris, France, pp. 134\u2013142 (1991)"},{"issue":"2","key":"41_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1049\/cje.2017.01.019","volume":"26","author":"L Shufen","year":"2017","unstructured":"Shufen, L., Huang, L., Lu, H.: Pheromone model selection in ant colony optimization for the travelling salesman problem. Chin. J. Electron. 26(2), 223\u2013229 (2017)","journal-title":"Chin. J. Electron."},{"issue":"6","key":"41_CR21","first-page":"985","volume":"9","author":"N Xiong","year":"2017","unstructured":"Xiong, N., Wu, W., Wu, C.: An improved routing optimization algorithm based on travelling salesman problem for social networks. Auton. Sustain. Comput. Prep. Internet Things Environ. 9(6), 985 (2017)","journal-title":"Auton. Sustain. Comput. Prep. Internet Things Environ."},{"key":"41_CR22","doi-asserted-by":"publisher","unstructured":"Ratanavilisagul, C.: Modified ant colony optimization with pheromone mutation for travelling salesman problem. In: Proceeding of 14th ECTI-CON. IEEE Conferences, Phuket, Thailand, pp. 411\u2013414 (2017). https:\/\/doi.org\/10.1109\/ECTICon.2017.8096261","DOI":"10.1109\/ECTICon.2017.8096261"},{"key":"41_CR23","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","volume":"139","author":"M-Y Cheng","year":"2014","unstructured":"Cheng, M.-Y., Prayogo, D.: Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput. Struct. 139, 98\u2013112 (2014)","journal-title":"Comput. Struct."},{"key":"41_CR24","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AE-S 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."},{"issue":"1","key":"41_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AE-S Ezugwu","year":"2017","unstructured":"Ezugwu, A.E.-S., Adewumi, A.O., Fr\u00eencu, M.E.: Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert. Syst. Appl. 77(1), 189\u2013210 (2017)","journal-title":"Expert. Syst. Appl."},{"key":"41_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2017.04.001","volume":"85","author":"SG Ozden","year":"2017","unstructured":"Ozden, S.G., Smith, A.E., Gue, K.R.: Solving large batches of travelling salesman problems with parallel and distributed computing. Comput. Oper. Res. 85, 87\u201396 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"41_CR27","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":"41_CR28","unstructured":"TSPLIB. http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html. Accessed 16 June 2018"},{"key":"41_CR29","unstructured":"https:\/\/people.sc.fsu.edu\/~jburkardt\/datasets\/tsp\/tsp.html. Accessed 24 June 2018"}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligence Science II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01313-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:58:08Z","timestamp":1709816288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01313-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030013127","9783030013134"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01313-4_41","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligence Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icis2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.intsci.ac.cn\/icis2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}