{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:18:26Z","timestamp":1782789506794,"version":"3.54.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T00:00:00Z","timestamp":1409702400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11590-014-0788-9","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T18:51:51Z","timestamp":1409683911000},"page":"1047-1056","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A general variable neighborhood search variants for the travelling salesman problem with draft limits"],"prefix":"10.1007","volume":"11","author":[{"given":"Raca","family":"Todosijevi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anis","family":"Mjirda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marko","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,9,3]]},"reference":[{"key":"788_CR1","doi-asserted-by":"publisher","unstructured":"Battara, M., Pessoa, A.A., Subramanian, A., Uchoa, E.: Exact algorithms for the travelling salesman problem with draft limits. Eur. J. Oper. Res. doi:\n                        10.1016\/j.ejor.2013.10.042","DOI":"10.1016\/j.ejor.2013.10.042"},{"key":"788_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6, 319\u2013360 (2008)","journal-title":"4OR"},{"key":"788_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"788_CR4","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"DS Johnson","year":"1995","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. Wiley, New York (1995)"},{"key":"788_CR5","doi-asserted-by":"publisher","unstructured":"Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenovi\u0107, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. doi:\n                        10.1016\/j.cor.2013.06.006i","DOI":"10.1016\/j.cor.2013.06.006i"},{"key":"788_CR6","doi-asserted-by":"crossref","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, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"788_CR7","first-page":"141","volume":"22","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Urosevi\u0107, D.: An efficient General variable neighborhood search for large TSP problem with time windows. Yugosl. J. Oper. Res. 22, 141\u2013151 (2012)","journal-title":"Yugosl. J. Oper. Res."},{"key":"788_CR8","doi-asserted-by":"publisher","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Urosevi\u0107, D.: Two level General variable neighborhood search for Attractive traveling salesman problem. Comput. Oper. Res. doi:\n                        10.1016\/j.cor.2013.04.015","DOI":"10.1016\/j.cor.2013.04.015"},{"key":"788_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Urosevi\u0107, D., Hanafi, A., Ili\u0107, A.: A General variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220, 270\u2013285 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"788_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10288-012-0212-1","volume":"11","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Urosevi\u0107, N., Hanafi, S.: Variable neighborhood search for the travelling deliveryman problem. 4OR 11, 57\u201373 (2012)","journal-title":"4OR"},{"key":"788_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11590-012-0553-x","volume":"7","author":"K Panchamgam","year":"2013","unstructured":"Panchamgam, K., Xiong, Y., Golden, B., Dussault, B., Wasil, E.: The hierarchical traveling salesman problem. Optim. Lett. 7, 1\u20138 (2013)","journal-title":"Optim. Lett."},{"key":"788_CR12","first-page":"2162","volume":"39","author":"JG Rakke","year":"2012","unstructured":"Rakke, J.G., Christiansen, M., Fagerholt, K., Laporte, G.: The travelling salesman problem with draft limits. Comput. Oper. Res. 39, 2162\u20132167 (2012)","journal-title":"Comput. Oper. Res."},{"key":"788_CR13","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\u2014a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"788_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11590-010-0256-0","volume":"6","author":"S Yadlapalli","year":"2012","unstructured":"Yadlapalli, S., Rathinam, S., Darbha, S.: 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim. Lett. 6, 141\u2013152 (2012)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0788-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0788-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0788-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0788-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:39Z","timestamp":1559409099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0788-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,3]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0788-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,3]]}}}