{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:01:50Z","timestamp":1722945710856},"reference-count":58,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["INFOR: Information Systems and Operational Research"],"published-print":{"date-parts":[[2017,4,3]]},"DOI":"10.1080\/03155986.2017.1279897","type":"journal-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T14:20:38Z","timestamp":1486477238000},"page":"134-158","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem"],"prefix":"10.1080","volume":"55","author":[{"given":"Sumanta","family":"Basu","sequence":"first","affiliation":[{"name":"OM Group, Indian Institute of Management, Calcutta, India"}]},{"given":"Megha","family":"Sharma","sequence":"additional","affiliation":[{"name":"OM Group, Indian Institute of Management, Calcutta, India"}]},{"given":"Partha Sarathi","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Cognizant Technologies, Calcutta, India"}]}],"member":"301","published-online":{"date-parts":[[2017,2,7]]},"reference":[{"key":"cit0001","first-page":"645","author":"Applegate D","year":"1998","journal-title":"Doc Math"},{"key":"cit0002","doi-asserted-by":"crossref","unstructured":"Applegate D, Bixby R, Chvatal V, Cook W. 2006. The traveling salesman problem: a computational study. Princeton: Princeton University Press.","DOI":"10.1515\/9781400841103"},{"key":"cit0003","doi-asserted-by":"publisher","DOI":"10.4236\/ajor.2012.22019"},{"key":"cit0004","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-012-0086-1"},{"key":"cit0005","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-012-0088-z"},{"key":"cit0006","unstructured":"Basu S, Sharma M. 2013. Preprocessing schemes for Tabu search on asymmetric traveling salesman problem. Kolkata: Indian Institute of Calcutta. (Working Paper Series 735\/October 2013: 1\u201340)."},{"key":"cit0007","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00031-2"},{"key":"cit0008","doi-asserted-by":"publisher","DOI":"10.1101\/gr.10.3.365"},{"key":"cit0011","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000045321.59202.52"},{"key":"cit0013","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00050-3"},{"key":"cit0014","doi-asserted-by":"crossref","unstructured":"Cirassela J, Johnson D, McGeoch L, Zhang W. 2001. The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: Buchsbaum A, Snoeyink J, editors. Algorithm engineering and experimentation. Third International Workshop, ALENEX 2001, Lecture Notes in Computer Science 2153. Heidelberg: Springer-Verlag; p 32\u201359.","DOI":"10.1007\/3-540-44808-X_3"},{"key":"cit0015","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601052"},{"key":"cit0016","volume-title":"In pursuit of the salesman: mathematics at the limits of computation","author":"Cook W","year":"2011"},{"key":"cit0017","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00091-5"},{"key":"cit0018","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00033-I"},{"key":"cit0019","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.43.11.1520"},{"key":"cit0020","first-page":"169","volume-title":"The traveling salesman problem and its variations 4","author":"Fischetti M","year":"2002"},{"key":"cit0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.023"},{"key":"cit0022","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.06.014"},{"key":"cit0023","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.04.003"},{"key":"cit0025","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"cit0026","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"cit0029","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600392"},{"key":"cit0030","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"cit0031","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00468-3"},{"key":"cit0032","unstructured":"Goldberg DE. 1989. Genetic algorithm in search, optimization and machine learning. Boston: Addison Wesley."},{"key":"cit0032a","doi-asserted-by":"crossref","unstructured":"Goossens J, Baruah S. 2001. Multiprocessor preprocessing algorithms for uniprocessor on-line scheduling. The 21st International Conference on Distributed Computing Systems.","DOI":"10.1109\/ICDSC.2001.918951"},{"key":"cit0034","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00064-1"},{"key":"cit0035","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00065-3"},{"key":"cit0036","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2005.11732712"},{"key":"cit0037","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_39"},{"key":"cit0040","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"cit0041","unstructured":"Hoffman AJ, Wolfe P. 1985. History. In: Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB, editors. The traveling salesman problem. Chichester: John Wiley; p 1\u201316."},{"key":"cit0042","unstructured":"Hoffman KL, Padberg M, Rinaldi G. 2016. Traveling salesman problem. In: Gass SI, Fu MC, editors. Encyclopedia of operations research and management science. New York (NY): Springer; p. 1573\u20131578."},{"key":"cit0043","doi-asserted-by":"crossref","unstructured":"Holland J. 1992. Adaptation in natural and artificial systems. Cambridge (USA): MIT Press.","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"cit0044","first-page":"445","volume-title":"The traveling salesman problem and its variations","volume":"10","author":"Johnson D","year":"2002"},{"key":"cit0045","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1086"},{"key":"cit0046","doi-asserted-by":"crossref","unstructured":"Karp R. 1972. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD, editors. Complexity of computer computations. USA: Springer; p. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"cit0047","doi-asserted-by":"publisher","DOI":"10.1137\/0208045"},{"key":"cit0048","unstructured":"Karp R, Steel JM. 1985. Probabilistic analysis of heuristics. In: Rinnooy Kan AHG, Lawler EL, Lenstra JK, Shmoys DB, editors. The traveling salesman problem: a guided tour of combinatorial optimization. Chichester: Wiley. P. 181\u2013205."},{"key":"cit0052","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.12.B718"},{"key":"cit0053","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90016-7"},{"key":"cit0054","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00013-0"},{"key":"cit0055","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.76"},{"key":"cit0056","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"cit0061","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.02.029"},{"key":"cit0062","unstructured":"Noon CE, Bean JC. 1991. An efficient transformation of the generalized traveling salesman problem. Technical report 91\u201326. Ann Arbor (USA): Department of Industrial and Operations Engineering, University of Michigan."},{"key":"cit0063a","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.09.010"},{"key":"cit0064","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00288-9"},{"key":"cit0066","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"cit0067","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-012-0010-0"},{"key":"cit0071","doi-asserted-by":"crossref","unstructured":"Stutzle T, Hoos H. 1998. Improvements on the Ant-System: introducing the MAX-MIN Ant System. In: Pearson DW, Steele NC, Albrecht R. editors. Artificial neural nets and genetic algorithms. Vienna: Springer; p. 245\u2013249.","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"cit0072","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00380-X"},{"key":"cit0073","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.4.333.24890"},{"key":"cit0074","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.10.062"},{"key":"cit0075","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00198-9"},{"key":"cit0076","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2008.01.003"},{"key":"cit0077","unstructured":"Yeo A. 1997. Large exponential neighbourhoods for the TSP. Odense, Denmark: Preprint, Department of Maths and CS, Odense University."}],"container-title":["INFOR: Information Systems and Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/03155986.2017.1279897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T00:57:26Z","timestamp":1601600246000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/03155986.2017.1279897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,7]]},"references-count":58,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,12,9]]},"published-print":{"date-parts":[[2017,4,3]]}},"alternative-id":["10.1080\/03155986.2017.1279897"],"URL":"https:\/\/doi.org\/10.1080\/03155986.2017.1279897","relation":{},"ISSN":["0315-5986","1916-0615"],"issn-type":[{"value":"0315-5986","type":"print"},{"value":"1916-0615","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,7]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tinf20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tinf20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}