{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:50:55Z","timestamp":1777416655284,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T00:00:00Z","timestamp":1404864000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10732-014-9252-3","type":"journal-article","created":{"date-parts":[[2014,7,8]],"date-time":"2014-07-08T06:28:08Z","timestamp":1404800888000},"page":"561-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mind the gap: a heuristic study of subway tours"],"prefix":"10.1007","volume":"20","author":[{"given":"M.","family":"Drozdowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Mizgajski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Mokwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Pawlak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,9]]},"reference":[{"key":"9252_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10732-010-9154-y","volume":"18","author":"S Abdullah","year":"2012","unstructured":"Abdullah, S., Turabieh, H., McCollum, B., McMullan, P.: A hybrid metaheuristic approach to the university course timetabling problem. J. Heuristics 18, 123 (2012)","journal-title":"J. Heuristics"},{"key":"9252_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E Arkin","year":"1994","unstructured":"Arkin, E., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55, 197\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9252_CR3","unstructured":"Black, P.E.: Chinese postman problem. In: Dictionary of Algorithms and Data Structures, US National Institute of Standards and Technology. http:\/\/www.nist.gov\/dads\/HTML\/chinesePostman.html (2012). Accessed 06 December 2012"},{"key":"9252_CR4","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.cam.2009.07.004","volume":"232","author":"J Berli\u0144ska","year":"2009","unstructured":"Berli\u0144ska, J., Drozdowski, M., Lawenda, M.: Experimental study of scheduling with memory constraints using hybrid methods. J. Comput. Appl. Math. 232, 638\u2013654 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"9252_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.8.2.125","volume":"8","author":"B Codenotti","year":"1996","unstructured":"Codenotti, B., Manzini, G., Margara, L., Resta, G.: Perturbation: an efficient technique for the solution of very large instances of the Euclidean TSP. INFORMS J. Comput. 8, 125\u2013133 (1996)","journal-title":"INFORMS J. Comput."},{"key":"9252_CR6","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problem. Oper. Res. 6, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"9252_CR7","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"J Current","year":"1989","unstructured":"Current, J., Schilling, D.: The covering salesman problem. Trans. Sci. 23, 208\u2013213 (1989)","journal-title":"Trans. Sci."},{"key":"9252_CR8","doi-asserted-by":"crossref","first-page":"2705","DOI":"10.1016\/j.cor.2012.02.001","volume":"39","author":"M Drozdowski","year":"2012","unstructured":"Drozdowski, M., Kowalski, D., Mizgajski, J., Mokwa, D., Pawlak, G.: Mind the gap: a study of tube tour. Comput. Oper. Res. 39, 2705\u20132714 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9252_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: the rural postman problem. Oper. Res. 43, 399\u2013414 (1995)","journal-title":"Oper. Res."},{"key":"9252_CR10","first-page":"128","volume":"8","author":"L Eulero","year":"1741","unstructured":"Eulero, L.: Solutio problematis ad geometriam situs. Commentarii Academiae Scientiarum Petropolitanae 8, 128\u2013140 (1741)","journal-title":"Commentarii Academiae Scientiarum Petropolitanae"},{"key":"9252_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Co, San Francisco (1979)"},{"key":"9252_CR12","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","volume":"51","author":"G Laporte","year":"2003","unstructured":"Laporte, G., Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.: A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper. Res. 51, 940\u2013951 (2003)","journal-title":"Oper. Res."},{"key":"9252_CR13","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":"9252_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","volume":"11","author":"O Martin","year":"1992","unstructured":"Martin, O., Otto, S.W., Felten, W.: Large step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett. 11, 219\u2013224 (1992)","journal-title":"Oper. Res. Lett."},{"key":"9252_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00037-005-0200-3","volume":"14","author":"S Safra","year":"2006","unstructured":"Safra, S., Schwartz, O.: On the complexity of approximating TSP with neighborhoods and related problems. Comput. Complex. 14, 281\u2013307 (2006)","journal-title":"Comput. Complex."},{"key":"9252_CR16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8, 541\u2013564 (2002)","journal-title":"J. Heuristics"},{"key":"9252_CR17","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209, 110 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9252-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9252-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9252-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T18:53:25Z","timestamp":1553626405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9252-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9252"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9252-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,9]]}}}