{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:27:37Z","timestamp":1759667257166,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T00:00:00Z","timestamp":1551657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T00:00:00Z","timestamp":1551657600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["17-71-10107","17-71-10107"],"award-info":[{"award-number":["17-71-10107","17-71-10107"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s12351-019-00471-7","type":"journal-article","created":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T09:01:49Z","timestamp":1551690109000},"page":"399-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Vehicle assignment in site-dependent vehicle routing problems with split deliveries"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0302-2673","authenticated-orcid":false,"given":"Mikhail V.","family":"Batsyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ekaterina K.","family":"Batsyna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya S.","family":"Bychkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,4]]},"reference":[{"key":"471_CR1","volume-title":"Wiley encyclopedia of operations research and management science","author":"DS Altner","year":"2011","unstructured":"Altner DS, Brooks JP (2011) Transportation algorithms. In: Cochran JJ, Cox LA Jr, Keskinocak P, Kharoufeh JP, Smith JC (eds) Wiley encyclopedia of operations research and management science. Wiley, Hoboken"},{"key":"471_CR2","doi-asserted-by":"crossref","unstructured":"Batsyn M, Ponomarenko A (2016) Heuristic for site-dependent truck and trailer routing problem with soft and hard time windows and split deliveries. Lecture Notes in Computer Science vol 9432, pp 65\u201379","DOI":"10.1007\/978-3-319-27926-8_7"},{"key":"471_CR3","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1057\/jors.2009.59","volume":"61","author":"M Caramia","year":"2010","unstructured":"Caramia M, Guerriero F (2010) A heuristic approach for the truck and trailer routing problem. J Oper Res Soc 61:1168\u20131180","journal-title":"J Oper Res Soc"},{"key":"471_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0305-0548(00)00056-3","volume":"29","author":"I-M Chao","year":"2002","unstructured":"Chao I-M (2002) A tabu search method for the truck and trailer routing problem. Comput Oper Res 29:33\u201351","journal-title":"Comput Oper Res"},{"issue":"3","key":"471_CR5","first-page":"319","volume":"37","author":"I-M Chao","year":"1999","unstructured":"Chao I-M, Golden BL, Wasil E (1999) A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR 37(3):319\u2013336","journal-title":"INFOR"},{"key":"471_CR6","doi-asserted-by":"crossref","unstructured":"Chao I-M, Liou T-S (2005) A new Tabu search heuristic for the site-dependent vehicle routing problem. In: Golden B, Raghavan S, Wasil E (eds) The next wave in computing, optimization, and decision technologies, operations research\/computer science interfaces series vol 29, pp 107\u2013119. Springer, New York","DOI":"10.1007\/0-387-23529-9_8"},{"key":"471_CR7","first-page":"292298","volume":"39","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau J-F, Laporte G (2001) A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39:292298","journal-title":"INFOR"},{"key":"471_CR8","first-page":"359","volume-title":"Activity analysis of production and allocation","author":"GB Dantzig","year":"1951","unstructured":"Dantzig GB (1951) Application of the simplex method to a transportation problem. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, pp 359\u2013373"},{"key":"471_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"ML Fisher","year":"1981","unstructured":"Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109\u2013124","journal-title":"Networks"},{"issue":"4","key":"471_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01720070","volume":"6","author":"F Gheysens","year":"1984","unstructured":"Gheysens F, Golden B, Assad A (1984) A comparison of techniques for solving the fleet size and mix vehicle routing problem. OR Spektrum 6(4):207\u2013216","journal-title":"OR Spektrum"},{"key":"471_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle dispatch problem. Oper Res 22:340\u2013349","journal-title":"Oper Res"},{"issue":"5","key":"471_CR12","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","volume":"20","author":"F Glover","year":"1974","unstructured":"Glover F, Karney D, Klingman D, Napier A (1974) A computation study on start procedures, basis change criteria, and solution algorithms for transportation problems. Manag Sci 20(5):793\u2013813","journal-title":"Manag Sci"},{"key":"471_CR14","first-page":"149","volume-title":"Vehicle routing: methods and studies","author":"B Nag","year":"1988","unstructured":"Nag B, Golden BL, Assad A (1988) Vehicle routing with site dependencies. In: Golden BL, Assad A (eds) Vehicle routing: methods and studies. Elsevier, Amsterdam, pp 149\u2013159"},{"issue":"8","key":"471_CR15","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435","journal-title":"Comput Oper Res"},{"issue":"4","key":"471_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF02023006","volume":"41","author":"F Semet","year":"1993","unstructured":"Semet F, Taillard E (1993) Solving real-life vehicle routing problems efficiently using tabu search. Ann Oper Res 41(4):469\u2013488","journal-title":"Ann Oper Res"},{"issue":"1","key":"471_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02098281","volume":"61","author":"F Semet","year":"1995","unstructured":"Semet F (1995) A two-phase algorithm for the partial accessibility constrained vehicle routing problem. Ann Oper Res 61(1):45\u201365","journal-title":"Ann Oper Res"},{"issue":"3","key":"471_CR18","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845\u2013858","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00471-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-019-00471-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00471-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T02:17:34Z","timestamp":1613701054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-019-00471-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00471-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2019,3,4]]},"assertion":[{"value":"2 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}