{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T12:07:15Z","timestamp":1769429235191,"version":"3.49.0"},"reference-count":8,"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":9263,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The set partitioning model is used as the basis for an interactive approach for solving a broad class of routing problems. A pricing mechanism is developed which can be used with a variety of methods in generating improving solutions. A version of the approach for delivery problems has been implemented via a colorgraphics display. The human aided optimization procedure was tested on the standard 50\u2010point, 75\u2010point, and 100\u2010point test problems of Eilon, Watson\u2010Gandy, and Christofides [6]. In the case of the first two test problems, the procedure was able to generate the best known solutions. In the 100\u2010point problem, a better solution was generated than the current best known solution.<\/jats:p>","DOI":"10.1002\/net.3230110206","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:01:24Z","timestamp":1178884884000},"page":"125-143","source":"Crossref","is-referenced-by-count":96,"title":["Set partitioning based heuristics for interactive routing"],"prefix":"10.1002","volume":"11","author":[{"given":"Frank H.","family":"Cullen","sequence":"first","affiliation":[]},{"given":"John J.","family":"Jarvis","sequence":"additional","affiliation":[]},{"given":"H. Donald","family":"Ratliff","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.1137\/1018115"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.2.300"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.3.1.74"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_2_1_6_2","unstructured":"L.Cooper \u201cN\u2010Dimensional Location\u2010Allocation Used for Cluster Analysis\u201d Report No. COO\u20101493\u201323 Washington University St. Louis MO 1969."},{"key":"e_1_2_1_7_2","first-page":"200","volume-title":"Distribution Management","author":"Eilon S.","year":"1971"},{"key":"e_1_2_1_8_2","unstructured":"P. D.KrolakandJ. H.Nelson \u201cA Family of Truck Load Clustering (TLC) Heuristics for Solving Vehicle Scheduling Problems\u201d Technical Report 78\u20132 Computer Science Vanderbilt University Nashville TN 1978."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.3.517"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:41:31Z","timestamp":1699789291000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1002\/net.3230110206"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110206","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}