{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T10:11:38Z","timestamp":1770718298897,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1008768313174","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"265-277","source":"Crossref","is-referenced-by-count":16,"title":["Heuristic Procedures for the Capacitated Vehicle Routing Problem"],"prefix":"10.1007","volume":"16","author":[{"given":"V.","family":"Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"271481_CR1","unstructured":"P. Augerat, J.M. Belenguer, E. Benavent, A. Corber\u00e1n, D. Naddef, and G. Rinaldi, \u201cComputational results with a branch and cut code for the capacitated vehicle routing problem,\u201d Institut IMAG, University Joseph Fourier Grenoble I, Working paper RR949-M, 1995."},{"key":"271481_CR2","unstructured":"M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, vol. 8, Elsevier Science B.V., 1995."},{"key":"271481_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"N. Christofides, and S. Eilon, \u201cAn algorithm for the vehicle dispatching problem,\u201d Operations Research Quartely, vol. 20, pp. 309\u2013318, 1969.","journal-title":"Operations Research Quartely"},{"key":"271481_CR4","unstructured":"N. Christofides, E. Hadjiconstantinou, and A. Mingozzi, \u201cAn exact algorithm for the vehicle routing problem based on the set partitionning formulation,\u201d communication presented at EURO XIII, Glasgow, July 1994."},{"key":"271481_CR5","first-page":"318","volume-title":"Combinatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"N. Christofides, A. Mingozzi, and P. Toth, \u201cThe vehicle routing problem,\u201d in Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (Eds.), Wiley: Chichester, 1979, pp. 318\u2013338."},{"key":"271481_CR6","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"G. Clarke and J. Wright, \u201cScheduling of vehicles from a central depot to a number of delivery points,\u201d Operations Research, vol. 12, pp. 568\u2013581, 1964.","journal-title":"Operations Research"},{"key":"271481_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G. Cornuejols","year":"1993","unstructured":"G. Cornuejols and F. Harche, \u201cPolyhedral study of the capacitated vehicle routing problem,\u201d Mathematical Programming, vol. 60, pp. 21\u201352, 1993.","journal-title":"Mathematical Programming"},{"key":"271481_CR8","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42-44","author":"M.L. Fisher","year":"1994","unstructured":"M.L. Fisher, \u201cOptimal solution of vehicle routing problems using minimum K-trees,\u201d Operations Research, vol. 42-44, pp. 626\u2013642, 1994.","journal-title":"Operations Research"},{"key":"271481_CR9","unstructured":"M.L. Fisher, \u201cVehicle routing,\u201d in Handbooks in Operations Research and Management Science, vol. 8, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Elsevier Science B.V., 1995, pp. 1-33."},{"key":"271481_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher and R. Jaikumar, \u201cA generalized assignment heuristic for the vehicle routing problem,\u201d Networks, vol. 11, pp. 109\u2013124, 1981.","journal-title":"Networks"},{"key":"271481_CR11","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"M. Gendreau, A. Hertz, and G. Laporte, \u201cA tabu search heuristic for the vehicle routing problem,\u201d Management Science, vol. 40, pp. 1276\u20131290, 1994.","journal-title":"Management Science"},{"key":"271481_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, \u201cTabu search-Part I,\u201d ORSA Journal of Computing, vol. 1, pp. 190\u2013206, 1989.","journal-title":"ORSA Journal of Computing"},{"key":"271481_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, \u201cTabu search-Part II,\u201d ORSA Journal of Computing, vol. 2, pp. 4\u201332, 1990.","journal-title":"ORSA Journal of Computing"},{"key":"271481_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"F. Glover, E. Taillard, and D. De Werra, \u201cA user's guide to tabu search,\u201d Annals of Operations Research, vol. 41, pp. 3\u201328, 1993.","journal-title":"Annals of Operations Research"},{"key":"271481_CR15","first-page":"2245","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin, and B.W. Kernighan, \u201cAn effective heuristic algorithm for the travelling salesman problem,\u201d Operations Research, vol. 21, pp. 2245\u20132269, 1973.","journal-title":"Operations Research"},{"key":"271481_CR16","unstructured":"S. Martello and P. Toth, \u201cGeneralized assignment problem,\u201d in Knapsack Problems Algorithms and Computer Implementations, John Wiley and Sons Ltd., pp. 189-220, 1990."},{"key":"271481_CR17","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"I.H. Osman, \u201cMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,\u201d Annals of Operations Research, vol. 41, pp. 421\u2013451, 1993.","journal-title":"Annals of Operations Research"},{"key":"271481_CR18","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1993","unstructured":"G. Reinelt, \u201cTSPLIB: A travelling salesman problem library,\u201d ORSA Journal of Computing, vol. 3, pp. 376\u2013384, 1993.","journal-title":"ORSA Journal of Computing"},{"key":"271481_CR19","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. Taillard","year":"1993","unstructured":"E. Taillard, \u201cParallel iterative search methods for vehicle routing problems,\u201d Networks, vol. 23, pp. 661\u2013674, 1993.","journal-title":"Networks"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008768313174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008768313174\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008768313174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:26:44Z","timestamp":1752377204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008768313174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["271481"],"URL":"https:\/\/doi.org\/10.1023\/a:1008768313174","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}