{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:13Z","timestamp":1759847893538},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319314709"},{"type":"electronic","value":"9783319314716"}],"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-31471-6_1","type":"book-chapter","created":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T02:35:28Z","timestamp":1458354928000},"page":"1-13","source":"Crossref","is-referenced-by-count":17,"title":["The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration"],"prefix":"10.1007","author":[{"given":"Gabriela","family":"Ochoa","sequence":"first","affiliation":[]},{"given":"Nadarajen","family":"Veerapen","sequence":"additional","affiliation":[]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,20]]},"reference":[{"key":"1_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Concorde TSP solver (2003). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html"},{"key":"1_CR2","doi-asserted-by":"publisher","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":"1_CR3","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":"1_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"key":"1_CR5","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. InterJournal Complex System, 1695 (2006)"},{"issue":"11","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1057\/jors.2010.116","volume":"62","author":"DR Hains","year":"2011","unstructured":"Hains, D.R., Whitley, L.D., Howe, A.E.: Revisiting the big valley search space structure in the TSP. J. Oper. Res. Soc. 62(2), 305\u2013312 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","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 LinKernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Iclanzan, D., Daolio, F., Tomassini, M.: Data-driven local optima network characterization of QAPLIB instances. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 453\u2013460. ACM, New York (2014)","DOI":"10.1145\/2576768.2598275"},{"key":"1_CR10","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, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"1_CR11","first-page":"299","volume":"5","author":"O Martin","year":"1991","unstructured":"Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Syst. 5, 299\u2013326 (1991)","journal-title":"Complex Syst."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"4667","DOI":"10.1103\/PhysRevE.59.4667","volume":"59","author":"A M\u00f6bius","year":"1999","unstructured":"M\u00f6bius, A., Freisleben, B., Merz, P., Schreiber, M.: Combinatorial optimization by iterative partial transcription. Phys. Rev. E 59(4), 4667\u20134674 (1999)","journal-title":"Phys. Rev. E"},{"key":"1_CR13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Chicano, F., Tinos, R., Whitley, D.: Tunnelling crossover networks. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 449\u2013456. ACM (2015)","DOI":"10.1145\/2739480.2754657"},{"key":"1_CR15","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), pp. 555\u2013562. ACM (2008)","DOI":"10.1145\/1389095.1389204"},{"key":"1_CR16","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-41888-4_9","volume-title":"Recent Advances in the Theory and Application of Fitness Landscapes","author":"G Ochoa","year":"2014","unstructured":"Ochoa, G., Verel, S., Daolio, F., Tomassini, M.: Local optima networks: a new model of combinatorial fitness landscapes. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes. ECC, vol. 6, pp. 233\u2013262. Springer, Heidelberg (2014)"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","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). http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/","journal-title":"ORSA J. Comput."},{"issue":"6","key":"1_CR18","doi-asserted-by":"publisher","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":"1_CR19","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1038\/29487","volume":"394","author":"DJ Wales","year":"1998","unstructured":"Wales, D.J., Miller, M.A., Walsh, T.R.: Archetypal energy landscapes. Nature 394, 758\u2013760 (1998)","journal-title":"Nature"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings Genetic and Evolutionary Computation Conference, GECCO 2009, pp. 915\u2013922. ACM, New York (2009)","DOI":"10.1145\/1569901.1570026"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","first-page":"566","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Whitley","year":"2010","unstructured":"Whitley, D., Hains, D., Howe, A.: A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 566\u2013575. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31471-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T11:30:36Z","timestamp":1600342236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31471-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319314709","9783319314716"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31471-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}