{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:51:59Z","timestamp":1777099919141,"version":"3.51.4"},"reference-count":50,"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":10724,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Heuristic programming algorithms frequently address large problems and require manipulation and operation on massive data sets. The algorithms can be improved by using efficient data structures. With this in mind, we consider heuristic algorithms for vehicle routing, comparing techniques of Clarke and Wright, Gillett and Miller, and Tyagi, and presenting modifications and extensions which permit problems involving hundreds of demand points to be solved in a matter of seconds. In addition, a multi\u2010depot routing algorithm is developed. The results are illustrated with a routing study for an urban newspaper with an evening circulation exceeding 100,000.<\/jats:p>","DOI":"10.1002\/net.3230070203","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:49:40Z","timestamp":1178855380000},"page":"113-148","source":"Crossref","is-referenced-by-count":217,"title":["Implementing vehicle routing algorithms"],"prefix":"10.1002","volume":"7","author":[{"given":"B. L.","family":"Golden","sequence":"first","affiliation":[]},{"given":"T. L.","family":"Magnanti","sequence":"additional","affiliation":[]},{"given":"H. Q.","family":"Nguyen","sequence":"additional","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.12.2.300"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321847"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040106"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(72)90072-X"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-7097(75)90003-4"},{"issue":"2","key":"e_1_2_1_8_2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/jors.1972.26","article-title":"TRAMP \u2010 A Multi\u2010depot Vehicle Scheduling System","volume":"23","author":"Cassidy P.","journal-title":"Operational Research Quarterly"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1969.75"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1972.79"},{"key":"e_1_2_1_11_2","unstructured":"Christofides N. \u201cThe Vehicle Routing Problem \u201dNATO Conference on Combinatorial Optimization July1974 Paris."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"Dantzig G.andJ.Ramser \u201cThe Truck Dispatching Problem \u201dManagement Science October1959 pp.81\u201391.","DOI":"10.1287\/mnsc.6.1.80"},{"key":"e_1_2_1_14_2","volume-title":"Distribution Management","author":"Eilon S.","year":"1971"},{"key":"e_1_2_1_15_2","unstructured":"Floyd R. \u201cTreesort Algorithm 113 \u201dACM Collected Algorithms August1962."},{"key":"e_1_2_1_16_2","unstructured":"Gabbay H. \u201cAn Overview of Vehicular Scheduling Problems \u201dTechnical Report No. 103 M. I. T. Operations Research Center September1974."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.3.4.407"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1967.44"},{"key":"e_1_2_1_19_2","volume-title":"The ORSA\/TIMS Meeting","author":"Gillett B.","year":"1974"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","unstructured":"Golden B. \u201cVehicle Routing Problems: Formulations and Heuristic Solution Techniques \u201dTechnical Report No. 113 M.I. T. Operations Research Center August1975.","DOI":"10.21236\/ADA013639"},{"key":"e_1_2_1_22_2","unstructured":"Golden B. T.MagnantiandH.Nguyen \u201cImplementing Vehicle Routing Algorithms \u201dTechnical Report No. 115 M.I. T. Operations Research Center September1975."},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584070"},{"key":"e_1_2_1_25_2","unstructured":"Hudson J. D.GrossmanandD.Marks \u201cAnalysis Models for Solid Waste Collection \u201dM.I.T. Civil Engineering Report September1973."},{"key":"e_1_2_1_26_2","volume-title":"Report H20\u20130464","year":"1968"},{"key":"e_1_2_1_27_2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","article-title":"A Heuristic Approach to Solving Traveling Salesman Problems","volume":"10","author":"Karg L.","journal-title":"Management Science"},{"key":"e_1_2_1_28_2","doi-asserted-by":"crossref","unstructured":"Kershenbaum A.andR.Van Slyke \u201cComputing Minimum Spanning Trees Efficiently \u201dProc. of 1972 ACM Conference Boston August1972.","DOI":"10.1145\/800193.569966"},{"key":"e_1_2_1_29_2","unstructured":"Klincewicz J. \u201cThe Tyagi Algorithm for Truck Dispatching \u201dUROP Final Project Report M.I.T. 1975."},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.6.2.149"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_2_1_33_2","first-page":"972","volume-title":"An Algorithm for the Traveling Salesman Problem","author":"Little J. D. C.","year":"1963"},{"key":"e_1_2_1_34_2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer Programming Formulation of Traveling Salesman Problems","volume":"7","author":"Miller C.","year":"1960","journal-title":"JACM"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(74)90047-1"},{"key":"e_1_2_1_36_2","unstructured":"Nguyen H. \u201cMulti\u2010Depot Vehicle Routing Problems \u201dMaster's Thesis Sloan School of Management M.I.T. 1975."},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040105"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040205"},{"key":"e_1_2_1_39_2","volume-title":"Technical Report 75\/TR\u20107","author":"Orloff C.","year":"1975"},{"key":"e_1_2_1_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(69)90101-4"},{"key":"e_1_2_1_41_2","volume-title":"The ORSA\/Tims Meeting","author":"Robbins J.","year":"1975"},{"key":"e_1_2_1_42_2","volume-title":"The ORSA\/TIMS Meeting","author":"Russell R.","year":"1975"},{"key":"e_1_2_1_43_2","unstructured":"Shapiro D. \u201cAlgorithms for the Solution of the Optimal Cost Traveling Salesman Problem \u201dSc. D. Thesis Washington University St. Louis 1966."},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.19.7.790"},{"key":"e_1_2_1_45_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.11.664"},{"key":"e_1_2_1_46_2","doi-asserted-by":"publisher","DOI":"10.1080\/05695557408974967"},{"key":"e_1_2_1_47_2","first-page":"76","article-title":"A Practical Method for the Truck Dispatching Problem","volume":"10","author":"Tyagi M.","year":"1968","journal-title":"J. of the Operations Research Society of Japan"},{"key":"e_1_2_1_48_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1972.55"},{"issue":"6","key":"e_1_2_1_49_2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams J.","year":"1964","journal-title":"Comm. ACM"},{"key":"e_1_2_1_50_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1972.53"},{"key":"e_1_2_1_51_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1970.52"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:30:16Z","timestamp":1699785016000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["10.1002\/net.3230070203"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070203","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}