{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:10:03Z","timestamp":1748733003207,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662490136"},{"type":"electronic","value":"9783662490143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","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":[[2015]]},"DOI":"10.1007\/978-3-662-49014-3_47","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T14:41:36Z","timestamp":1450881696000},"page":"523-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Dan","family":"Xu","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[]},{"given":"Yuezhong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"L\u00e4ssig","sequence":"additional","affiliation":[]},{"given":"Raymond","family":"Chiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"key":"47_CR2","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 Interscience, Chichester (1985)"},{"volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","key":"47_CR3","unstructured":"Gutin, G.Z., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Norwell (2002)"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-319-11752-2","volume-title":"Simulated Evolution and Learning","author":"H Jiang","year":"2014","unstructured":"Jiang, H., Sun, W., Ren, Z., Lai, X., Piao, Y.: Evolving hard and easy traveling salesman problem instances: a multi-objective approach. In: Dick, G., Browne, W.N., Whigham, P., Zhang, M., Bui, L.T., Ishibuchi, H., Jin, Y., Li, X., Shi, Y., Singh, P., Tan, K.C., Tang, K. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 216\u2013227. Springer, Heidelberg (2014)"},{"key":"47_CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization \u2014 Eureka, You Shrink!","author":"Gerhard J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for np-hard problems: a survey. In: Revised Papers of the 5th International Works on Combinatorial Optimization, pp. 185\u2013207. Springer, Aussois (2001)"},{"key":"47_CR6","volume-title":"Global Optimization Algorithms - Theory and Application","author":"T Weise","year":"2009","unstructured":"Weise, T.: Global Optimization Algorithms - Theory and Application. Self-Published, Germany (it-weise.de) (2009)"},{"volume-title":"Handbook of Evolutionary Computation","year":"1997","key":"47_CR7","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Oxford University Press, New York (1997)"},{"key":"47_CR8","volume-title":"Evolutionary Computation: A Unified Approach","author":"KA Jong De","year":"2006","unstructured":"De Jong, K.A.: Evolutionary Computation: A Unified Approach. MIT Press, Cambridge (2006)"},{"key":"47_CR9","volume-title":"Optimization, Learning and Natural Algorithms, Ph.D. thesis","author":"M Dorigo","year":"1992","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms, Ph.D. thesis. Dipartimento di Elettronica, Politecnico di Milano, Milano (1992)"},{"issue":"4","key":"47_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., St\u00fctzle, T.: Ant colony optimization - artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Dorigo, M.: Solving symmetric and asymmetric tsps by ant colonies. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 622\u2013627. Nagoya, 20\u201322 May 1996","DOI":"10.1109\/ICEC.1996.542672"},{"issue":"2","key":"47_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."},{"issue":"3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCI.2014.2326101","volume":"9","author":"T Weise","year":"2014","unstructured":"Weise, T., Chiong, R., Tang, K., L\u00e4ssig, J., Tsutsui, S., Chen, W., Michalewicz, Z., Yao, X.: Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput. Intell. Mag. 9(3), 40\u201352 (2014)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"1","key":"47_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Guntsch, M., Middendorf, M.: Applying population based aco to dynamic optimization problems. In: Proceedings of the 3rd International Works on Ant Colony Optimization, pp. 111\u2013122. Brussels (2002)","DOI":"10.1007\/3-540-45724-0_10"},{"issue":"1","key":"47_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"FW Glover","year":"1993","unstructured":"Glover, F.W., Taillard, \u00c9.D., de Werra, D.: A user\u2019s guide to tabu search. Ann. Oper. Res. 41(1), 3\u201328 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"47_CR17","first-page":"29","volume":"32","author":"A Misevi\u010dius","year":"2015","unstructured":"Misevi\u010dius, A.: Using iterated tabu search for the traveling salesman problem. Inf. Technol. Control 32(3), 29\u201340 (2015)","journal-title":"Inf. Technol. Control"},{"key":"47_CR18","unstructured":"Osaba, E., Diaz, F.: Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem. In: 2012 Federated Conference on Computer Science and Information Systems, pp. 131\u2013136 (2012)"},{"key":"47_CR19","unstructured":"Reinelt, G.: Tsplib 95. Technical report. Universit\u00e4t Heidelberg, Institut f\u00fcr Mathematik, Heidelberg (1995)"},{"issue":"2","key":"47_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.4236\/ajor.2012.22019","volume":"2","author":"S Basu","year":"2012","unstructured":"Basu, S.: Tabu search implementation on traveling salesman problem and its variations: a literature survey. Am. J. Oper. Res. 2(2), 163\u2013173 (2012)","journal-title":"Am. J. Oper. Res."},{"key":"47_CR21","unstructured":"Boddy, M.S., Dean, T.L.: Solving time-dependent planning problems. Technical report CS-89-03. Brown University, Providence (1989)"},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Weise, T., L\u00e4ssig, J., Chiong, R., Athauda, R.: Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP. In: Proceedings of the IEEE Symposium Series on Computational Intelligence. Orlando, 9\u201312 Dec 2014","DOI":"10.1109\/CIPLS.2014.7007174"},{"key":"47_CR23","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking: experimental setup. Technical report, Universit\u00e9 Paris Sud, INRIA, \u00c9quipe TAO, Orsay (2012)"},{"key":"47_CR24","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"Dave A. D. Tompkins","year":"2005","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: 7th International Conference on Theory and Applications of Satisfiability Testing, pp. 306\u2013320. Springer, Berlin (2004)"},{"key":"47_CR25","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2005)"},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluating Las Vegas algorithms - pitfalls and remedies. In: Proceedings of the 14th Conference on Uncertainty in AI, pp. 238\u2013245. Morgan Kaufmann, Madison, 24\u201326 July 1998","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"47_CR27","first-page":"369","volume-title":"The Traveling Salesman Problem and its Variations","author":"DS Johnson","year":"2002","unstructured":"Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. The Traveling Salesman Problem and its Variations, pp. 369\u2013443. Springer, New York (2002)"},{"key":"47_CR28","first-page":"445","volume-title":"The Traveling Salesman Problem and its Variations","author":"DS Johnson","year":"2002","unstructured":"Johnson, D.S., Gutin, G.Z., McGeoch, L.A., Yeo, A., Zhang, W., Zverovitch, A.: Experimental analysis of heuristics for the ATSP. The Traveling Salesman Problem and its Variations, pp. 445\u2013487. Kluwer, Dordrecht (2002)"},{"key":"47_CR29","doi-asserted-by":"crossref","unstructured":"Wu, Y., Weise, T., Chiong, R.: Local search for the traveling salesman problem: a comparative study. In: Proceedings of 14th IEEE Conference on Cognitive Informatics and Cognitive Computing, pp. 213\u2013220, 6\u20138 July 2015","DOI":"10.1109\/ICCI-CC.2015.7259388"},{"issue":"2","key":"47_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. J. Artif. Intell. Res. 13(2), 129\u2013170 (1999)","journal-title":"J. Artif. Intell. Res."},{"key":"47_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms $$+$$ Data Structures $$=$$","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms $$+$$ Data Structures $$=$$ Evolution Programs. Springer, Berlin (1996)"},{"issue":"2","key":"47_CR32","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00202901","volume":"60","author":"DB Fogel","year":"1988","unstructured":"Fogel, D.B.: An evolutionary approach to the traveling salesman problem. Biol. Cybern. 60(2), 139\u2013144 (1988)","journal-title":"Biol. Cybern."},{"key":"47_CR33","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor (1975)"},{"issue":"5","key":"47_CR34","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"FW Glover","year":"1986","unstructured":"Glover, F.W.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"4598","key":"47_CR35","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Sci. Mag. 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"47_CR36","volume-title":"Intelligent Optimization Methods","author":"D Wang","year":"2007","unstructured":"Wang, D., Wang, J., Wang, H., Zhang, R., Guo, Z.: Intelligent Optimization Methods. Higher Education Press, China (2007)"},{"key":"47_CR37","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Technical report, Roskilde University, Denmark (1998)"},{"issue":"1","key":"47_CR38","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"DL Applegate","year":"2003","unstructured":"Applegate, D.L., Cook, W.J., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"2\u20133","key":"47_CR39","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"47_CR40","unstructured":"Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 133\u2013140 (1989)"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing -- Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49014-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T22:39:33Z","timestamp":1748731173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49014-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662490136","9783662490143"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49014-3_47","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}