{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:41:47Z","timestamp":1768002107003,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0166-218x(00)00283-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"193-229","source":"Crossref","is-referenced-by-count":16,"title":["The vehicle routing problem with pickups and deliveries on some special graphs"],"prefix":"10.1016","volume":"116","author":[{"given":"Tali","family":"Eilam Tzoreff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Granot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frieda","family":"Granot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greys","family":"So\u0161i\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00283-3_BIB1","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1002\/net.3230220408","article-title":"The swapping problem","volume":"22","author":"Anily","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00283-3_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6377(94)90016-7","article-title":"The traveling salesman problem with delivery and backhauls","volume":"16","author":"Anily","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(00)00283-3_BIB3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews \u2013 state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00283-3_BIB4","series-title":"Vehicle Routing","article-title":"Vehicle routing with backhauls","volume":"Vol. 16","author":"Casco","year":"1988"},{"key":"10.1016\/S0166-218X(00)00283-3_BIB5","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1137\/S0097539795295468","article-title":"Approximating capacitated routing and delivery problems","volume":"28","author":"Chalasani","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00283-3_BIB6","unstructured":"P. Chalasani, R. Motwani, A.S. Rao, Algorithms for robot grasp and delivery, Proceedings of 2nd International Workshop of Algorithmic Foundations of Robotics, Toulouse, France, July 1996, pp. 347\u2013362."},{"key":"10.1016\/S0166-218X(00)00283-3_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(97)00074-7","article-title":"Routing of a vehicle of capacity greater than one","volume":"81","author":"Guan","year":"1998","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/S0166-218X(00)00283-3_BIB8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","article-title":"The traveling salesman problem with pickup and delivery","volume":"79","author":"Mosheiov","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00283-3_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/net.3230260408","article-title":"The pickup delivery location problem on networks","volume":"26","author":"Mosheiov","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00283-3_BIB10","unstructured":"G. Mosheiov, Vehicle routing with pick-up and delivery: tour-partitioning heuristics, Working Paper, The School of Business Administration and Department of Statistics, Hebrew University, Jerusalem, Israel, 1996."},{"issue":"3","key":"10.1016\/S0166-218X(00)00283-3_BIB11","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","article-title":"Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem","volume":"31","author":"Ratliff","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00283-3_BIB12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/inte.17.2.52","article-title":"Vehicle routing at quality stores","volume":"17","author":"Yano","year":"1987","journal-title":"Interfaces"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:27:16Z","timestamp":1556584036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0166218X00002833"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00283-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}