{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:18:19Z","timestamp":1782789499409,"version":"3.54.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10732-019-09406-z","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:28:30Z","timestamp":1548761310000},"page":"339-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The selective traveling salesman problem with draft limits"],"prefix":"10.1007","volume":"26","author":[{"given":"Shahin","family":"Gelareh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rahimeh","family":"Neamatian Monemi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"issue":"1","key":"9406_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1137\/S009753979528826X","volume":"28","author":"B Awerbuch","year":"1998","unstructured":"Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28(1), 254\u2013262 (1998)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9406_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"issue":"1","key":"9406_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ejor.2013.10.042","volume":"235","author":"M Battarra","year":"2014","unstructured":"Battarra, M., Pessoa, A.A., Subramanian, A., Uchoa, E.: Exact algorithms for the traveling salesman problem with draft limits. Eur. J. Oper. Res. 235(1), 115\u2013128 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9406_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1111\/j.1475-3995.1995.tb00023.x","volume":"2","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., Maffioli, F., V\u00e4rbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2(3), 297\u2013308 (1995)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9406_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"issue":"3","key":"9406_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logist. 34(3), 307\u2013318 (1987)","journal-title":"Naval Res. Logist."},{"issue":"1","key":"9406_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9406_CR8","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"9406_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107, A., Uro\u0161evi\u0107, D., Brimberg, J., Mladenovi\u0107, N.: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2), 289\u2013300 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9406_CR10","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson, D.S., McGeoch, L.: The traveling salesman problem: a case study in local optimization. In: Aarts, E., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. Wiley, New York (1997)"},{"issue":"4","key":"9406_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.15807\/jorsj.31.515","volume":"31","author":"S Kataoka","year":"1988","unstructured":"Kataoka, S., Morito, S.: An algorithm for single constraint maximum collection problem. J. Oper. Res. Soc. Jpn. 31(4), 515\u2013530 (1988)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"2","key":"9406_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Appl. Math. 26(2), 193\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"9406_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9406_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.2298\/YJOR120530015M","volume":"23","author":"N Mladenovi\u0107","year":"2013","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: An efficient general variable neighborhood search for large travelling salesman problem with time windows. Yugosl. J. Oper. Res. 23(1), 19\u201330 (2013)","journal-title":"Yugosl. J. Oper. Res."},{"key":"9406_CR15","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160\u2013171 (2016)","journal-title":"Inf. Sci."},{"issue":"9","key":"9406_CR16","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1016\/j.cor.2011.10.025","volume":"39","author":"JG Rakke","year":"2012","unstructured":"Rakke, J.G., Christiansen, M., Fagerholt, K., Laporte, G.: The traveling salesman problem with draft limits. Comput. Oper. Res. 39(9), 2161\u20132167 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9406_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, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"9406_CR18","doi-asserted-by":"crossref","unstructured":"Todosijevi\u0107, R., Mjirda, A., Mladenovi\u0107, M., Hanafi, S., Gendron, B.: A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. (2014). \nhttps:\/\/doi.org\/10.1007\/s11590-014-0788-9","DOI":"10.1007\/s11590-014-0788-9"},{"key":"9406_CR19","doi-asserted-by":"crossref","unstructured":"Todosijevi\u0107, R., Uro\u0161evi\u0107, D., Mladenovi\u0107, N., Hanafi, S.: A general variable neighborhood search for solving the uncapacitated \n$$r$$\n\n\n\nr\n\n\n\n-allocation \n$$p$$\n\n\n\np\n\n\n\n-hub median problem. Optim. Lett. (2015). \nhttps:\/\/doi.org\/10.1007\/s11590-015-0867-6","DOI":"10.1007\/s11590-015-0867-6"},{"issue":"1","key":"9406_CR20","doi-asserted-by":"publisher","first-page":"1","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(1), 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09406-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09406-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09406-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T04:27:42Z","timestamp":1587616062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09406-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["9406"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09406-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"3 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}