{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T14:53:17Z","timestamp":1692283997405},"reference-count":16,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0305-0548(95)00052-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"723-732","source":"Crossref","is-referenced-by-count":5,"title":["A parallel implementation of the TSSP + 1 decomposition for the capacity-constrained vehicle routing problem"],"prefix":"10.1016","volume":"23","author":[{"given":"Melissa","family":"Bowers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles E.","family":"Noon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00052-6_BIB1","series-title":"Combinatorial Optimization","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/0305-0548(95)00052-6_BIB2","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1979","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0305-0548(95)00052-6_BIB3","doi-asserted-by":"crossref","unstructured":"I. H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Ops. Res., to appear.","DOI":"10.1007\/BF02023004"},{"key":"10.1016\/0305-0548(95)00052-6_BIB4","article-title":"Parallel iterative search methods for vehicle routing problems","author":"Taillard","year":"1992"},{"key":"10.1016\/0305-0548(95)00052-6_BIB5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/0305-0548(93)90060-V","article-title":"Implementing an insertion heuristic for vehicle routing on parallel hardware","volume":"20","author":"Foisy","year":"1993","journal-title":"Comput. Op. Res."},{"key":"10.1016\/0305-0548(95)00052-6_BIB6","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/0377-2217(94)90063-9","article-title":"A TSSP + 1 decomposition strategy for the vehicle routing problem","volume":"79","author":"Noon","year":"1994","journal-title":"Eur. J. Op. Res."},{"key":"10.1016\/0305-0548(95)00052-6_BIB7","series-title":"Decison Sciences 78-11-05","article-title":"A decomposition algorithm for large-scale vehicle routing","author":"Fisher","year":"1978"},{"key":"10.1016\/0305-0548(95)00052-6_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(95)00052-6_BIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1057\/jors.1992.37","article-title":"An insert\/delete heuristic for the traveling salesman subset-tour problem with one addition constraint","volume":"43","author":"Mittenhal","year":"1992","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0305-0548(95)00052-6_BIB10","series-title":"Management Science","article-title":"Vehicle preassignment methods in vehicle routing problems","author":"Pillai","year":"1991"},{"key":"10.1016\/0305-0548(95)00052-6_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1967.44","article-title":"Bases for vehicle fleet scheduling","volume":"18","author":"Gaskell","year":"1967","journal-title":"Op. Res. Q."},{"key":"10.1016\/0305-0548(95)00052-6_BIB12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Op. Res. Q."},{"key":"10.1016\/0305-0548(95)00052-6_BIB13","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Op. Res."},{"key":"10.1016\/0305-0548(95)00052-6_BIB14","unstructured":"F. Harche and P. Raghavan, A generalized exchange heuristic for the capacitated vehicle routing problem. Working Paper, Stern School of Business, New York University."},{"key":"10.1016\/0305-0548(95)00052-6_BIB15","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0377-2217(84)90050-X","article-title":"A lagrangian relaxation heuristic for vehicle routing","volume":"15","author":"Stewart","year":"1984","journal-title":"Eur. J. Op. Res."},{"key":"10.1016\/0305-0548(95)00052-6_BIB16","series-title":"Solving vehicle routing problems using generalized assignments and tabu search","author":"Stewart","year":"1994"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:20:25Z","timestamp":1555204825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895000526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0305054895000526"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00052-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}