{"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":1748733003484,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"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_25","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T14:41:36Z","timestamp":1450881696000},"page":"268-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Ejection Chain Methods for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Weichen","family":"Liu","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[]},{"given":"Yuezhong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Raymond","family":"Chiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"25_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)"},{"issue":"1","key":"25_CR2","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."},{"volume-title":"Handbook of Evolutionary Computation","year":"1997","key":"25_CR3","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Oxford University Press, New York (1997)"},{"key":"25_CR4","unstructured":"Boddy, M.S., Dean, T.L.: Solving time-dependent planning problems. Technical report CS-89-03, Brown University, RI, USA (1989)"},{"key":"25_CR5","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":"25_CR6","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano, Milano, Italy (1992)"},{"issue":"4","key":"25_CR7","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."},{"issue":"2","key":"25_CR8","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":"25_CR9","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. IEEE, Los Alamitos, CA, USA, Symposium and Toyoda Auditorium, Nagoya, Aichi, Japan (1996)","DOI":"10.1109\/ICEC.1996.542672"},{"key":"25_CR10","unstructured":"Glover, F.: Ejection chains with combinatorial leverage for the traveling salesman problems. University of Colorado-Boulder, Technical report (1992)"},{"key":"25_CR11","first-page":"449","volume":"1992","author":"F Glover","year":"1992","unstructured":"Glover, F.: New ejection chain and alternating path methods for traveling salesman problems. Comput. Sci. Oper. Res. 1992, 449\u2013509 (1992)","journal-title":"Comput. Sci. Oper. Res."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65(1), 223\u2013253 (1996)","journal-title":"Discrete Appl. Math."},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45724-0_10","volume-title":"Ant Algorithms","author":"M Guntsch","year":"2002","unstructured":"Guntsch, M., Middendorf, M.: Applying population based ACO to dynamic optimization problems. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 111\u2013122. Springer, Heidelberg (2002)"},{"volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","key":"25_CR14","unstructured":"Gutin, G.Z., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Norwell (2002)"},{"key":"25_CR15","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking: experimental setup. Technical report, Universit\u00e9 Paris Sud, INRIA Futurs, TAO, Orsay, France (2012)"},{"key":"25_CR16","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Technical report, Roskilde University, Denmark (1998)"},{"issue":"2\u20133","key":"25_CR17","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":"25_CR18","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)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluating Las Vegas Algorithms - pitfalls and remedies. In: Proceedings of the 14 $$^\\text{ th }$$ Conference on Uncertainty in Artificial Intelligence (UAI 1998), pp. 238\u2013245. Morgan Kaufmann, San Francisco (1998)","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"25_CR20","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., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 216\u2013227. Springer, Heidelberg (2014)"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga, 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":"25_CR22","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"ELG Lawler","year":"1985","unstructured":"Lawler, E.L.G., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"issue":"2","key":"25_CR23","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":"25_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin (1996)"},{"issue":"1","key":"25_CR25","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E Pesch","year":"1997","unstructured":"Pesch, E., Glover, F.: TSP ejection chains. Discrete Appl. Math. 76(1), 165\u2013181 (1997)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"25_CR26","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C Rego","year":"1998","unstructured":"Rego, C.: Relaxed tours and path ejections for the traveling salesman problem. Eur. J. Oper. Res. 106(2), 522\u2013538 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"25_CR27","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427\u2013441 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"DAD 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: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306\u2013320. Springer, Heidelberg (2005)"},{"key":"25_CR29","volume-title":"Global Optimization Algorithms - Theory and Application","author":"T Weise","year":"2009","unstructured":"Weise, T.: Global Optimization Algorithms - Theory and Application. it-weise.de (self-published), Germany (2009)"},{"issue":"3","key":"25_CR30","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."},{"key":"25_CR31","unstructured":"Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Proceedings of the 3 $$^\\text{ rd }$$ International Conference on Genetic Algorithms, pp. 133\u2013140. Morgan Kaufmann, San Francisco (1989)"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Wu, Y., Weise, T., Chiong, R.: Local search for the traveling salesman problem: a comparative study. In: Proceedings of 14 $$^\\text{ th }$$ IEEE Conference on Cognitive Informatics and Cognitive Computing, pp. 213\u2013220 (2015)","DOI":"10.1109\/ICCI-CC.2015.7259388"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T22:39:29Z","timestamp":1748731169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49014-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662490136","9783662490143"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49014-3_25","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"}}]}}