{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T12:41:05Z","timestamp":1769863265886,"version":"3.49.0"},"reference-count":24,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":11971,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1974,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In a previous paper, algorithms for optimally routing a single vehicle were presented. In this paper, the problem of routing a fleet of M vehicles serving fixed demand for transportation from many origins to a single destination is considered. The M vehicle General Routing Problem (abbreviated M\u2010GRP) is the core of many real routing problems, such as school bus routing for a single school (many\u2010to\u2010one) and garbage truck routing to a central dump. It is shown that the M\u2010GRP on a given graph is equivalent to a GRP on a modified graph. From this result, it is shown that single vehicle routing algorithms can be applied to the M vehicle routing problem.<\/jats:p>","DOI":"10.1002\/net.3230040205","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T01:27:08Z","timestamp":1178846828000},"page":"147-162","source":"Crossref","is-referenced-by-count":37,"title":["Routing a fleet of M vehicles to\/from a central facility"],"prefix":"10.1002","volume":"4","author":[{"given":"C. S.","family":"Orloff","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.2.278"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"key":"e_1_2_1_4_2","volume-title":"The Theory of Graphs","author":"Berge C.","year":"1962"},{"key":"e_1_2_1_5_2","first-page":"35","article-title":"Maximum Matching and a Polyhedron with 0, 1 Vertices","volume":"696","author":"Edmonds J.","year":"1965","journal-title":"J. Res. of the National Bureau of Standards"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_8_2","volume-title":"Integer Programming","author":"Garfinkel R.","year":"1972"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_10_2","volume-title":"Integer Programming and Network Flows","author":"Hu T. C.","year":"1969"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.1.91"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"Karp R. M. \u201cReducibility Among Combinatorial Problems \u201dTech. Report #3 University of California Berkeley California April1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_13_2","unstructured":"Leibman J. \u201cNotes on Edmonds' Matching and White's K\u2010Matching \u201d unpublished class notes Johns Hopkins University 1972."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"e_1_2_1_15_2","unstructured":"Orloff C. \u201cRouting and Scheduling a Fleet of Vehicles: The School Bus Problem \u201d Ph.D. Dissertation Cornell University January1973."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040105"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.2.300"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"e_1_2_1_21_2","unstructured":"Newton R. \u201cBus Routing in a Multi\u2010School System \u201d Ph.D. Dissertation SUNY at Buffalo 1970."},{"key":"e_1_2_1_22_2","unstructured":"IBM Vehicle Scheduling Program \u2010 Extended (VSPX) Program Description Manual 1970."},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.19.7.790"},{"key":"e_1_2_1_24_2","volume-title":"Distribution Management","author":"Eilon S.","year":"1971"},{"key":"e_1_2_1_25_2","unstructured":"Hong S. \u201cA Linear Programming Approach for the Travelling Salesman Problem \u201d Ph.D. Dissertation The Johns Hopkins University June 1972."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230040205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230040205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:19:16Z","timestamp":1699798756000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230040205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,1]]}},"alternative-id":["10.1002\/net.3230040205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230040205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,1]]}}}