{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:34:12Z","timestamp":1777890852121,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00290-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"546-557","source":"Crossref","is-referenced-by-count":140,"title":["Separating capacity constraints in the CVRP using tabu search"],"prefix":"10.1016","volume":"106","author":[{"given":"P.","family":"Augerat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.M.","family":"Belenguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Benavent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Corber\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Naddef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00290-7_BIB1","first-page":"69","article-title":"Routing and scheduling of vehicles and crews: the state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB2","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","first-page":"431","article-title":"Vehicle routing","author":"Christofides","year":"1985"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB3","doi-asserted-by":"crossref","first-page":"179213","DOI":"10.1002\/net.3230110209","article-title":"Combinatorial optimization and vehicle fleet planning: Perspectives and prospects","volume":"11","author":"Magnanti","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB4","series-title":"Technical report","article-title":"Vehicle routing and scheduling: applications, algorithms and developments","author":"Osman","year":"1993"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB5","series-title":"Network Routing","first-page":"1","article-title":"Vehicle routing","author":"Fisher","year":"1995"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB6","article-title":"Computational results with a branch and cut code for the capacitated vehicle routing problem","author":"Augerat","year":"1995"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB7","article-title":"Parallel Branch and Cut for the Vehicle Routing","author":"Ralphs","year":"1995"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB8","series-title":"Experiments with a branch and cut code to solve large TSP instances","author":"Naddef","year":"1997"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search-Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search-Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB11","first-page":"3","article-title":"A user's guide to tabu search","volume":"41","author":"Taillard","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB12","series-title":"Separation heuristics for the Traveling Salesman Problem I: generalities and comb separation","author":"Naddef","year":"1997"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB13","series-title":"Separation heuristics for the Traveling Salesman Problem II: multi handle structures","author":"Naddef","year":"1997"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB14","series-title":"Vehicle routing","author":"Harche","year":"1991"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB15","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02085634","article-title":"A branch-and-cut for vehicle routing problems","volume":"50","author":"Araque","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","article-title":"Polyhedral study of the capacitated vehicle routing","volume":"60","author":"Cornuejols","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB18","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"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1090\/dimacs\/020\/02","article-title":"Practical problem solving with cutting plane algorithms in combinatorial optimization","volume":"20","author":"Reinelt","year":"1995","journal-title":"DIMACS Series in Discrete Math. and Theoretical Comp. Sci."},{"key":"10.1016\/S0377-2217(97)00290-7_BIB20","series-title":"Combinatorial Optimization","first-page":"318","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB21","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":"Operations Research Quarterly"},{"issue":"4","key":"10.1016\/S0377-2217(97)00290-7_BIB22","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum K-Trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB23","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 of Computing"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB24","article-title":"Data driven heuristics for the capacitated vehicle routing problem","author":"Campos","year":"1996"},{"key":"10.1016\/S0377-2217(97)00290-7_BIB25","author":"CPLEX Optimization Inc.","year":"1994","journal-title":"CPLEX"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002907?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002907?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:56:03Z","timestamp":1556110563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002907"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00290-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}