{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:28:41Z","timestamp":1774952921852,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"3","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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0377-2217(01)00237-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:23:30Z","timestamp":1027639410000},"page":"618-628","source":"Crossref","is-referenced-by-count":108,"title":["A sweep-based algorithm for the fleet size and mix vehicle routing problem"],"prefix":"10.1016","volume":"140","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"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00237-5_BIB1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0305-0548(99)00058-1","article-title":"The column-circular sub-sets selection problem: Complexity and solutions","volume":"27","author":"Boctor","year":"2000","journal-title":"Computers and Operation Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB2","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","article-title":"Polyhedral study of the capacitated vehicle routing problem","volume":"60","author":"Cornu\u00e9jols","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(91)90028-P","article-title":"A new heuristic for the fleet size and mix vehicle routing problem","volume":"18","author":"Desrochers","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1057\/jors.1983.11","article-title":"Vehicle fleet composition","volume":"34","author":"Etezadi","year":"1983","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB6","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\/S0377-2217(01)00237-5_BIB7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1057\/jors.1976.63","article-title":"An integer programming approach to the vehicle scheduling problem","volume":"27","author":"Foster","year":"1976","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB8","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\/S0377-2217(01)00237-5_BIB9","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":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB10","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","article-title":"A tabu search heuristic for the heterogeneous fleet vehicle routing problem","volume":"26","author":"Gendreau","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01720070","article-title":"A comparison of techniques for solving the fleet size and mix vehicle routing problem","volume":"6","author":"Gheysens","year":"1984","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BFb0121103","article-title":"A new heuristic for determining fleet size and composition","volume":"26","author":"Gheysens","year":"1986","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB13","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic for the vehicle dispatching problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","article-title":"The fleet size and mix vehicle routing problem","volume":"11","author":"Golden","year":"1984","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1057\/jors.1969.30","article-title":"The size and composition of a road transport fleet","volume":"20","author":"Gould","year":"1969","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","article-title":"A new exact algorithm for the vehicle routing problem based on q-path and k-shortest paths relaxations","volume":"61","author":"Hadjiconstantinou","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","article-title":"Routing problems: A bibliography","volume":"61","author":"Laporte","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB20","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solution of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Computer Journal"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB21","unstructured":"Or, I., 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Doctoral Dissertation, Northwestern University"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB22","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB23","series-title":"Modern Heuristic Search Methods","first-page":"131","article-title":"Local search strategies for the vehicle fleet mix problem","author":"Osman","year":"1996"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB24","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1057\/jors.1996.29","article-title":"An improved petal heuristic for the vehicle routing problem","volume":"47","author":"Renaud","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB25","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\/S0377-2217(01)00237-5_BIB26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB27","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1057\/jors.1993.54","article-title":"Extension of the petal method for vehicle routing","volume":"44","author":"Ryan","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB28","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1057\/jors.1987.47","article-title":"Improvement to vehicle routing heuristics","volume":"38","author":"Salhi","year":"1987","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB29","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0377-2217(93)90220-H","article-title":"Incorporating vehicle routing into the vehicle fleet composition problem","volume":"66","author":"Salhi","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB30","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0483(92)90009-V","article-title":"Adaptation of some vehicle fleet mix heuristics","volume":"20","author":"Salhi","year":"1992","journal-title":"OMEGA International Journal of Management Science"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB31","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iteration search methods for vehicle routing","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","article-title":"A heuristic column generation method for the heterogeneous fleet VRP","volume":"33","author":"Taillard","year":"1999","journal-title":"RAIRO"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1108\/eb014462","article-title":"Truck fleet size composition for concrete distribution","volume":"10","author":"Woods","year":"1979","journal-title":"International Journal of Physical Distribution"},{"key":"10.1016\/S0377-2217(01)00237-5_BIB34","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1057\/jors.1972.53","article-title":"Computer scheduling of vehicle from one or more depots to a number of delivery points","volume":"23","author":"Wren","year":"1972","journal-title":"Operational Research Quarterly"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:20:55Z","timestamp":1555154455000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0377221701002375"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00237-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}