{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T07:35:57Z","timestamp":1775979357580,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0305-0548(99)00066-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:18:34Z","timestamp":1027649914000},"page":"905-916","source":"Crossref","is-referenced-by-count":85,"title":["A heuristic for the pickup and delivery traveling salesman problem"],"prefix":"10.1016","volume":"27","author":[{"given":"Jacques","family":"Renaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fayez F.","family":"Boctor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamal","family":"Ouenniche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00066-0_BIB1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problem","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","article-title":"Solution of large-scale symmetric traveling salesman problems","volume":"51","author":"Gr\u00f6tschel","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB3","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and post-optimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB4","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1287\/opre.43.6.1049","article-title":"An effective tour construction and improvement procedure for the traveling salesman problem","volume":"43","author":"Zweig","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB5","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"8","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","article-title":"A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem","volume":"14","author":"Psaraftis","year":"1980","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0191-2615(83)90041-3","article-title":"Analysis of an O(N2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem","volume":"17B","author":"Psaraftis","year":"1983","journal-title":"Transportation Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","article-title":"The traveling salesman problem with backhauls","volume":"23","author":"Gendreau","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","article-title":"An algorithm for the traveling salesman problem with pickup and delivery customers","volume":"22","author":"Kalantari","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","article-title":"An efficient implementation of local search algorithms for constrained routing problems","volume":"47","author":"Savelsbergh","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","article-title":"A new extension of local search applied to the dial-a-ride problem","volume":"83","author":"Healy","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB13","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions to the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB14","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0377-2217(83)90099-1","article-title":"k-interchange procedure for local search in a precedence-constrained routing problem","volume":"13","author":"Psaraftis","year":"1983","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00066-0_BIB15","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB \u2013 A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000660?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000660?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T19:58:35Z","timestamp":1555271915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0305054899000660"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00066-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}