{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T09:25:21Z","timestamp":1771925121740,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s11590-022-01937-y","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T13:09:27Z","timestamp":1666012167000},"page":"89-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal TSP tour length estimation using Sammon maps"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2146-8318","authenticated-orcid":false,"given":"Shuhan","family":"Kou","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Golden","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Poikonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"1937_CR1","doi-asserted-by":"publisher","unstructured":"Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. In: Mathematical Proceedings of the Cambridge Philosophical Society. vol. 55(4), pp. 299\u2013327. Cambridge University Press, Cambridge (1959). https:\/\/doi.org\/10.1017\/S0305004100034095","DOI":"10.1017\/S0305004100034095"},{"key":"1937_CR2","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","volume":"65","author":"G Boeing","year":"2017","unstructured":"Boeing, GOSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urban Syst. 65, 126\u2013139 (2017)","journal-title":"Comput. Environ. Urban Syst."},{"issue":"6","key":"1937_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/0305-0548(92)90002-M","volume":"19","author":"TW Chien","year":"1992","unstructured":"Chien, T.W.: Operational estimators for the length of a traveling salesman tour. Comput. Oper. Res. 19(6), 469\u2013478 (1992)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1937_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0191-2615(84)90027-4","volume":"18","author":"CF Daganzo","year":"1984","unstructured":"Daganzo, C.F.: The length of tours in zones of different shapes. Transp. Res. Part B Methodol. 18(2), 135\u2013145 (1984)","journal-title":"Transp. Res. Part B Methodol."},{"key":"1937_CR5","unstructured":"Hagberg, A., Swart, P., Schult Chult, D.: Exploring Network structure, Dynamics, and Function Using NetworkX. Technical report, Los Alamos National Lab.(LANL), Los Alamos, NM, USA (2008)"},{"issue":"1","key":"1937_CR6","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 Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1937_CR7","first-page":"1573","volume":"1","author":"KL Hoffman","year":"2013","unstructured":"Hoffman, K.L., Padberg, M., Rinaldi, G., et al.: Traveling salesman problem. Encycl. Oper. Res. Manag. Sci. 1, 1573\u20131578 (2013)","journal-title":"Encycl. Oper. Res. Manag. Sci."},{"issue":"9","key":"1937_CR8","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1057\/palgrave.jors.2601420","volume":"53","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Palekaz, U.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9), 972\u2013976 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"1937_CR9","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1002\/net.21874","volume":"73","author":"D Merch\u00e1n","year":"2019","unstructured":"Merch\u00e1n, D., Winkenbach, M.: An empirical validation and data-driven extension of continuum approximation approaches for urban route distances. Networks 73(4), 418\u2013433 (2019)","journal-title":"Networks"},{"key":"1937_CR10","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1937_CR11","unstructured":"Pekalska, E.M. et al.: A New method of generalizing Sammon Mapping with application to algorithm speed-up. In: Heijen NL. ASCI, pp. 221\u2013228 (1999)"},{"issue":"5","key":"1937_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/T-C.1969.222678","volume":"100","author":"JW Sammon","year":"1969","unstructured":"Sammon, J.W.: A nonlinear mapping for data structure analysis. IEEE Trans. Comput. 100(5), 401\u2013409 (1969)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"1937_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al.: SciPy 10: fundamental algorithms for scientific computing in python. Nat. Methods 17(3), 261\u2013272 (2020)","journal-title":"Nat. Methods"},{"key":"1937_CR14","doi-asserted-by":"crossref","unstructured":"Wang, C.J., Fang, H., Wang, H.: ESammon: a computationaly enhanced Sammon mapping based on data density. In: 2016 International Conference on Computing, Networking and Communications (ICNC), pp. 1\u20135. IEEE (2016)","DOI":"10.1109\/ICCNC.2016.7440696"},{"key":"1937_CR15","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/4124950","author":"H Yang","year":"2022","unstructured":"Yang, H., et al.: Expected length of the shortest path of the traveling salesman problem in 3D space. J. Adv. Transp. (2022). https:\/\/doi.org\/10.1155\/2022\/4124950","journal-title":"J. Adv. Transp."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01937-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01937-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01937-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T10:58:20Z","timestamp":1672829900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01937-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1937"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01937-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"1 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}