{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T01:50:56Z","timestamp":1789869056185,"version":"4.0.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_93","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T13:26:31Z","timestamp":1472563591000},"page":"994-1003","source":"Crossref","is-referenced-by-count":16,"title":["Tunnelling Crossover Networks for the Asymmetric TSP"],"prefix":"10.1007","author":[{"given":"Nadarajen","family":"Veerapen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"93_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Concorde TSP solver (2003). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html"},{"key":"93_CR2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15, 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"key":"93_CR3","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Sutton, A.M.: Efficient identification of improving moves in a ball for pseudo-boolean problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2014), pp. 437\u2013444. ACM (2014)","DOI":"10.1145\/2576768.2598304"},{"key":"93_CR4","doi-asserted-by":"crossref","first-page":"238701","DOI":"10.1103\/PhysRevLett.88.238701","volume":"88","author":"JPK Doye","year":"2002","unstructured":"Doye, J.P.K.: The network topology of a potential energy landscape: a static scale-free network. Phys. Rev. Lett. 88, 238701 (2002)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"93_CR5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"93_CR6","doi-asserted-by":"crossref","unstructured":"Iclanzan, D., Daolio, F., Tomassini, M.: Data-driven local optima network characterization of QAPLIB instances. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2014), pp. 453\u2013460. ACM (2014)","DOI":"10.1145\/2576768.2598275"},{"issue":"4","key":"93_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R Jonker","year":"1983","unstructured":"Jonker, R., Volgenant, T.: Transforming asymmetric into symmetric traveling salesman problems. Oper. Res. Lett. 2(4), 161\u2013163 (1983)","journal-title":"Oper. Res. Lett."},{"key":"93_CR8","doi-asserted-by":"crossref","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, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"93_CR9","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Chicano, F., Tin\u00f3s, R., Whitley, D.: Tunnelling crossover networks. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), pp. 449\u2013456. ACM (2015)","DOI":"10.1145\/2739480.2754657"},{"key":"93_CR10","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Tomassini, M., Verel, S., Darabos, C.: A study of NK landscapes\u2019 basins and local optima networks. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 555\u2013562. ACM (2008)","DOI":"10.1145\/1389095.1389204"},{"key":"93_CR11","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Veerapen, N.: Additional dimensions to the study of funnels in combinatorial landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). ACM (2016, to appear)","DOI":"10.1145\/2908812.2908820"},{"key":"93_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-31471-6_1","volume-title":"Artificial Evolution","author":"G Ochoa","year":"2016","unstructured":"Ochoa, G., Veerapen, N., Whitley, D., Burke, E.K.: The multi-funnel structure of TSP fitness landscapes: a visual exploration. In: Bonnevay, S., Legrand, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2015. LNCS, vol. 9554, pp. 1\u201313. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-31471-6_1"},{"key":"93_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-30698-8_5","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2016","unstructured":"Ochoa, G., Veerapen, N.: Deconstructing the big valley search space hypothesis. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 58\u201373. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30698-8_5"},{"issue":"4","key":"93_CR14","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"93_CR15","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2014), pp. 501\u2013508. ACM (2014)","DOI":"10.1145\/2576768.2598245"},{"key":"93_CR16","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, L.D., Chicano, F.: Partition crossover for pseudo-boolean optimization. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, 17\u201320 January 2015, pp. 137\u2013149 (2015)","DOI":"10.1145\/2725494.2725497"},{"issue":"6","key":"93_CR17","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TEVC.2010.2046175","volume":"15","author":"S Verel","year":"2011","unstructured":"Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. Evol. Comput. 15(6), 783\u2013797 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"93_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-642-35533-2_5","volume-title":"Artificial Evolution","author":"S V\u00e9rel","year":"2012","unstructured":"V\u00e9rel, S., Daolio, F., Ochoa, G., Tomassini, M.: Local optima networks with escape edges. In: Hao, J.-K., Legrand, P., Collet, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol. 7401, pp. 49\u201360. Springer, Heidelberg (2012)"},{"key":"93_CR19","doi-asserted-by":"crossref","unstructured":"Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2009), pp. 915\u2013922. ACM (2009)","DOI":"10.1145\/1569901.1570026"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_93","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:38:58Z","timestamp":1498340338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}