{"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":1775979357769,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":[[2002,8]]},"DOI":"10.1016\/s0305-0548(00)00109-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:31:41Z","timestamp":1027593101000},"page":"1129-1141","source":"Crossref","is-referenced-by-count":45,"title":["Perturbation heuristics for the pickup and delivery traveling salesman problem"],"prefix":"10.1016","volume":"29","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":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00109-X_BIB1","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(00)00109-X_BIB2","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(00)00109-X_BIB3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1080\/01966324.1986.10737199","article-title":"Scheduling large-scale advance-request dial-a-ride systems","volume":"6","author":"Psaraftis","year":"1986","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB4","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/trsc.19.4.378","article-title":"Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling","volume":"19","author":"Sexton","year":"1985","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/trsc.19.4.411","article-title":"Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing","volume":"19","author":"Sexton","year":"1985","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB6","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/01966324.1986.10737200","article-title":"Pickup and delivery of partial loads with time windows","volume":"6","author":"Sexton","year":"1986","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB7","first-page":"301","article-title":"A dynamic programming solution to the large-scale single-vehicle dial-a-ride problem with time windows","volume":"6","author":"Desrosiers","year":"1986","journal-title":"American Journal of Mathematics and Management Science"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","article-title":"A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows","volume":"20","author":"Jaw","year":"1986","journal-title":"Transportation Research B"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pick-up and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/trsc.27.3.298","article-title":"Variable-depth search for the single-vehicle pickup and delivery problem with time windows","volume":"27","author":"Van der Bruggen","year":"1993","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB11","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(00)00109-X_BIB12","series-title":"Vehicle routing: methods and studies","first-page":"p121","article-title":"Vehicle routing with backhauls: models, algorithms and case studies, 1988","author":"Casco","year":"1988"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(89)90057-X","article-title":"The vehicle routing problem with backhauls","volume":"42","author":"Goetschalckx","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1287\/trsc.33.3.315","article-title":"An exact method for the vehicle routing problem with backhaul","volume":"33","author":"Mingozzi","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB15","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1287\/opre.45.4.639","article-title":"An approximation algorithm for the traveling salesman problem with backhauls","volume":"45","author":"Gendreau","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB16","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 & Operations Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB17","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(00)00109-X_BIB18","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(00)00109-X_BIB19","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(00)00109-X_BIB20","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","article-title":"A heuristic for the pickup and delivery traveling salesman problem","volume":"27","author":"Renaud","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB21","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB22","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","article-title":"The noising method: a new method for combinatorial optimization","volume":"14","author":"Charon","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB24","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.8.2.125","article-title":"Perturbation: an efficient technique for the solution of very large instances of Euclidean TSP","volume":"8","author":"Codenotti","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB25","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","article-title":"Simulated annealing: a tool for operational research","volume":"46","author":"Eglese","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB26","unstructured":"Boctor FF. Discrete optimization and multi-neighbourhood local improvement heuristics. Working paper 93-35, Facult\u00e9 des sciences de l'administration, Universit\u00e9 Laval, 1993."},{"key":"10.1016\/S0305-0548(00)00109-X_BIB27","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighbourhood search","volume":"24","author":"Mladenovic","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB28","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1057\/jors.1996.60","article-title":"Genetic algorithms \u2014 a tool for OR?","volume":"47","author":"Dowsland","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB29","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1051\/ro\/1996300403731","article-title":"A hybrid genetic algorithms in combinatorial optimization","volume":"30","author":"Fleurent","year":"1996","journal-title":"RAIRO"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB30","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(00)00109-X_BIB31","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 Systems Technical Journal"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB32","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB-A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(00)00109-X_BIB33","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 problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Review"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480000109X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480000109X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T21:55:09Z","timestamp":1556834109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505480000109X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":33,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S030505480000109X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00109-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}